A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (Q1855433)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems |
scientific article; zbMATH DE number 1864792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems |
scientific article; zbMATH DE number 1864792 |
Statements
A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems (English)
0 references
5 February 2003
0 references
This paper is a follow-up to two papers by the second author [ibid. 322, 61--85, 87--104 (2001; Zbl 0976.65034, Zbl 0976.65035)]. There a simple preconditioned eigensolver for the computation of the smallest eigenvalue and associated eigenvector of a positive definite matrix was studied and an estimate for its convergence rate was given. In this paper a much shorter and more elegant convergence rate estimate is given. Moreover it is shwon that this estimate holds also for the generalized symmetric eigenvalue problem.
0 references
conjugate gradient method
0 references
preconditioning
0 references
eigenvalue
0 references
eigenvector
0 references
positive definite matrix
0 references
convergence
0 references
generalized symmetric eigenvalue problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.864825427532196
0 references
0.8451082110404968
0 references
0.8204546570777893
0 references
