|
ABSTRACT
We give a practical parallel algorithm for solving band symmetric positive definite systems of linear equations in O(m* log n) time using nm/log n processors. Here n denotes the system size and m its bandwidth. Hence, the algorithm is efficient. For tridiagonal systems, the algorithm runs in O(log n) time using n/log n processors. Furthermore, an improved version runs in O(log m log n) time using nm2/(log m log n) processors.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
CSANK~, L. Fast parallel matrix inversion algorithms. SIAM J. Comput. 5, 4 (Dec. 1976), 618-623.
|
| |
3
|
DONGARRA, J. J., AND SAMEH, A.H. On some parallel banded systems solvers. Parallel Comput. 1 (1984), 223-235.
|
| |
4
|
EBERLY, W. Very fast parallel matrix and polynomial arithmetic. In Proceedings of the 25th FOCS Conference (1984), 21-30.
|
 |
5
|
|
| |
6
|
|
| |
7
|
GOLUB, G. H., AND VAN LOAN, C.F. Matrix Computations. Johns Hopkins University Press, Baltimore, Md., 1983.
|
 |
8
|
|
| |
9
|
HELLER, D. A survey of parallel algorithms in numerical linear algebra. SIAM Rev. 20, 4 (Oct. 1978), 740-777.
|
| |
10
|
HOSHINO, T., KAMIMURA, T., IIDA, T., AND SHIRAKAWA, T. Parallelized ADI scheme using GECR (Gauss-Elimination-Cyclic-Reduction) method and implementation of Navier-Stokes equation in the PAX computer, in Proceedings of the 26th FOCS Conference (1985), 426-433.
|
| |
11
|
KUMAR, S. P., AND KOWALICK, J.S. Parallel factorization of a positive definite matrix on an MIMD computer. Proceedings of the 1984 ICPP (1984), 410-416.
|
 |
12
|
|
| |
13
|
MEIER, U. A parallel partition method for solving banded systems of linear equations. Parallel Comput. 2 (1985), 33-43.
|
| |
14
|
ORTEGA, J.M. Numerical Analysis, A Second Course. Academic Press, New York, 1972.
|
 |
15
|
|
| |
16
|
|
| |
17
|
SHmOACH, Y., AND VISHKIN, U. Finding the maximum merging and sorting in parallel computation model. J. Algorithms 2, 1 (1981), 88-102.
|
 |
18
|
|
| |
19
|
STRANG, G. Linear Algebra and Its Applications. Academic Press, New York, 1980.
|
| |
20
|
VALIANT, L. G. Parallelism in comparison problems. SIAM J. Comput. 4, 3 (Sept. 1975), 348-355.
|
| |
21
|
VISHKIN, U. Synchronous parallel computation--a survey. TR-71, Dept. of Computer Science, Courant Institute, New York, Univ., 1983.
|
| |
22
|
WEAVER, H., JR., AND JOHNSTON, P.R. Finite Elements for Structural Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1984.
|
| |
23
|
WINO, O., AND HUANG, J.W. A computational model of parallel solution of linear equations. IEEE Trans. Comput. C-29, 7 (1980), 632-638.
|
REVIEW
"Ian Gladwell : Reviewer"
Parallel algorithms for linear positive definite banded systems of order
i n> and bandwidth m> are considered. The methods are based on recursive
block elimination. The theoretically fastest speed-ups are shown for
shared me
more...
|