Ritz and pseudo-Ritz values using matrix polynomials
From MaRDI portal
Publication:1923177
DOI10.1016/0024-3795(95)00682-6zbMath0856.65036OpenAlexW2077060636MaRDI QIDQ1923177
Publication date: 7 October 1996
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(95)00682-6
convergencematrix polynomialblock Krylov subspace methodsnonsymmetric matrixblock Arnoldi procedureJordan-Ritz pairs
Related Items
Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems, Adaptively restarted block Krylov subspace methods with low-synchronization skeletons, A posteriori superlinear convergence bounds for block conjugate gradient, Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM, An Efficient Block Rational Krylov Solver for Sylvester Equations with Adaptive Pole Selection, Recent computational developments in Krylov subspace methods for linear systems
Uses Software
Cites Work
- Factorization of matrix polynomials with multiple roots
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
- The superlinear convergence behaviour of GMRES
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- Orthogonal matrix polynomials and applications
- Convergence properties of block GMRES and matrix polynomials
- GMRES and the minimal polynomial
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Application of Vector-Valued Rational Approximations to the Matrix Eigenvalue Problem and Connections with Krylov Subspace Methods
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item