A parallel GMRES version for general sparse matrices (Q1920179): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Jocelyne Erhel / rank | |||
| Property / author | |||
| Property / author: Jocelyne Erhel / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: P-SPARSLIB / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 06:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel GMRES version for general sparse matrices |
scientific article |
Statements
A parallel GMRES version for general sparse matrices (English)
0 references
14 April 1997
0 references
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.
0 references
parallel computation
0 references
sparse matrix
0 references
generalized minimal residual algorithm
0 references
Newton basis
0 references
QR factorization
0 references
GMRES algorithm
0 references
performances
0 references
