论文信息 - Multi-sweep Algorithms for the Symmetric Eigenproblem

Multi-sweep Algorithms for the Symmetric Eigenproblem

This paper shows how the symmetric eigenproblem, which is the computationally most demanding part of numerous scientific and industrial applications, can be solved much more efficiently than by using algorithms currently implemented in Lapack routines.

[1] Christoph W. Ueberhuber. Numerical Computation 2 , 1997 .

[2] B. Parlett,et al. Block reflectors: theory and computation , 1988 .

[3] Christian H. Bischof,et al. The WY representation for products of householder matrices , 1985, PPSC.

[4] C. Loan,et al. A Storage-Efficient $WY$ Representation for Products of Householder Transformations , 1989 .

[5] Jack J. Dongarra,et al. Matrix Eigensystem Routines - EISPACK Guide, Second Edition , 1976, Lecture Notes in Computer Science.

[6] Xiaobai Sun,et al. Parallel tridiagonalization through two-step band reduction , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[7] E. Nering,et al. Linear Algebra and Matrix Theory , 1964 .