On the modification of an eigenvalue problem that preserves an eigenspace

DOI10.1016/j.cam.2011.06.003zbMath1243.65043OpenAlexW2149738713MaRDI QIDQ719429

Maxim Naumov

Publication date: 10 October 2011

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2011.06.003

zbMATH Keywords

error estimatesmatrix eigenvalue problemeigenspacesHermitian matrixnon-Hermitian matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

Local and global strategies for optimal selective mass scaling

Uses Software

• eigs
• SparseMatrix
• IRAM
• lobpcg.m

Cites Work

• eigs
• Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations
• The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
• Rank-one modification of the symmetric eigenproblem
• Accelerating the orthogonal iteration for the eigenvectors of a Hermitian matrix
• Matrix Algorithms
• Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
• The university of Florida sparse matrix collection
• A QUANTITATIVE FORMULATION OF SYLVESTER'S LAW OF INERTIA
• The PageRank Vector: Properties, Computation, Approximation, and Acceleration
• A Trace Minimization Algorithm for the Generalized Eigenvalue Problem
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
• Some Modified Matrix Eigenvalue Problems
• A robust ILU with pivoting based on monitoring the growth of the inverse factors