A practical parallel algorithm for solving band symmetric positive definite systems of linear equations

Authors:
Ilan Bar-on
Affiliations:
Courant Institute of Mathematical Sciences, New York University, New York, NY
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1987

Citing 8
Cited 1

The computation and communication complexity of a parallel banded system solver

ACM Transactions on Mathematical Software (TOMS)
Optimal parallel generation of a computation tree form

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Efficient parallel solution of linear systems

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

Journal of the ACM (JACM)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Journal of the ACM (JACM)
Introduction to Numerical Methods for Parallel Computers

Introduction to Numerical Methods for Parallel Computers
Computer Solution of Large Sparse Positive Definite

Computer Solution of Large Sparse Positive Definite
Optimal parallel algorithms for string matching

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Paper: Efficient logarithmic time parallel algorithms for the cholesky decomposition and gram-schmidt process

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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.