Fast and stable algorithms for banded plus semiseparable systems of linear equations

SIAM Journal on Matrix Analysis and Applications

Volumn 25, Issue 2, 2004, Pages 373-384

  Chandrasekaran, S ^a   Gu, M ^b  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Banded matrix; Bordered matrix; Fast algorithms; H matrix; Semiseparable matrix; Stable algorithms

Indexed keywords

EID: 1442333998     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479899353373     Document Type: Article

References (15)

1. E. ANDERSON, Z. BAI, C. BISCHOF, S. BLACKFORD, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, AND D. SORENSEN, LAPACK Users' Guide, 3rd ed., SIAM, Philadelphia, 1999.
2. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
3. Y. EIDELMAN AND I. GOHBERG, Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices, Comput. Math. Appl., 33 (1997), pp. 69-79.
4. Y. EIDELMAN AND I. GOHBERG, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices, Comput. Math. Appl., 35 (1998), pp. 25-34.
5. G. GOLUB AND C. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996.
6. W. GOVAERTS, Stable solvers and block elimination for bordered systems, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 469-483.
7. L. GREENGARD AND V. ROKHLIN, On the numerical solution of two-point boundary value problems, Comm. Pure Appl. Math., 44 (1991), pp. 419-452.
8. J.-Y. LEE AND L. GREENGARD, A fast adaptive numerical method for stiff two-point boundary value problems, SIAM J. Sci. Comput., 18 (1997), pp. 403-429.
9. W. HACKBUSCH AND B. KHOROMSKIJ, A sparse H-matrix arithmetic: General complexity estimates, J. Comput. Appl. Math., 125 (2000), pp. 479-501.
10. 2-matrices, in Lectures on Applied Mathematics, H.-J. Bungartz, R. H. W. Hoppe, and C. Zenger, eds., Springer-Verlag, Berlin, 2000, pp. 9-29.
11. W. HACKBUSCH AND B. N. KHOROMSKIJ, Towards H-matrix approximation of linear complexity, in Problems and Methods in Mathematical Physics, J. Elschner, I. Hohberg, and B. Silbermann, eds., Birkhäuser, Basel, 2001, pp. 194-220.
12. S. VAN HUFFEL AND H. PARK, Efficient reduction algorithms for bordered band matrices, J. Numer. Linear Algebra Appl., 2 (1995), pp. 95-113.
13. Y. SAAD, Iterative Methods for Sparse Linear Systems, 2nd ed., SIAM, Philadelphia, 2003.
14. H. P. STARR, JR., On the Numerical Solution of One-Dimensional Integral and Differential Equations, Ph.D. thesis, Department of Computer Science, Yale University, New Haven, CT, 1992.
15. G. W. STEWART, Updating a rank-revealing ULV decomposition, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 494-499.