Paper Info
Title
Approximate incomplete cyclic reduction for systems which are tridiagonal and strictly diagonally dominant by rows
Abstract
Systems which are narrow banded and strictly diagonally dominant by rows can be solved in parallel using a variety of methods including incomplete block cyclic reduction. We show how to accelerate the algorithm by approximating the very first step. We derive tight estimates for the forward error and explain why our procedure is suitable for linear systems obtained by discretizing some common parabolic PDEs. An improved ScaLAPACK style algorithm is presented together with strong scalability results.
Year
DOI
Venue
2012
10.1007/978-3-642-36803-5_18
PARA
Keywords
Field
DocType
incomplete block cyclic reduction,tight estimate,common parabolic pdes,improved scalapack style algorithm,linear system,forward error,strong scalability result,approximate incomplete cyclic reduction
Tridiagonal matrix,Row,Applied mathematics,Discretization,Discrete mathematics,Linear system,Parallel computing,Diagonally dominant matrix,ScaLAPACK,Cyclic reduction,Mathematics,Parabola
Conference
Volume
ISSN
Citations 
7782
0302-9743
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Carl Christian Kjelgaard Mikkelsen1113.57
Bo Kågström21045189.17