An extended QR-solver for large profiled matrices

International Journal for Numerical Methods in Engineering

Volumn 79, Issue 11, 2009, Pages 1419-1442

  Ruess, M ^a   Pahl, P J ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Jacobi; Plate vibration; Preconditioning; QR algorithm; Structured matrix

Indexed keywords

JACOBI; PLATE VIBRATION; PRECONDITIONING; QR-ALGORITHM; STRUCTURED MATRIX;

EIGENVALUES AND EIGENFUNCTIONS; PLATES (STRUCTURAL COMPONENTS);

CONVERGENCE OF NUMERICAL METHODS;

EID: 69249127426     PISSN: 00295981     EISSN: 10970207     Source Type: Journal    
DOI: 10.1002/nme.2618     Document Type: Article

References (27)

1. Delvaux S, Van Barel M. Structures preserved by the QR-algorithm. Journal of Computational and Applied Mathematics 2005; 187:29-40.
2. Arbenz P, Golub G. Matrix shapes invariant under symmetric QR algorithm. Numerical Linear Algebra with Applications 1995; 2(2):87-93.
3. Calvetti D, Kim SM, Reichel L. The restarted QR-algorithm for eigenvalue computation of structured matrices. Journal of Computational and Applied Mathematics 2002; 149:415-422.
4. Kailath T, Sayed AH (eds). Fast Reliable Algorithms for Matrices with Structure. SIAM: Philadelphia, PA, 1999.
5. Parlett BN. The Symmetric Eigenvalue Problem. SIAM, Prentice-Hall: Englewood Cliffs, NJ, 1980.
6. Watkins DS. The QR algorithm revisited. SIAM Review Archive 2008; 50:133-145.
7. Golub GH, Van Loan CF. Matrix Computations. Johns Hopkins University Press: Baltimore, MD, 1996.
8. Watkins DS. QR-like algorithms for eigenvalue problems. Journal of Computational and Applied Mathematics 2000; 123:67-83.
9. Lang B. Efficient algorithms for reducing banded matrices to bidiagonal and tridiagonal form. In High Performance Algorithms for Structured Matrix Problems, Volume 2: Advances in the Theory of Computation and Computational Mathematics, Arbenz P, Paprzycki M, Sameh A, Sarin V (eds). Nova Science Publishers: Commack, NY, 1999; 75-89.
10. Bischof CH, Sun X. A Framework for Symmetric Band Reduction and Tridiagonalization. Mathematics and Computer Science Division, Argonne National Laboratory: Argonne, IL, 1992.
11. Calvetti D, Reichel L, Sorensen DC. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Electronic Transactions on Numerical Analysis 1994; 2:1-21.
12. Saad Y. Numerical methods for large eigenvalue problems. Algorithms for Advanced Scientific Computing. Manchester University Press Series: Manchester, 1991.
13. van der Vorst HA. Computational methods for large eigenvalue problems. In Handbook of Numerical Analysis, Ciarlet RG, Lions JL (eds), vol. 8. North-Holland: Amsterdam, 2002; 3-179.
14. Lehoucq RB, Sorensen DC, Yang C. ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods. SIAM: Philadelphia, PA, 1997.
15. Golub GH, Van der Vorst HA. Eigenvalue computation in the 20th century. Journal of Computational and Applied Mathematics 2000; 123:35-65.
16. Anderson E, Bai Z, Bischof C, Blackford S, Demmel JW, Dongarra JJ, Du Croz J, Greenbaum A, Hammarling S, McKenney A, Sorensen DC. LAPACK Users' Guide. SIAM: Philadelphia, PA, 1999.
17. Demmel J. Applied Numerical Linear Algebra. SIAM: Philadelphia, PA, 1997.
18. Wilkinson JH, Reinsch C. Handbook for Automatic Computation, Volume 2: Linear Algebra. Springer: Heidelberg, Berlin, New York, 1971.
19. Stewart GW. Matrix Algorithms, Volume II: Eigensystems. SIAM: Philadelphia, PA, 2001.
20. Wilkinson JH. The Algebraic Eigenvalue Problem. The Clarendon Press, Oxford University Press: Oxford, 1965.
21. Parlett BN. Convergence of the QR algorithm. Numerische Mathematik 1965; 7:187-193.
22. Huang CP. On the convergence of the QR algorithm with origin shifts for normal matrices. Journal of Numerical Analysis 1981; 1:127-133.
23. Hoffmann W, Parlett BN. A new proof of global convergence for the tridiagonal QL algorithm. Journal of Numerical Analysis 1978; 15:929-937.
24. Wang TL, Gragg WB. Convergence of the shifted QR algorithm for unitary Hessenberg matrices. Mathematics of Computation 2001; 71:1473-1496.
25. Stewart GW. Afternotes Goes to Graduate School. SIAM: Philadelphia, PA, 1987.
26. Ruess M. Eine Methode zur vollständigen Bestimmung der Eigenzustände großer Profilmatrizen. Ph.D. Thesis, Technische Universität Berlin, Berlin, 2005.
27. Calvetti D, Reichel L, Sorensen DC. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Electronic Transactions on Numerical Analysis 1994; 2:1-21.