Approximate incomplete cyclic reduction for systems which are tridiagonal and strictly diagonally dominant by rows
2013 (English)In: Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers / [ed] Pekka Manninen and Per Öster, Springer Berlin/Heidelberg, 2013, 250-264 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 250-264 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 7782
approximate incomplete cyclic reduction, Narrow banded, strictly and evenly diagonally dominant linear systems
Discrete Mathematics Computer and Information Science
IdentifiersURN: urn:nbn:se:umu:diva-83245DOI: 10.1007/978-3-642-36803-5_18ISI: 000343867800018ISBN: 9783642368028OAI: oai:DiVA.org:umu-83245DiVA: diva2:665886
11th International Conference on Applied Parallel and Scientific Computing, PARA 2012, 10 June 2012 through 13 June 2012, Helsinki