Computing eigenvalue bounds for iterative subspace matrix methods

DOI10.1016/J.CPC.2004.12.013MaRDI QIDQ709710zbMATH OpenOpenAlexFDO

Authors Yunkai Zhou, Ron Shepard, Michael Minkoff

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

gapHermitiansubspaceboundseigenvaluespreadRitzgeneralized

Mathematics Subject Classification ID

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

Recommendations

• Software for computing eigenvalue bounds for iterative subspace matrix methods
• Subspace iterative methods for eigenvalue problems
• scientific article; zbMATH DE number 4013867
• Computable error bounds for the generalized symmetric eigenproblem
• Cluster-robust accuracy bounds for Ritz subspaces

Cites work

• scientific article; zbMATH DE number 1049353 (Why is no real title available?)
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Matrix algorithms. Vol. 2: Eigensystems
• The Rotation of Eigenvectors by a Perturbation. III
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• The subspace projected approximate matrix (SPAM) modification of the Davidson method

Cited in

(12)

• scientific article; zbMATH DE number 3909629 (Why is no real title available?)
• Software for computing eigenvalue bounds for iterative subspace matrix methods
• Approximate solutions and eigenvalue bounds from Krylov subspaces
• Computable error bounds for the generalized symmetric eigenproblem
• A Hoffmann-Wielandt-type residual bound for generalized eigenvalues of a definite pair
• scientific article; zbMATH DE number 4018251 (Why is no real title available?)
• Sub-stochastic matrix analysis for bounds computation -- theoretical results
• Iterative improvement of componentwise error bounds of invariant subspaces belonging to a double or nearly double eigenvalue
• Corrigendum: Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
• On the subspace projected approximate matrix method.
• Computer algorithms for calculating efficient initial vectors for subspace iteration method
• Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709710)