Inexact inverse subspace iteration for generalized eigenvalue problems (Q630516): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2010.08.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2010.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051833651 / 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: Inexact inverse iteration for symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of inexact inverse iteration with application to preconditioned iterative solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact inverse iteration for generalized eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4383439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Generalized Cayley Transformations within an Inexact Rational Krylov Sequence Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Inverse Subspace Iteration with Preconditioning Applied to Non-Hermitian Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational Krylov: A Practical Algorithm for Large Sparse Nonsymmetric Matrix Pencils / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of conjugate gradients used in inverse iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Rayleigh quotient-type methods for eigenvalue computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effects of inexact solvers in algorithms for symmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Truncated RQ Iteration for Large Scale Eigenvalue Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust preconditioning of large, sparse, symmetric eigenvalue problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2010.08.001 / rank
 
Normal rank

Latest revision as of 23:02, 9 December 2024

scientific article
Language Label Description Also known as
English
Inexact inverse subspace iteration for generalized eigenvalue problems
scientific article

    Statements

    Inexact inverse subspace iteration for generalized eigenvalue problems (English)
    0 references
    0 references
    0 references
    17 March 2011
    0 references
    To solve the generalized eigenvalue problem \(Ax=\lambda Bx\), some inverse subspace iteration (outer iteration iterating based on \(A^{-1}B\)) is used. In each iteration step, one has to solve a linear system, which is again solved by an iterative procedure (inner iteration) to within some threshold accuracy. This paper deals with the influence of the inexact inner iteration solves on the convergence of the outer iteration. Several eigenvalues (e.g. the \(p\) smallest ones) and their eigenvectors are approximated simultaneously. It is shown that the outer iteration converges linearly with a rate given by \(\max\{\gamma,\rho\}\) where \(\epsilon_k=a\gamma^k\), \(\gamma<1\) is the threshold used in step \(k\) of the inner iteration in a stopping criterion and \(\rho=|\lambda_p|/|\lambda_{p+1}|<1\) is the ratio of the bordering eigenvalues measuring the gap between the \(p\) smallest eigenvalues and the others. It is however generally independent of the particular iteration or the preconditioner used in the inner loop. The number of inner iterations does not blow up as \(k\) increases and depends only modestly on \(\gamma\). Also the basis vectors of the subspaces converge so that an approximation of a step can be used as an initial condition for the next one.
    0 references
    inner-outer iteration
    0 references
    generalized eigenvalue problem
    0 references
    inverse subspace iteration
    0 references
    inexact inner iteration
    0 references
    convergence
    0 references
    eigenvectors
    0 references
    preconditioner
    0 references
    0 references
    0 references

    Identifiers