A Note On Parallel Matrix Inversion
- 1 January 2001
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 22 (5) , 1762-1771
- https://doi.org/10.1137/s1064827598345679
Abstract
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
This publication has 7 references indexed in Scilit:
- Confidence bands in generalized linear modelsThe Annals of Statistics, 2000
- Basis Norm Rescaling for Nonlinear Parameter EstimationSIAM Journal on Scientific Computing, 2000
- SUMMA: scalable universal matrix multiplication algorithmConcurrency: Practice and Experience, 1997
- A high-performance matrix-multiplication algorithm on a distributed-memory parallel computer, using overlapped communicationIBM Journal of Research and Development, 1994
- Application of massively parallel computation to integral equation models of electromagnetic scatteringJournal of the Optical Society of America A, 1994
- A generalization of the matrix-sign-function solution for algebraic Riccati equationsInternational Journal of Control, 1986
- Linear model reduction and solution of the algebraic Riccati equation by use of the sign function†International Journal of Control, 1980