On hybrid iterative methods for nonsymmetric systems of linear equations
From MaRDI portal
Publication:1923300
DOI10.1007/s002110050202zbMath0864.65014OpenAlexW2048981224MaRDI QIDQ1923300
Gerhard Starke, Thomas A. Manteuffel
Publication date: 22 June 1997
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050202
numerical examplesKrylov subspace methodeigenvalue estimateshybrid algorithmsemi-iterative methodsChebyshev-like methodslarge nonsymmetric systemspolynomial iterative methods
Related Items
A note on the convergence behavior of GMRES, Harmonic projection methods for large non-symmetric eigenvalue problems, Unnamed Item, On the generation of Krylov subspace bases, Unstable modes in projection-based reduced-order models: how many can there be, and what do they tell you?, Eigenvalue inclusion regions from inverses of shifted matrices, A condition for the superiority of the (2, 2)-step methods over the related Chebyshev method, THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES, An interpolatory approximation of the matrix exponential based on Faber polynomials, Is a Chebyshev method optimal for an elliptic region also optimal for a nearly elliptic region?, Proxy-GMRES: Preconditioning via GMRES in Polynomial Space, Generalisation of a quadrilateral duality theorem, A polynomial method based on Fejér points for the computation of functions of unsymmetric matrices, The refined harmonic Arnoldi method and an implicitly restarted refined algorithm for computing interior eigenpairs of large matrices, BAMPHI: matrix-free and transpose-free action of linear combinations of \(\varphi\)-functions from exponential integrators
