Subspace iteration methods with preconditioning for eigenvalues of very large matrices
From MaRDI portal
Recommendations
Cited in
(12)- A refined subspace iteration algorithm for large sparse eigenproblems
- Parallelization strategies for subspace methods to solve large eigenproblems
- scientific article; zbMATH DE number 997682 (Why is no real title available?)
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- scientific article; zbMATH DE number 176177 (Why is no real title available?)
- scientific article; zbMATH DE number 2069268 (Why is no real title available?)
- Modified block Jacobi-Davidson method for solving large sparse eigenproblems
- Modern methods for the iterative computation of eigenpairs of matrices of high dimension
- An Algebraic Substructuring Method for Large-Scale Eigenvalue Calculation
- Computing interior eigenpairs in augmented Krylov subspace produced by Jacobi–Davidson correction equation
- Software for computing eigenvalue bounds for iterative subspace matrix methods
- Computing interior eigenvalues of large matrices
This page was built for publication: Subspace iteration methods with preconditioning for eigenvalues of very large matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2751211)