Two-sided Grassmann-Rayleigh quotient iteration
From MaRDI portal
Publication:2267769
DOI10.1007/s00211-009-0266-yzbMath1188.65038arXiv0803.4179MaRDI QIDQ2267769
Paul Van Dooren, Pierre-Antoine Absil
Publication date: 2 March 2010
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0803.4179
algorithm; numerical examples; superlinear convergence; eigenspace; Sylvester matrix equation; structured eigenproblem; two-sided Grassmann-Rayleigh quotient iteration
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. I, II
- On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. III: Generalized Rayleigh quotient and characteristic roots with linear elementary divisors. IV: Generalized Rayleigh quotient for nonlinear elementary divisors
- Three methods for refining estimates of invariant subspaces
- Manifolds, tensor analysis, and applications.
- A modified block Newton iteration for approximating an invariant subspace of a symmetric matrix
- Riemannian geometry of Grassmann manifolds with a view on algorithmic computation
- Computing tall skinny solutions of \(AX-XB=C\)
- On the numerical solution of \(AX-XB=C\)
- A Grassmann--Rayleigh Quotient Iteration for Computing Invariant Subspaces
- Adaptive Eigenvalue Computations Using Newton's Method on the Grassmann Manifold
- Understanding the $QR$ Algorithm
- Rayleigh Quotient Iteration for Nonsymmetric Matrices
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- The Dynamics of Rayleigh Quotient Iteration
- A Hessenberg-Schur method for the problem AX + XB= C
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- The Geometry of Algorithms with Orthogonality Constraints
- Computing an Eigenvector with Inverse Iteration
- Solution of the Sylvester matrix equation AXB T + CXD T = E
- Cubically Convergent Iterations for Invariant Subspace Computation
- Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Unitarily Invariant Metrics on the Grassmann Space
- Iterative procedures related to relaxation methods for eigenvalue problems
- A generalization of Saad's theorem on Rayleigh-Ritz approximations
- Angles in complex vector spaces
