Generalized scans and tri-diagonal systems

  • Paul F. Fischer
  • Franco P. Preparata
  • John E. Savage
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)


The classical problem of solving tridiagonal linear systems of equations is reconsidered. An extremely simple factorization of the system's matrix — implied by but not explicit in the known techniques — is identified and shown to belong to a class of transformations termed generalized scans. This class has an associative property which is the key to the complete parallelization of the technique. Due to the very weak constraints upon which it is based, the method extends naturally to arbitrary banded systems.


Hamiltonian Path Band System Tridiagonal Matrix Serial Phase Parallel Phase 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [DFR93]
    F. Dehne, A. Fabri, and A. Rau-Chaplin, Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, 298–307, 1993.Google Scholar
  2. [DS84]
    J.J. Dongarra and A.H. Sameh. On Some Parallel Banded System Solvers. Parallel Computing, 1:223–235, 1984.Google Scholar
  3. [H64]
    R.W. Hockney. A Fast Direct Solution of Poisson's Equation Using Fourier Analysis. JACM, 12:95–113, 1965.Google Scholar
  4. [J85]
    S.L. Johnsson. Solving Narrow Banded Systems on Ensemble Architectures. Research Report YALEU/DCS/RR-418 Dept. of Computer Science, Yale University, New Haven, CT, August 1985.Google Scholar
  5. [J87]
    S.L. Johnsson. Solving Tridiagonal Systems on Ensemble Architectures SIAM J. of. Sci. Statist. Comput., 8:354–392, 1987.Google Scholar
  6. [LF80]
    R. E. Ladner and M. J. Fischer. Parallel Prefix Computation. JACM, 27:831–838, Oct. 1980.Google Scholar
  7. [M85]
    U. Meier. A Parallel Partition Method for Solving Banded Systems of Linear Equations. Parallel Computing, 2:33–43, 1985.Google Scholar
  8. [S73]
    H.S. Stone. An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations. JACM, 20:27–38, Jan. 1973.Google Scholar
  9. [Swa74]
    P.N. Swarztrauber. A Direct Method for the Discrete Solution of Separable Elliptic Equations. SIAM J. of Num. Anal., 11:1136–1150, 1974.Google Scholar
  10. [Swe74]
    R.A. Sweet. A Generalized Cyclic-Reduction Algorithm. SIAM J. of Num. Anal., 11:506–520, 1974.Google Scholar
  11. [Swe77]
    R.A. Sweet. A Cyclic-Reduction Algorithm for Solving Block Tridiagonal Systems of Arbitrary Dimension. SIAM J. of. Num. Anal., 14:706–720, 1977.Google Scholar
  12. [W81]
    H.H. Wang. A Parallel Method for Tridiagonal Equations. ACM Trans. Math. Software, 7:170–183, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Paul F. Fischer
    • 1
  • Franco P. Preparata
    • 2
  • John E. Savage
    • 2
  1. 1.Division of Applied MathematicsBrown UniversityProvidence
  2. 2.Department of Computer ScienceBrown UniversityProvidence

Personalised recommendations