Varying the \(s\) in your \(s\)-step GMRES

zbMath1386.65108MaRDI QIDQ1744315

Jocelyne Erhel, David Imberti

Publication date: 23 April 2018

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol47/abstract.php?vol=47&pages=206-230

zbMATH Keywords

GMRES algorithm\(s\)-step Krylov subspace methodcommunication-avoidingvariable \(s\)-step

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (max. 100)

The Adaptive $s$-Step Conjugate Gradient Method ⋮ GMRES algorithms over 35 years ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating.

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
• On the generation of Krylov subspace bases
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• An efficient nonsymmetric Lanczos method on parallel vector computers
• A parallel interior point algorithm for linear programming on a network of transputers
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
• Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
• A parallel GMRES version for general sparse matrices
• Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows
• Parallelism and robustness in GMRES with a Newton basis and deflated restarting
• Rounding error analysis of the classical Gram-Schmidt orthogonalization process
• Communication-optimal Parallel and Sequential QR and LU Factorizations
• The university of Florida sparse matrix collection
• Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
• Implementation of the GMRES Method Using Householder Transformations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
• Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
• Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
• PHRAGMÉN-LINDELÖF THEOREMS FOR THE SOLUTIONS OF AN ELLIPTIC SYSTEM IN TWO INDEPENDENT VARIABLES WITH CONSTANT COEFFICIENTS
• A Newton basis GMRES implementation
• Alternatives for parallel Krylov subspace basis computation
• Accuracy and Stability of Numerical Algorithms
• Communication Avoiding ILU0 Preconditioner

This page was built for publication: Varying the \(s\) in your \(s\)-step GMRES