A new parallel factorization A = DDtBC for band symmetric positive definite matrices
We present a new factorization for band symmetric positive definite (s.p.d) matrices which is more useful for parallel computations than the classical Choleskey decomposition method. Let A be a band s.p.d matrix of order n and half bandwidth m and let p = 2k be the number of processors. We show how to factor A as A = DDtBC using approximately 4nm2/p parallel operations, which is the maximum number of operations used by any processor. Having this factorization, we improve the time to solve Ax=b by a factor of m using approximately 4nm/p parallel operations. There are more applications to our algorithm, such as calculating det(A), using iterative refinement methods, or computing eigenvalues by the inverse power method. Numerical experiments indicate that our results are as good as LINPACK which is a Fortran machine-independent software for numerical linear algebra.
Unable to display preview. Download preview PDF.
- 1.Ilan Bar-On. A practical parallel algorithm for solving band symmetric positive definite systems of linear equations. ACM Transactions on Mathematical Software, 13(4):323–332, 1987.Google Scholar
- 2.Ilan Bar-On and Ophir Munk. A new parallel factorization A = DDtBC for band symmetric positive definite matrices. Tech. Rep. #721, March 1992.Google Scholar
- 3.A. H. Sameh and R. P. Brent. Solving triangular systems on parallel computers. SIAM J. Numer. Anal, 14:1101–1113, 1977.Google Scholar