A geometric theory for preconditioned inverse iteration applied to a subspace

DOI10.1090/S0025-5718-01-01357-6zbMath0984.65034OpenAlexW2156553331MaRDI QIDQ2759092

Klaus Neymeyr

Publication date: 10 December 2001

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0025-5718-01-01357-6

zbMATH Keywords

convergencepreconditioningeigenvectorsinvariant subspacemultigridinverse iterationsymmetric eigenvalue problemsubspace iterationsmallest eigenvalues

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Related Items

A geometric theory for preconditioned inverse iteration IV: On the fastest convergence cases, Cluster robustness of preconditioned gradient subspace iteration eigensolvers, Accelerated block preconditioned gradient method for large scale wave functions calculations in density functional theory, A new justification of the Jacobi-Davidson method for large eigenproblems, Iterative minimization of the Rayleigh quotient by block steepest descent iterations, An indefinite variant of LOBPCG for definite matrix pencils, A mixed precision LOBPCG algorithm, Convergence rates of individual Ritz values in block preconditioned gradient-type eigensolvers, The preconditioned inverse iteration for hierarchical matrices, A block preconditioned steepest descent method for symmetric eigenvalue problems, On convergence of iterative projection methods for symmetric eigenvalue problems, Cluster robust estimates for block gradient-type eigensolvers, A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient, A geometric theory for preconditioned inverse iteration. II: Convergence estimates, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Preconditioning eigensolvers -- an Oxymoron?
• A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
• A geometric theory for preconditioned inverse iteration. II: Convergence estimates
• On the convergence of the modified method of steepest descent in the calculation of eigenvalues
• Computing an Eigenvector with Inverse Iteration
• On an iterative method for finding lovver eigenvalues
• The site of termination of afferent fibres in the caudate nucleus