Abstract
A new parallel algorithm for solving positive definite symmetric tridiagonal systems of linear equations is presented. It generalizes to the band and block tridiagonal cases. It is called the middle p-way BABE (burn at both ends) algorithm. It has a redundancy of two: The best serial algorithm requires 3N multiply-adds, 2N multiplies and N divides. This algorithm requires 6N/p multiple-adds, 5N/p multiplies and N/p divides. There is only one global communication step which is an all-to-all concatenation of six double words from each process.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ramesh C. Agarwal, Fred G. Gustavson, and M. Zubair. Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM Journal of Research and Development, 38(5):563–576, 1994.
Peter Arbenz and Walter Gander. A survey of direct parallel algorithms for banded linear systems. Technical Report 221, Institute of Scientific Computing, ETH Zurich, 1994.
I. Babuska. Numerical stability in problems of linear algebra. SIAM Journal on Numerical Analysis, 9(1):53–77, 1972.
Jack J. Dongarra et al. Linpack. SIAM, Philadelphia,PA, 1979.
Jack J. Dongarra and S. L. Johnsson. Solving banded systems on a parallel processor. Parallel Computing, 5:219–246, 1987.
Jack J. Dongarra and A. H. Sameh. On some parallel banded system solvers. Parallel Computing, 1:223–235, 1984.
K. Vince Fernando, Beresford N. Parlett, and Inderjit S. Dhillon. A way to find the most redundant equation in a tridiagonal system. Technical report, Computer Science Department, University of California, Berkeley, 1995.
Ibrahim N. Hajj and Stig Skelboe. A multilevel parallel solver for block tridiagonal and banded linear systems. Parallel Computing, 15:21–45, 1990.
S. L. Johnsson. Solving narrow banded systems on ensemble architectures. ACM Transactions on Mathematical Software, 11:271–288, 1985.
D. H. Lawrie and A. H. Sameh. The computation and communication complexity of a parallel banded system solver. ACM Transactions on Mathematical Software 10:185–195, 1984.
Xian-He Sun, Hong Zhang, and Lionel M. Ni. Efficient tridiagonal solvers on multicomputers. IEEE Transactions on Computers, 41(3), 1992.
Henk A. van der Vorst. Large tridiagonal and block tridiagonal linear systems on vector and parallel computers. Parallel Computing, 5:45–54, 1987.
M. Zubair. A coarse grained tridiagonal solver for distributed memory parallel machines. Technical report, Computer Science Department, Old Dominion University, Norfolk, VA, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustavson, F.G., Gupta, A. (1996). A new parallel algorithm for tridiagonal symmetric positive definite systems of equations. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive