A note on parallel matrix inversion (Q2706467)
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 1579075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on parallel matrix inversion |
scientific article; zbMATH DE number 1579075 |
Statements
19 March 2001
0 references
matrix inversion
0 references
Gauss-Jordan elimination
0 references
parallel computations
0 references
algorithms
0 references
performance
0 references
A note on parallel matrix inversion (English)
0 references
Parallel inversion algorithms, based on Gauss-Jordan elimination, for general and symmetric positive definite \((n\times n)\) matrices are presented. Additionally parallel implementation issues are discussed. These algorithms maintain the same arithmetic cost and numerical properties of conventional inversion algorithms. The performance of the parallel Gauss-Jordan elimination inversion algorithm for general matrices and of the one-sweep inversion algorithm for symmetric positive definite matrices is presented, for distributed memory parallel computers, such as Cray T3E-600 and a Beowulf cluster.
0 references
0.9265579
0 references
0.91879594
0 references
0.9154016
0 references
0.90975577
0 references
