Abstract
We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is very flexible, permits multiprocessing or a combination of vector and multiprocessor implementations, and is adaptable to a wide range of parallelism granularities. This algorithm can also be combined with recursive doubling, cyclic reduction or Wang's partition method, in order to increase the degree of parallelism and vectorizability.
The divide and conquer method will be explained. Some results of time measurements on a CRAY X-MP/28, on an Alliant FX/8 and on a Sequent Symmetry S81b as well as comparisons with the cyclic reduction algorithm and Gaussian elimination will be presented.
Chapter PDF
Similar content being viewed by others
References
Babuska I.: Numerical stability in problems of linear algebra, SIAM J. Numer. Anal. 9 (1)(1972) 53–77.
Bondeli S.: A new Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations, Report 130, Departement für Informatik, ETH Zürich 1990.
Evans D.J.: Parallel Processing, Cambridge University Press, Cambridge 1982.
Hockney R.: A Fast Direct Solution of Poisson's Equation using Fourier Analysis, J. ACM 12 (1965) 95–113.
Hockney R., Jesshope C.: Parallel Computers, Adam Hilger Ltd., Bristol, 1981.
Hockney R., Jesshope C.: Parallel Computers 2, Adam Hilger Ltd., Bristol, 1988.
Johnsson S.L.: Solving tridiagonal Systems on ensemble Architectures, SIAM J. SCI. STAT. Comput., Vol. 8, No 3, (May 1987) 354–389.
Lakshmivarahan S., Dhall S.K.: A new class of parallel algorithms for solving linear tridiagonal systems, 1986 315–324.
Lambiotte J., Voigt R.: The Solution of Tridiagonal Linear Systems on the CDC STAR-100 Computer, ACM Trans. Math. Soft. 1, 308–329.
Ortega J., Introduction to Parallel and Vector Solution of Linear Systems, Plenum Press, New York 1988.
Petersen W.P.: Vector Fortran for Numerical Problems on CRAY-1, Communications of the ACM 26 (11)(1983) 1008–1021.
Schoenauer W.: Scientific Computing on Vector Computers, North-Holland 1987.
Stone H.S., Parallel tridiagonal equation solvers ACM Trans. Math. Softw. 1 (4)(1975) 289–307.
van der Vorst H.A.: Large tridiagonal and block tridiagonal linear systems on vector and parallel computers, Parallel Computing 5 (1987) 45–54.
Wang H.H.: A Parallel Method for Tridiagonal Equations, ACM Trans. math. Software 7 (2)(1981) 170–183.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bondeli, S. (1990). Divide and conquer: A new parallel algorithm for the solution of a tridiagonal linear system of equations. In: Burkhart, H. (eds) CONPAR 90 — VAPP IV. VAPP CONPAR 1990 1990. Lecture Notes in Computer Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53065-7_92
Download citation
DOI: https://doi.org/10.1007/3-540-53065-7_92
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53065-7
Online ISBN: 978-3-540-46597-3
eBook Packages: Springer Book Archive