Computing eigenvalue bounds for iterative subspace matrix methods

DOI10.1016/J.CPC.2004.12.013zbMath1196.15017OpenAlexW2167523522MaRDI QIDQ709710

Michael Minkoff, Ron Shepard, Yunkai Zhou

Publication date: 18 October 2010

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cpc.2004.12.013

zbMATH Keywords

gapsubspaceeigenvalueboundsspreadRitzHermitiangeneralized

Mathematics Subject Classification ID

Inequalities involving eigenvalues and eigenvectors (15A42) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (2)

On the subspace projected approximate matrix method. ⋮ Software for computing eigenvalue bounds for iterative subspace matrix methods

Cites Work

• Unnamed Item
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Matrix Algorithms
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• The Rotation of Eigenvectors by a Perturbation. III
• The subspace projected approximate matrix (SPAM) modification of the Davidson method

This page was built for publication: Computing eigenvalue bounds for iterative subspace matrix methods