Hybrid methods based on LCG and GMRES

DOI10.1007/s40314-015-0225-4zbMath1343.65036OpenAlexW1995841910MaRDI QIDQ291394

Yan Zhu, Li-ping Wang

Publication date: 7 June 2016

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-015-0225-4

zbMATH Keywords

algorithmGalerkin methodnumerical examplesfull orthogonalization methodGMRESRleft conjugate gradient methodresidual norm-minimization

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Uses Software

• DQGMRES

Cites Work

• Unnamed Item
• Conjugate decomposition and its applications
• An iterative method for the Helmholtz equation
• The superlinear convergence behaviour of GMRES
• An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments
• A note on the convergence behavior of GMRES
• Semi-conjugate direction methods for real positive definite systems
• Nested Krylov methods based on GCR
• Differences in the Effects of Rounding Errors in Krylov Solvers for Symmetric Indefinite Linear Systems
• Least Squares Residuals and Minimal Residual Methods
• Study on semi-conjugate direction methods for non-symmetric systems
• Evaluating the LCD algorithm for solving linear systems of equations arising from implicit SUPG formulation of compressible flows
• Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
• Left conjugate gradient method for non‐Hermitian linear systems
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I
• A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II
• GMRESR: a family of nested GMRES methods
• Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms
• The principle of minimized iterations in the solution of the matrix eigenvalue problem