Divide and conquer: A new parallel algorithm for the solution of a tridiagonal linear system of equations

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Bondeli, S. (1990). Divide and conquer: A new parallel algorithm for the solution of a tridiagonal linear system of equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 457 LNCS, pp. 108–119). Springer Verlag. https://doi.org/10.1007/3-540-53065-7_92

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free