Successive eigenvalue relaxation: A new method for the generalized eigenvalue problem and convergence estimates

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 457, Issue 2006, 2001, Pages 441-451

  Ovtchinnikov, Evgueni E ^a   Xanthis, Leonidas S ^a  

^a UNIVERSITY OF WESTMINSTER   (United Kingdom)

Author keywords

Convergence rate; Eigensolvers with preconditioning; Large scale eigenvalue problems; Multiple and clustered eigenvalues; Subspace iteration

Indexed keywords

EID: 57249090267     PISSN: 13645021     EISSN: None     Source Type: Journal    
DOI: 10.1098/rspa.2000.0674     Document Type: Article

References (24)

1. Bai, Z., Dcmmel, J., Dongarra, J., Ruhe, A. & van der Vorst, H. (eds) 2000 Templates for the solution of algebraic eigenvalue problems: a practical guide. Philadelphia, PA: SIAM.
2. Bergamaschi, L., Gambolati, G. & Fini, G. 1997 Asymptotic convergence of conjugate gradient methods for the partial symmetric eigenproblem. Numer. Linear Algebra Appl. 4, 69-84.
3. Bertolini, A. F. 1998 Review of eigensolution procedures for linear dynamic finite element analysis. Appl. Mech. Rev. 51, 155-171.
4. Bramble, J. H., Pasciak, J. E. & Knyazev, A. V. 1996 A subspace preconditioning algorithm for eigenvector/eigenvalue computation. Adv. Comput. Math. 6, 159-189.
5. Chatelin, F. 1993 Eigenvalues of matrices. Wiley.
6. Davidson, E. R. 1993 Monster matrices: their eigenvalues and eigenvectors. Comput. Phys. 7, 519-522.
7. D'yakonov, E. G. 1996 Optimization in solving elliptic problems. Boca Raton, FL: CRC Press.
8. D'yakonov, E. G. & Knyazev, A. V. 1992 On an iterative method for finding lower eigenvalues. Russ. J. Numer. Analysis Math. Model. 7, 473-486.
9. Feynman, R. P., Leighton, R. B. & Sands, M. 1963 The Feynman lectures on physics, vol. 1, p. 1. Addison-VVesley.
10. Golub, G. H. & van der Vorst, H. A. 2000 Eigenvalue computation in the 20th century. J. Comput. Appl. Math. 123, 35-65.
11. Golub, G. H. & van Loan, C. F. 1997 Matrix computations. Baltimore, MD: Johns Hopkins University Press.
12. Knyazev, A. V. 1987 Convergence rate estimates for iterative methods for mesh symmetric eigenvalue problem. Sov. J. Numer. Analysis Math. Alodel. 2, 371-396.
13. Knyazev, A. V. 1998 Preconditioned eigensolvers-an oxymoron? Electron. Trans. Numer. Analysis 7, 104-123.
14. Lax, P. D. 2000 Mathematics and computing. In Mathematics: frontiers and perspectives (cd. V. Arnold, M. Atiyah, P. Lax & B. Mazur), pp. 417-432. International Mathematical Union, American Mathematical Society.
15. Leinen, P., Lembach, W. & Neymeyr, K. 1997 An adaptive subspace method for elliptic eigen-problems with hierarchical basis preconditioning. SFB 382 report 68, University of Tübingen.
16. Neymcyr, K. 1999 A geometric theory for preconditioned inverse iteration applied to a subspace. SFB 382 report 131, University of Tübingen.
17. Ovtchinnikov, E. E. & Xanthis, L. S. 1998 Iterative subspace correction methods for thin elastic structures and Korn's type inequality in subspaces. Proc. R. Soc. Lond. A 454, 2023-2039.
18. Ovtchinnikov, E. E. & Xanthis, L. S. 2000a Effective dimensional reduction algorithm for eigenvalue problems for thin elastic structures-a paradigm in three dimensions. Proc. Natn. Acad. Sci. USA 97, 967-971.
19. Ovtchinnikov, E. E. & Xanthis, L. S. 20006 Successive eigenvalue relaxation. I. Theory. TM-SCLab Report 1-C-OO, University of Westminster.
20. Ovtchinnikov, E. E. & Xanthis, L. S. 2000c The apodeictics of SEE-proofs and praxis. TM-SCLab Report 1-12-00, University of Westminster.
21. Parlett, B. N. 1998 The symmetric eigenvalue problem. Classics In Applied Mathematics, no. 20. Philadelphia, PA: SIAM.
22. Saad, Y. 1992 Numerical methods for large eigenvalue problems. Manchester: Manchester University Press.
23. van der Vorst, H. A. & Golub, G. H. 1997 150 years old and still alive: eigenproblems. In The state of the art in numerical analysis (ed. I. S. Duff & G. A. Watson), pp. 93-119. Oxford: Clarendon.
24. Wilkinson, J. H. 1965 The algebraic eigenvalue problem. Oxford University Press.