A variant of the subspace iteration algorithm for generalized eigenproblems
From MaRDI portal
Recommendations
Cited in
(12)- A successive substitution procedure for eigenvalue approximation
- A refined subspace iteration algorithm for large sparse eigenproblems
- An enhanced formulation of error bound in subspace iteration method
- scientific article; zbMATH DE number 434535 (Why is no real title available?)
- scientific article; zbMATH DE number 3848492 (Why is no real title available?)
- Improving the convergence rate of the inverse iteration method
- Non‐linear optimization technique for partial solution of generalized eigenvalue problems
- Generalized subspace iteration method for solving matrix pair eigenproblem
- Subspace methods for three‐parameter eigenvalue problems
- Enhanced algebraic substructuring for symmetric generalized eigenvalue problems
- Software for computing eigenvalue bounds for iterative subspace matrix methods
- A new algorithm for solving large-scale generalized eigenvalue problem based on projection methods
This page was built for publication: A variant of the subspace iteration algorithm for generalized eigenproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4446743)