Incomplete Cyclic Reduction of Banded and Strictly Diagonally Dominant Linear Systems

@inproceedings{Mikkelsen2011IncompleteCR,
  title={Incomplete Cyclic Reduction of Banded and Strictly Diagonally Dominant Linear Systems},
  author={Carl Christian Kjelgaard Mikkelsen and Bo K{\aa}gstr{\"o}m},
  booktitle={PPAM},
  year={2011}
}
The ScaLAPACK library contains a pair of routines for solving banded linear systems which are strictly diagonally dominant by rows. Mathematically, the algorithm is complete block cyclic reduction corresponding to a particular block partitioning of the system. In this paper we extend Heller’s analysis of incomplete cyclic reduction for block tridiagonal systems to the ScaLAPACK case. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

High-Performance Scientific Computing

Springer London • 2012
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems

D. Heller
SIAM J. Numer. Anal., vol • 1976
View 3 Excerpts
Highly Influenced

Analysis of the Truncated SPIKE Algorithm

SIAM J. Matrix Analysis Applications • 2008
View 1 Excerpt

On the parallel solution of tridiagonal linear systems by wrap-around partitioning and incomplete LU factorization

M. Hegland
Numer. Math., vol • 1991
View 1 Excerpt

Similar Papers

Loading similar papers…