A parallel algorithm for solving special tridiagonal systems on ring networks

K. L. Chung*, W. M. Yan, J. G. Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


The solution of special linear, circulant-tridiagonal systems is considered. In this paper, a fast parallel algorithm for solving the special tridiagonal systems, which includes the skew-symmetric and tridiagonal-Toeplitz systems, is presented. Employing the diagonally dominant property, our parallel solver does need only local communications between adjacent processors on a ring network. An error analysis is also given. On the nCUBE/2E multiprocessors, some experimental results demonstrate the good performance of our stable parallel solver.

Original languageEnglish
Pages (from-to)385-395
Number of pages11
JournalComputing (Vienna/New York)
Issue number4
Publication statusPublished - 1996


  • Matrix perturbation
  • Parallel algorithm
  • Performance
  • Ring network
  • Tridiagonal Toeplitz linear systems
  • nCUBE/2E multiprocessors

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Numerical Analysis
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'A parallel algorithm for solving special tridiagonal systems on ring networks'. Together they form a unique fingerprint.

Cite this