A parallel block cyclic reduction algorithm for the fast solution of elliptic equations

E. Gallopoulos, Y. Saad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


This paper presents an adaptation of the Block Cyclic Reduction (BCR) algorithm for a multi-vector processor. The main bottleneck of BCR lies in the solution of linear systems whose coefficient matrix is the product of tridiagonal matrices. This bottleneck is handled by expressing the rational function corresponding to the inverse of this product as a sum of elementary fractions. As a result the solution of this system leads to parallel solutions of tridiagonal systems. Numerical experiments performed on an Alliant FX/8 are reported.

Original languageEnglish (US)
Title of host publicationSupercomputing - 1st International Conference, Proceedings
EditorsTheodore S. Papatheodorou, Constantine D. Polychronopoulos, Elias N. Houstis
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783540189916
StatePublished - 1988
Event1st International Conference on Supercomputing, 1987 - Athens, Greece
Duration: Jun 8 1987Jun 12 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume297 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other1st International Conference on Supercomputing, 1987

Bibliographical note

Funding Information:
This work was supported by the National Science Foundation under Grants No. US NSF DCR84-10110 and US NSF DCR85-'09970, the US Department of Energy under Grant No. DOE DE-FG02-85ER25001, by the US Air Force under Contract AFSOR-85-0211, and the IBM donation.

Publisher Copyright:
© 1988, Springer-Verlag.


Dive into the research topics of 'A parallel block cyclic reduction algorithm for the fast solution of elliptic equations'. Together they form a unique fingerprint.

Cite this