Ritz and pseudo-Ritz values using matrix polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 19432 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 740107 (Why is no real title available?)
- scientific article; zbMATH DE number 194751 (Why is no real title available?)
- A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Application of Vector-Valued Rational Approximations to the Matrix Eigenvalue Problem and Connections with Krylov Subspace Methods
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Convergence properties of block GMRES and matrix polynomials
- Factorization of matrix polynomials with multiple roots
- GMRES and the minimal polynomial
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Numerical methods for large eigenvalue problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method
- Orthogonal matrix polynomials and applications
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The superlinear convergence behaviour of GMRES
- Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
Cited in
(7)- Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
- A posteriori superlinear convergence bounds for block conjugate gradient
- Numerical Analysis and Its Applications
- 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
- Application of the Lanczos algorithm for solving the linear systems that occur in continuation problems
- Recent computational developments in Krylov subspace methods for linear systems
This page was built for publication: Ritz and pseudo-Ritz values using matrix polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923177)