Varying the \(s\) in your \(s\)-step GMRES
type: Item
instance of: scholarly article
title: Varying the \(s\) in your \(s\)-step GMRES
zbMATH Open document ID: 1386.65108
author: David Imberti
author: J. Erhel
publication date: 2018-04-23T00:00:00Z
full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol47/abstract.php
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65N22
zbMATH DE Number: 6862881
zbMATH Keywords: communication-avoiding
zbMATH Keywords: \(s\)-step Krylov subspace method
zbMATH Keywords: GMRES algorithm
zbMATH Keywords: variable \(s\)-step
describes a project that uses: SparseMatrix
MaRDI profile type: Publication
cites work: A Newton basis GMRES implementation
cites work: The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
cites work: The distance of an eigenvector to a Krylov subspace and the convergence of the Arnoldi method for eigenvalue problems
cites work: A parallel interior point algorithm for linear programming on a network of transputers
cites work: Q4296888
cites work: PHRAGMÉN-LINDELÖF THEOREMS FOR THE SOLUTIONS OF AN ELLIPTIC SYSTEM IN TWO INDEPENDENT VARIABLES WITH CONSTANT COEFFICIENTS
cites work: s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
cites work: A parallel implementation of the restarted GMRES iterative algorithm for nonsymmetric systems of linear equations
cites work: The university of Florida sparse matrix collection
cites work: Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
cites work: Communication-optimal parallel and sequential QR and LU factorizations
cites work: A parallel GMRES version for general sparse matrices
cites work: Rounding error analysis of the classical Gram-Schmidt orthogonalization process
cites work: Q4917542
cites work: Communication Avoiding ILU0 Preconditioner
cites work: Accuracy and Stability of Numerical Algorithms
cites work: Q5543004
cites work: Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm
cites work: Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
cites work: Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation
cites work: Q4841246
cites work: An efficient nonsymmetric Lanczos method on parallel vector computers
cites work: Q5178041
cites work: Parallelism and robustness in GMRES with a Newton basis and deflated restarting
cites work: Memory efficient hybrid algebraic solvers for linear systems arising from compressible flows
cites work: On the generation of Krylov subspace bases
cites work: Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
cites work: Q4414854
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Alternatives for parallel Krylov subspace basis computation
cites work: Implementation of the GMRES Method Using Householder Transformations
cites work: Q5674306
published in: ETNA - Electronic Transactions on Numerical Analysis
description: scientific article; zbMATH DE number 6862881