Abstract
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 = DD tBC using approximately 4nm 2/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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
Ilan Bar-On and Ophir Munk. A new parallel factorization A = DDtBC for band symmetric positive definite matrices. Tech. Rep. #721, March 1992.
A. H. Sameh and R. P. Brent. Solving triangular systems on parallel computers. SIAM J. Numer. Anal, 14:1101–1113, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bar-On, I., Munk, O. (1992). A new parallel factorization A = DD tBC for band symmetric positive definite matrices. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_429
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_429
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive