Title
Incomplete cyclic reduction of banded and strictly diagonally dominant linear systems
Abstract
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. We obtain a tight estimate on the significance of the off diagonal blocks of the tridiagonal linear systems generated by the cyclic reduction algorithm. Numerical experiments illustrate the advantage of omitting all but the first reduction step for a class of matrices related to high order approximations of the Laplace operator.
Year
Venue
Keywords
2011
international conference on parallel processing
diagonal block,scalapack case,scalapack library,particular block,linear system,incomplete cyclic reduction,cyclic reduction algorithm,diagonally dominant linear system,complete block cyclic reduction,reduction step,block tridiagonal system,computing science,computer science
DocType
Volume
ISSN
Conference
7203
0302-9743
Citations 
PageRank 
References 
1
0.37
6
Authors
2
Name
Order
Citations
PageRank
Carl Christian Kjelgaard Mikkelsen1113.57
Bo Kågström21045189.17