Convergence theory for preconditioned eigenvalue solvers in a nutshell (Q2362287): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59695730, #quickstatements; #temporary_batch_1706974288397 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59695730 / rank | |||
Normal rank |
Revision as of 16:39, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Convergence theory for preconditioned eigenvalue solvers in a nutshell |
scientific article |
Statements
Convergence theory for preconditioned eigenvalue solvers in a nutshell (English)
0 references
7 July 2017
0 references
Suppose \(Ax=\mu Bx\) has ordered eigenvalues \(\mu_i\). In this paper iterates of the form \(x'=x -\frac{1}{\mu(x)} T(A-\mu(x)I)Ax\) are considered with \(\mu(x)=x^TBx/x^TAx\) the Rayleigh quotient and \(T\) a preconditioner such that the maximal singular value of \(I-A^{1/2}TA^{1/2}\) is bounded by \(\gamma<1\). Sharp bounds for the rate of convergence are proved. It is essentially given by \(\sigma^2\) with \(\sigma=\gamma+(1-\gamma)\mu_{i+1}/\mu_i\) if \(\mu(x)\in(\mu_{i+1},\mu_i)\). Such results were proved before by two of the authors [\textit{A. V. Knyazev} and \textit{K. Neymeyr}, Linear Algebra Appl. 358, No. 1--3, 95--114 (2003; Zbl 1037.65039); SIAM J. Matrix Anal. Appl. 31, No. 2, 621--628 (2009; Zbl 1191.49039)]. Here the proofs are simplified based on nonlinear programming and Karush-Kuhn-Tucker (KKT) theory.
0 references
symmetric
0 references
preconditioner
0 references
eigenvalue
0 references
eigenvector
0 references
Rayleigh quotient
0 references
gradient
0 references
iterative method
0 references
Karush-Kuhn-Tucker theory
0 references
rate of convergence
0 references