A geometric theory for preconditioned inverse iteration. II: Convergence estimates
Publication:1595117
DOI10.1016/S0024-3795(00)00236-6zbMath0976.65035OpenAlexW2047353059MaRDI QIDQ1595117
Publication date: 13 May 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0024-3795(00)00236-6
convergenceeigenvaluespreconditioningfinite elementmultigridinverse iterationsymmetric eigenvalue problemlarge sparse matricespreconditioned inverse iterationRaleigh-quotient
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Boundary value problems for second-order elliptic equations (35J25)
Related Items (12)
Cites Work
- Unnamed Item
- A subspace preconditioning algorithm for eigenvector/eigenvalue computation
- Minimization of the computational labor in determining the first eigenvalues of differential operators
- Preconditioning eigensolvers -- an Oxymoron?
- A geometric theory for preconditioned inverse iteration applied to a subspace
This page was built for publication: A geometric theory for preconditioned inverse iteration. II: Convergence estimates