Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
From MaRDI portal
Publication:2450893
Recommendations
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
- Three methods for refining estimates of invariant subspaces
- Riccati-based preconditioner for computing invariant subspaces of large matrices
- A Newton-like method for computing deflating subspaces
- A refined subspace iteration algorithm for large sparse eigenproblems
Cites work
- scientific article; zbMATH DE number 3885211 (Why is no real title available?)
- scientific article; zbMATH DE number 3707661 (Why is no real title available?)
- scientific article; zbMATH DE number 3707662 (Why is no real title available?)
- scientific article; zbMATH DE number 1779207 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- A Note on the Stability of Solving a Rank-p Modification of a Linear System by the Sherman–Morrison–Woodbury Formula
- A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation
- Accuracy and Stability of Numerical Algorithms
- Arnoldi-Riccati method for large eigenvalue problems
- Continuation of Invariant Subspaces in Large Bifurcation Problems
- Continuation of invariant subspaces
- Cubically Convergent Iterations for Invariant Subspace Computation
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Generalized Deflated Block-Elimination
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Iterative Solution of a Nonsymmetric Algebraic Riccati Equation
- Mixed block elimination for linear systems with wider borders
- On correction equations and domain decomposition for computing invariant subspaces
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- Three methods for refining estimates of invariant subspaces
Cited in
(9)- Riccati-based preconditioner for computing invariant subspaces of large matrices
- scientific article; zbMATH DE number 4121301 (Why is no real title available?)
- scientific article; zbMATH DE number 2232693 (Why is no real title available?)
- Numerical solution of singular Sylvester equations
- Projected nonsymmetric algebraic Riccati equations and refining estimates of invariant and deflating subspaces
- Three methods for refining estimates of invariant subspaces
- A refinement of approximate invariant subspaces of matrices based on SVD in high dimensionality reduction and image compression
- Small-sample statistical condition estimation of large-scale generalized eigenvalue problems
- Computing reducing subspaces of a large linear matrix pencil
This page was built for publication: Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2450893)
