A parallel GMRES version for general sparse matrices
type: Item
instance of: scholarly article
title: A parallel GMRES version for general sparse matrices
zbMATH Open document ID: 0860.65021
publication date: 1997-04-14T00:00:00Z
full work available at URL: https://eudml.org/doc/119070
full work available at URL: vol.3.1995
review text: An implementation of a parallel variant of the generalized minimal residual (GMRES) algorithm on Paragon is described, based on two steps: it first builds a Newton basis which is then orthogonalized. This approach requires the parallelization of two steps: the basis formation which relies on matrix vector products and the basis QR factorization. Numerical results on this parallel version of the GMRES algorithm show good performances, even on small matrices.
reviewed by: Horst Hollatz
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 918316
zbMATH Keywords: parallel computation
zbMATH Keywords: sparse matrix
zbMATH Keywords: generalized minimal residual algorithm
zbMATH Keywords: Newton basis
zbMATH Keywords: QR factorization
zbMATH Keywords: GMRES algorithm
zbMATH Keywords: performances
author: J. Erhel
describes a project that uses: P-SPARSLIB
MaRDI profile type: Publication
published in: ETNA - Electronic Transactions on Numerical Analysis
Recommended article: Q4717943
Recommended article: Q4296888
Recommended article: Large-Scale Scientific Computing
Recommended article: A direct parallel sparse matrix solver
Recommended article: Q4309414
Recommended article: Parallel sparse matrix solution and performance
Recommended article: Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
Recommended article: Q4860193
Recommended article: Q4860186
description: scientific article; zbMATH DE number 918316