Increasing efficiency of inverse iteration

DOI10.1007/s11565-008-0046-0zbMath1178.65035OpenAlexW2155598151MaRDI QIDQ1041310

Nela Bosner

Publication date: 2 December 2009

Published in: Annali dell'Università di Ferrara. Sezione VII. Scienze Matematiche (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11565-008-0046-0

zbMATH Keywords

algorithmnumerical exampleseigenvalueseigenvectorsmultigrid methodssymmetric matrixinverse iterationbanded matrixBlock Lanczos methodquotient iteration

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multilevel variational method for \(Au=\lambda Bu\) on composite grids
• On eigenvalues of a Rayleigh quotient matrix
• Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
• A geometric theory for preconditioned inverse iteration. I: Extrema of Rayleigh quotient
• A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
• Multigrid Methods for Nearly Singular Linear Equations and Eigenvalue Problems
• Multigrid Methods for Differential Eigenproblems
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• On the Computation of Approximate Eigenvalues and Eigenfunctions of Elliptic Operators by Means of a Multi-Grid Method
• Multilevel Adaptive Methods for Elliptic Eigenproblems: A Two-Level Convergence Theory
• Nonlinear Programming

This page was built for publication: Increasing efficiency of inverse iteration