Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-13T02:44:41.737Z 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
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)