Orthogonal similarity transformation into block-semiseparable matrices of semiseparability rank k

Numerical Linear Algebra with Applications

Volumn 12, Issue 10, 2005, Pages 981-1000

  Van Barel, M ^a   Van Camp, E ^a   Mastronardi, N ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b CNR   (Italy)

Author keywords

Block lanczos' algorithm; Block semiseparable matrix; Ritz values; Semiseparability rank k; Similarity transformation; Subspace iteration

Indexed keywords

EID: 30344461276     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.461     Document Type: Article

References (17)

1. Van Barel M, Vandebril R, Mastronardi N. The Lanczos-Ritz values appearing in an orthogonal similarity reduction of a matrix into semiseparable form. Report TW 360, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 2003.
2. Braun M, Sofianos SA, Papageorgiou DG, Lagaris IE. An efficient Chebyshev Lanczos method for obtaining eigensolutions of the Schrödinger equation on a grid. Journal of Computational Physics 1996; 126:315-327.
3. Joliffe IT. Principal Component Analysis. Springer: Berlin, 1986.
4. Wall ME, Dyck PA, Brettin TS. Svdman - singular value decomposition analysis of microarray data. Bioinformatics 2001; 17(6):566-568.
5. Wall ME, Rechtsteiner A, Rocha LM. Singular value decomposition and principal component analysis. In A Practical Approach to Microarray Data Analysis, Berrar DP, Dubitzky W, Granzow M (eds). Kluwer Academic Publishers: Dordrecht, 2003.
6. Yeung MKS, Ruzzo WL. Principal component analysis for clustering gene expression data. Bioinformatics 2001; 17(9):763-774.
7. Yeung MK.S, Tegnér J, Collins JJ. Reverse engineering gene networks using singular value decomposition and robust regression. PNAS 2002; 99:6163-6168.
8. Aliaga JI, Boley DL, Freund RW, Hernández V. A Lanczos-type method for multiple starting vectors. Mathematics of Computation 2000; 69:1577-1601.
9. Cullum JK, Donath WE. A block Lanczos algorithm for computing the q algebraically largest eigenvalues and a corresponding eigenspace for large, sparse symmetric matrices. Proceedings of the 1974 IEEE Conference on Decision ami Control. IEEE Press: New York, 1974; 505-509.
10. Cullum JK, Willoughby RA. Lanczos Algorithms for Large Symmetric Eigenvalue Computations. Volume 1, Theory. Birkhäuser: Basel, 1995.
11. Golub GH, Underwood R. The block Lanczos method for computing eigenvalues. In Mathematical Software III, Rice JR (ed.). Academic Press: New York, 1977; 361-377.
12. Ruhe A. Implementation aspects of band Lanczos algorithms for computation of eigenvalues of large sparse symmetric matrices. Mathematics of Computation 1979; 33:680-687.
13. ij = 0 for j > i + p. Mathematica Scandinavica 1959; 7:57-60.
14. Vandebril R, Van Barel M, Mastronardi N. A note on the representation and definition of semiseparable matrices. Report T W 368, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 2003.
15. Eidelman Y, Gohberg I. On a new class of structured matrices. Integral Equations and Operator Theory 1999; 34:293-324.
16. Watkins DS, Eisner L. Convergence of algorithms of decomposition type for the eigenvalue problem. Linear Algebra and Its Applications 1991; 143:19-47.
17. Van Barel M, Van Camp E, Mastronardi N. Orthogonal similarity transformation into semiseparable matrices of semiseparability rank k. Report TW 380, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 2003.