The Coefficients of the FOM and GMRES Residual Polynomials
From MaRDI portal
Publication:2957681
DOI10.1137/15M1053827zbMath1354.65064MaRDI QIDQ2957681
Publication date: 27 January 2017
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10)
Related Items (3)
On two generalized inverse eigenvalue problems for Hessenberg-upper triangular pencils and their application to the study of GMRES convergence ⋮ GMRES algorithms over 35 years ⋮ On the convergence rate of DGMRES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of Q-OR and Q-MR Krylov methods for solving nonsymmetric linear systems
- Estimates for the numerical radius and the spectral radius of the Frobenius companion matrix and bounds for the zeros of polynomials
- On the permissible arrangements of Ritz values for normal matrices in the complex plane
- On certain methods for expanding the characteristic polynomial
- Krylov sequences of maximal length and convergence of GMRES
- Bounds for the zeros of polynomials from eigenvalues and singular values of some companion matrices
- GMRES and the Arioli, Pták, and Strakoš parametrization
- On the location of the Ritz values in the Arnoldi process
- New bounds for roots of polynomials based on Fiedler companion matrices
- Some decomposition results for companion matrices
- The role eigenvalues play in forming GMRES residual norms with non-normal matrices
- Matrix Algorithms
- Modified Gershgorin Disks for Companion Matrices
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- Bounds and a majorization for the real parts of the zeros of polynomials
- Generalizations of Gershgorin disks and polynomial zeros
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- The Lanczos Biorthogonalization Algorithm and Other Oblique Projection Methods for Solving Large Unsymmetric Systems
- GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems
- Singular Values of Companion Matrices and Bounds on Zeros of Polynomials
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- Any Ritz Value Behavior Is Possible for Arnoldi and for GMRES
- Harmonic projection methods for large non-symmetric eigenvalue problems
- Properties of Worst-Case GMRES
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: The Coefficients of the FOM and GMRES Residual Polynomials