An Arnoldi method for nonlinear eigenvalue problems

BIT Numerical Mathematics

Volumn 44, Issue 2, 2004, Pages 387-401

  Voss, H ^a  

^a HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

iterative projection method; nonlinear eigenvalue problem; residual inverse iteration

Indexed keywords

EID: 4444266799     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:BITN.0000039424.56697.8b     Document Type: Article

References (18)

1. Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst (eds.), Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
2. T. Betcke and H. Voss, A Jacobi-Davidson-type projection method for nonlinear eigenvalue problems, Future Generation Computer Systems, 20 (2004), pp. 363-372.
3. J. Daniel, W. Gragg, L. Kaufman, and G. Stewart, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 87-94.
4. P. Hager, Eigenfrequency analysis. FE-adaptivity and a nonlinear eigenvalue problem, Ph.D. thesis, Chalmers University of Technology, Göteborg, 2001.
5. P. Hager and N. Wiberg, The rational Krylov algorithm for nonlinear eigenvalue problems, in B. Topping (ed.), Computational Mechanics for the Twenty-First Century, Saxe-Coburg Publications, Edinburgh, 2000, pp. 379-402.
6. E. Jarlebring, Krylov methods for nonlinear eigenvalue problems, Master's thesis, Royal Institute of Technology, Dept. Numer. Anal. Comput. Sci., Stockholm, 2003.
7. E. Jarlebring and H. Voss, Rational Krylov for nonlinear eigenproblems, an iterative projection method, Tech. Report 69, Dept. Math., Hamburg University of Technology, 2003. Submitted to Appl. Math.
8. V. Mehrmann and D. Watkins, Structure-preserving methods for computing eigenpairs of large sparse skew-Hamiltonian/Hamiltonian pencils, SIAM J. Sci. Comput., 22 (2001), pp. 1905-1925.
9. V. Mehrmann and D. Watkins, Polynomial eigenvalue problems with Hamiltonian structure, Electronic Transactions on Numerical Analysis, 13 (2002), pp. 106-118.
10. A. Neumaier, Residual inverse iteration for the nonlinear eigenvalue problem, SIAM J. Numer. Anal., 22 (1985), pp. 914-923.
11. A. Ruhe, Algorithms for the nonlinear eigenvalue problem, SIAM J. Numer. Anal., 10 (1973), pp. 674-689.
12. A. Ruhe, Computing nonlinear eigenvalues with spectral transformation Arnoldi, ZAMM, 76 (1996), pp. S2: 17-20.
13. A. Ruhe, Rational Krylov, a practical algorithm for large sparse nonsymmetric matrix pencils, SIAM J. Sci. Comput., 19 (1998), pp. 1535-1551.
14. A. Ruhe, A rational Krylov algorithm for nonlinear matrix eigenvalue problems, Zapiski Nauchnyh Seminarov POMI, 268 (2000), pp. 176-180.
15. H. Voss, An Arnoldi method for nonlinear symmetric eigenvalue problems, in Online Proceedings of the SIAM Conference on Applied Linear Algebra, Williamsburg, http:// www.siam.org/meetings/laa03/, 2003.
16. H. Voss, Initializing iterative projection methods for rational symmetric eigenproblems, in Online Proceedings of the Dagstuhl Seminar Theoretical and Computational Aspects of Matrix Algorithms, Schloss Dagstuhl 2003, ftp://ftp.dagstuhl.de/pub/Proceedings/03/ 03421/03421.VoszHeinrich.Other.pdf, 2003.
17. H. Voss and B. Werner, A minimax principle for nonlinear eigenvalue problems with applications to nonoverdamped systems, Math. Meth. Appl. Sci., 4 (1982), pp. 415-424.
18. H. Voss and B. Werner, Solving sparse nonlinear eigenvalue problems, Tech. Report 82/4, Inst. f. Angew. Mathematik, Univ. Hamburg, 1982.