Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

From MaRDI portal
Publication:724571

DOI10.1016/J.CAM.2017.11.035zbMATH Open1460.65028arXiv1712.08872OpenAlexW2772495847WikidataQ114202120 ScholiaQ114202120MaRDI QIDQ724571FDOQ724571


Authors: Gustavo Chávez, S. Zampini, George M. Turkiyyah, D. E. Keyes Edit this on Wikidata


Publication date: 26 July 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Abstract: We present a robust and scalable preconditioner for the solution of large-scale linear systems that arise from the discretization of elliptic PDEs amenable to rank compression. The preconditioner is based on hierarchical low-rank approximations and the cyclic reduction method. The setup and application phases of the preconditioner achieve log-linear complexity in memory footprint and number of operations, and numerical experiments exhibit good weak and strong scalability at large processor counts in a distributed memory environment. Numerical experiments with linear systems that feature symmetry and nonsymmetry, definiteness and indefiniteness, constant and variable coefficients demonstrate the preconditioner applicability and robustness. Furthermore, it is possible to control the number of iterations via the accuracy threshold of the hierarchical matrix approximations and their arithmetic operations, and the tuning of the admissibility condition parameter. Together, these parameters allow for optimization of the memory requirements and performance of the preconditioner.


Full work available at URL: https://arxiv.org/abs/1712.08872




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724571)