Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor (Q1124269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4111894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor |
scientific article; zbMATH DE number 4111894 |
Statements
Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor (English)
0 references
1989
0 references
Two parallel modifications of the preconditioned conjugate gradient method for systems with a nonsymmetric matrix are presented. The algorithms are the conjugate gradient squared algorithm and the generalized minimal residual algorithm. In the algorithms preconditionings by a diagonal matrix and by an incomplete LU factorization are considered. A compressed-matrix representation storage scheme developed at the University of Texas in Austin is adopted. The global and local preconditioners in the incomplete LU factorization are used. The algorithms were implemented on the vector multiprocessor IBM 3090-600E VF and tested for two sets of test matrices.
0 references
parallel conjugate gradient methods
0 references
parallel vector computer
0 references
preconditioned conjugate gradient method
0 references
nonsymmetric matrix
0 references
minimal residual algorithm
0 references
incomplete LU factorization
0 references
vector multiprocessor
0 references
0.8603447675704956
0 references
0.8574904203414917
0 references
0.8529031276702881
0 references
