论文信息 - Eigenvalue Computation with CUDA

Eigenvalue Computation with CUDA

The computation of all or a subset of all eigenvalues is an important problem in linear algebra, statistics, physics, and many other fields. This report describes the implementation of a bisection algorithm for the computation of all eigenvalues of a tridiagonal symmetric matrix of arbitrary size with CUDA.

Christian Lessig | C. Lessig

[1] K. V. Fernando,et al. Accurately Counting Singular Values of Bidiagonal Matrices and Eigenvalues of Skew-Symmetric Tridiagonal Matrices , 1999, SIAM J. Matrix Anal. Appl..

[2] B. Parlett. The Symmetric Eigenvalue Problem , 1981 .

[3] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .

[4] Aaas News,et al. Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[6] Guy E. Blelloch,et al. Prefix sums and their applications , 1990 .

[7] Inderjit S. Dhillon,et al. Orthogonal Eigenvectors and Relative Gaps , 2003, SIAM J. Matrix Anal. Appl..

[8] F. A. Seiler,et al. Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[9] I. Dhillon. Algorithm for the Symmetric Tridiagonal Eigenvalue/Eigenvector Problem , 1998 .

[10] J. Demmel,et al. On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic. , 1995 .

[11] William H. Press,et al. The Art of Scientific Computing Second Edition , 1998 .

[12] Maria Antónia Forjaz,et al. An Efficient Parallel Algorithm for the Symmetric Tridiagonal Eigenvalue Problem , 2000, VECPAR.

[13] B. Parlett,et al. Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices , 2004 .

[14] Bruno Lang,et al. Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations , 2006, SIAM J. Matrix Anal. Appl..