A comparison of some GMRES-like methods

DOI10.1016/0024-3795(92)90444-FzbMath0749.65027OpenAlexW2078027443MaRDI QIDQ1183135

Kees Vuik, Henk A. van der Vorst

Publication date: 28 June 1992

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(92)90444-f

zbMATH Keywords

convergencenumerical experimentsiterative methodscalingGMRES methodnonsymmetric matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Related Items

A Krylov subspace type method for Electrical Impedance Tomography, Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations, A new family of preconditioned iterative solvers for nonsymmetric linear systems, An alternative to the Ritz pairs with the EN subspace method, Explicit approximate inverse preconditioning techniques, A Variable Metric Method for Approximating Generalized Inverses of Matrices, A Variable Metric Method for Approximating Generalized Inverses of Matrices, GMRES algorithms over 35 years, Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems., Jacobian-free Newton-Krylov methods: a survey of approaches and applications., Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module, A new implementation of EN method, Iterative solution of linear systems in the 20th century

Cites Work

• Unnamed Item
• Unnamed Item
• Accelerating with rank-one updates
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A class of first order factorization methods
• A New Method of Solving Nonlinear Simultaneous Equations
• The Convergence of Single-Rank Quasi-Newton Methods