Refining estimates of invariant and deflating subspaces for large and sparse matrices and pencils
DOI10.1007/S10543-014-0469-1zbMATH Open1290.65036OpenAlexW2078565797MaRDI QIDQ2450893FDOQ2450893
Authors: H.-Y. Fan, Peter Chang-Yi Weng, E. K.-w. Chu 
Publication date: 23 May 2014
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-014-0469-1
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
numerical examplessparse matrixinvariant subspaceNewton's methodnonsymmetric algebraic Riccati equationSylvester equationlarge-scale problemdeflating subspace
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrix equations and identities (15A24)
Cites Work
- Title not available (Why is that?)
- The convergence of harmonic Ritz values, harmonic Ritz vectors and refined harmonic Ritz vectors
- A structure-preserving doubling algorithm for nonsymmetric algebraic Riccati equation
- Accuracy and Stability of Numerical Algorithms
- A New Iterative Method for Solving Large-Scale Lyapunov Matrix Equations
- Three methods for refining estimates of invariant subspaces
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- Iterative Solution of a Nonsymmetric Algebraic Riccati Equation
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Mixed block elimination for linear systems with wider borders
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Continuation of Invariant Subspaces in Large Bifurcation Problems
- Title not available (Why is that?)
- Continuation of invariant subspaces
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- Cubically Convergent Iterations for Invariant Subspace Computation
- Arnoldi-Riccati method for large eigenvalue problems
- A Note on the Stability of Solving a Rank-p Modification of a Linear System by the Sherman–Morrison–Woodbury Formula
- On correction equations and domain decomposition for computing invariant subspaces
- Title not available (Why is that?)
- Generalized Deflated Block-Elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Riccati-based preconditioner for computing invariant subspaces of large matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Uses Software
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)
