Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-07T08:05:23.862Z Has data issue: false hasContentIssue false
  • English
  • Français

Numerical methods for large eigenvalue problems

Published online by Cambridge University Press:  15 July 2003

Danny C. Sorensen
Danny C. Sorensen
Affiliation:
Department of Computational and Applied Mathematics, Rice University, 6100 Main St., MS134, Houston, TX 77005-1892, USA. E-mail: sorensen@rice.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Over the past decade considerable progress has been made towards the numerical solution of large-scale eigenvalue problems, particularly for nonsymmetric matrices. Krylov methods and variants of subspace iteration have been improved to the point that problems of the order of several million variables can be solved. The methods and software that have led to these advances are surveyed.

Information

Type
Research Article
Information
Acta Numerica , Volume 11 , January 2002 , pp. 519 - 584
Copyright
© Cambridge University Press 2002