.png){kind=icon}
Return
A NOTE ON PARALLEL MATRIX INVERSION
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827598345679.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present one-sweep parallel algorithms for the inversion of general and symmetric positive definite matrices. The algorithms feature simple programming and performance optimization while maintaining the same arithmetic cost and numerical properties of conventional inversion algorithms. Our experiments on a Cray T3E-600 and a Beowulf cluster demonstrate high performance of implementations for distributed memory parallel computers.
Keywords:
matrix inversion
Gauss-Jordan elimination
parallel computers
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave no more