Riccati-based preconditioner for computing invariant subspaces of large matrices
From MaRDI portal
A block version of the Jacobi-Davidson method is introduced as a linearized version of the Riccati equation in approximating the invariant subspace at each iteration step during computing eigenvalues of a large matrix. The quasi-quadratic convergence of the method is proved provided that the approximate invariant space is close to the exact one. Numerical examples illustrate the methodology.
Recommendations
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
- scientific article; zbMATH DE number 4151736
- Three methods for refining estimates of invariant subspaces
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
Cited in
(4)- A priori error bounds on invariant subspace approximations by block Krylov subspaces
- Convergence and preconditioning of inexact inverse subspace iteration for generalized eigenvalue problems
- Block Newton method and block Rayleigh quotient iteration for computing invariant subspaces of general complex matrices
- Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
This page was built for publication: Riccati-based preconditioner for computing invariant subspaces of large matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614997)