Convergence theory for preconditioned eigenvalue solvers in a nutshell (Q2362287): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JDQR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3101845474 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.5005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for the Solution of Algebraic Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning eigensolvers -- an Oxymoron? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Flow Approach to Geometric Convergence Analysis of Preconditioned Eigensolvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indefinite variant of LOBPCG for definite matrix pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Convergence Theory for the Preconditioned Steepest Descent Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of Gradient Iterations for the Symmetric Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Convergence Estimates for the Preconditioned Steepest Descent Method for Hermitian Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. I. Extreme eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioned Eigensolvers for Large-Scale Nonlinear Hermitian Eigenproblems with Variational Characterizations. II. Interior Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning Using Matrix Values for Preconditioning Symmetric Positive Definite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix / rank
 
Normal rank

Latest revision as of 03:04, 14 July 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
    0 references
    0 references
    0 references
    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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references