Proceedings of 1996 IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, ICA/sup 3/Pp
DOI: 10.1109/icapp.1996.562917
|View full text |Cite
|
Sign up to set email alerts
|

Parallel matrix inversion techniques

Abstract: In this paper, we present techniques for inverting sparse, symmetric and positive definite matrices on parallel and distributed computers. We propose two algorithms, one for SIMD implementation and the other for MIMD implementation. These algorithms are modified versions of Gaussian elimination and they take into account the sparseness of the matrix. Our algorithms perform better than the general parallel Gaussian elimination algorithm. In order to demonstrate the usefulness of our technique, we implemented th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…One of the major contributors to execution time in MVDR is a matrix inversion that must be performed upon the CSDM with each iteration of beamforming. Many fine-grained algorithms exist for parallel matrix inversion [14][15][16][17][18][19] . However, like systolic array algorithms, these algorithms generally require too much communication to be feasible on a distributed system.…”
Section: Introductionmentioning
confidence: 99%
“…One of the major contributors to execution time in MVDR is a matrix inversion that must be performed upon the CSDM with each iteration of beamforming. Many fine-grained algorithms exist for parallel matrix inversion [14][15][16][17][18][19] . However, like systolic array algorithms, these algorithms generally require too much communication to be feasible on a distributed system.…”
Section: Introductionmentioning
confidence: 99%
“…Various methods of matrix inversion are described in the literature, [27][28][29] and much work exists in the area of parallel matrix inversion. [30][31][32][33][34][35] However, these are fine-grained methods involving frequent inter-processor communication, and are thus not suitable for distributed processing systems which typically have a large communication overhead. George et al 26 used a matrix inversion technique based on Gauss-Jordan elimination with full pivoting.…”
Section: Introductionmentioning
confidence: 99%