Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems

DOI10.1016/S0898-1221(99)00338-7zbMath0951.65029OpenAlexW2042761480MaRDI QIDQ1570132

Zhongxiao Jia

Publication date: 9 July 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00338-7

zbMATH Keywords

convergenceKrylov subspace methodArnoldi's methodincomplete orthogonalization methodlarge non-Hermitian linear systemsupdating recursion

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Unnamed Item
• A block incomplete orthogonalization method for large nonsymmetric eigenproblems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
• On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
• The convergence of Krylov subspace methods for large unsymmetric linear systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems