An orthogonal similarity reduction of a matrix into semiseparable form

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 1, 2006, Pages 176-197

  Van Barel, M ^a   Vandebril, R ^a   Mastronardi, N ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b CNR   (Italy)

Author keywords

Lanczos algorithm; Ritz values; Semiseparable matrix; Similarity transformation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; NUMERICAL ANALYSIS;

LANCZOS ALGORITHM; RITZ VALUES; SEMISEPARABLE MATRIX; SIMILARITY TRANSFORMATION;

MATRIX ALGEBRA;

EID: 33144489927     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479803428229     Document Type: Article

References (25)

1. M. BRAUN, S. A. SOFIANOS, D. G. PAPAGEORGIOU, AND I. E. LAGARIS, An efficient Chebyshev Lanczos method for obtaining eigensolutions of the Schrödinger equation on a grid, J. Comput. Phys., 126 (1996), pp. 315-327.
2. S. CHANDRASEKARAN AND M. GU, Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices, Linear Algebra Appl., 313 (2000), pp. 107-114.
3. S. CHANDRASEKARAN AND M. GU, A divide and conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semi-separable matrices, Numer. Math., 96 (2004), pp. 723-731.
4. J. DEMMEL AND K. VESELIĆ, Jacobi's method is more accurate than QR, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 1204-1245.
5. J. W. DEMMEL, Applied Numerical Linear Algebra, SIAM, Philadelphia, 1997.
6. D. FASINO, N. MASTRONARDI, AND M. VAN BAREL, Fast and stable algorithms for reducing diagonal plus semiseparable matrices to tridiagonal and bidiagonal form, in Fast Algorithms for Structured Matrices: Theory and Applications, V. Olshevsky, ed., Contemp. Math. 323, AMS, Providence, RI, SIAM, Philadelphia, 2003, pp. 105-118.
7. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
8. I. T. JOLLIFFE, Principal Component Analysis, Springer-Verlag, New York, 1986.
9. R. B. LEHOUCQ AND D. C. SORENSEN, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
10. R. S. MARTIN AND J. H. WILKINSON, Householder's tridiagonalization of a symmetric matrix, Numer. Math., 11 (1968), pp. 181-195.
11. N. MASTRONARDI, E. VAN CAMP, AND M. VAN BAREL, Divide and conquer algorithms for com puting the eigendecomposition of symmetric diagonal-plus-semiseparable matrices, Numer. Algorithms, 39 (2005), pp. 379-398.
12. B. N. PARLETT AND I. S. DHILLON, Relatively robust representations of symmetric tridiagonals, Linear Algebra Appl., 309 (2000), pp. 121-151.
13. G. W. STEWART, Matrix Algorithms, Vol. II. Eigensystems, SIAM, Philadelphia, 2001.
14. G. STRANG AND T. NGUYEN, The Interplay of Ranks of Submatrices, SIAM Rev., 46 (2004), pp. 637-646.
15. L. N. TREFETHEN AND D. BAU, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
16. M. VAN BAREL, R. VANDEBRIL, AND N. MASTRONARDI, The Lanczos-Ritz Values Appearing in an Orthogonal Similarity Reduction of a Matrix into Semiseparable Form, Report TW 360, Department of Computer Science, K. U. Leuven, Leuven, Belgium, 2003. Available online from http://www.cs.kuleuven.ac.be/publicaties/rapporten/tw/TW360.abs.html.
17. E. VAN CAMP, N. MASTRONARDI, AND M. VAN BAREL, Two fast algorithms for solving diagonal-plus- semiseparable linear systems, J. Comput. Appl. Math., 164-165 (2004), pp. 731-747.
18. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, An implicit QR algorithm for symmetric semiseparable matrices, Numer. Linear Algebra Appl., to appear.
19. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, A note on the representation and definition of semiseparable matrices, Numer. Linear Algebra Appl., to appear.
20. M. E. WALL, P.A. DYCK, AND T. S. BRETTIN, Svdman - singular value decomposition analysis of microarray data, Bioinform., 17 (2001), pp. 566-568.
21. M. E. WALL, A. RECHTSTEINER, AND L. M. ROCHA, Singular value decomposition and principal component analysis, in A Practical Approach to Microarray Data Analysis, D. P. Berrar, W. Dubitzky, and M. Granzow, eds., Kluwer Academic, Dordrecht, The Netherlands, 2003, pp. 91-109.
22. D. S. WATKINS, QR-like algorithms: An overview of convergence theory and practice, in The Mathematics of Numerical Analysis, Lectures in Appl. Math. 32, AMS, Providence, RI, 1996, pp. 879-893.
23. D. S. WATKINS AND L. ELSNER, Convergence of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
24. M. K. S. YEUNG AND W. L. RUZZO, Principal component analysis for clustering gene expression data, Bioinform., 17 (2001), pp. 763-774.
25. M. K. S. YEUNG, J. TEGNéR, AND J. J. COLLINS, EDS., Reverse engineering gene networks using singular value decomposition and robust regression, Proc. Natl. Acad. Sci., 99 (2002), pp. 6163-6168.