A parailelizable and fast algorithm for very large generalized eigenproblems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1184, Issue , 1996, Pages 686-696

  van der Vorst, Henk A ^a   Sleijpen, Gerard L G ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; NUMERICAL METHODS;

EIGENVALUES AND EIGENVECTORS; FAST ALGORITHMS; GENERALIZED EIGENPROBLEMS; ITERATIVE APPROACH; JACOBI-DAVIDSON METHODS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 21444439087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (8)

1. W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenproblem. Quart. Appl. Math., 9:17-29, 1951.
2. J.G.L. Booten, D.R. Fokkema, G.L.G. Sleijpen, and H.A. van der Vorst. Jacobi- Davidson methods for generalized MHD-eigenvalue problems. Zeitschrift]iir Angewandte Mathematik und Mechanik (ZAMM), 1996.
3. J. Cullum, W. Kerner, and R. Willoughby. A generalized nonsymmetric Lanczos procedure. Computer Physics Communications, 53:19-48, 1989.
4. D.R. Fokkema, G.L.G. Sleijpen, and H.A. Van der Vorst. Jacobi-Davidson style QR and QZ algorithms for the partial reduction of matrix pencils. Technical Report Preprint 941, Mathematical Institute, Utrecht University, 1996.
5. G. H. Golub and C. F. van Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1989.
6. G. L. G. Sleijpen and H.A. Van der Vorst. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal.Appl., 17(2):401-425, 1996.
7. D. C. Sorenson. Implicit application of polynomial filters in a k-step Arnoldi method. SIAM J. Matt. Anal. Appl., 13(1):357-385, 1992.
8. M.B. Van Gijzen. A parallel eigensolution of an acoustic problem with daanping. submitted for publication.