Inexact GMRES iterations and relaxation strategies with fast-multipole boundary element method

From MaRDI portal
Publication:2673503

DOI10.1007/S10444-022-09932-8zbMATH Open1491.35350arXiv1506.05957OpenAlexW4229443128MaRDI QIDQ2673503FDOQ2673503


Authors: Tingyu Wang, Simon K. Layton, Lorena A. Barba Edit this on Wikidata


Publication date: 10 June 2022

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Abstract: Boundary element methods produce dense linear systems that can be accelerated via multipole expansions. Solved with Krylov methods, this implies computing the matrix-vector products within each iteration with some error, at an accuracy controlled by the order of the expansion, p. We take advantage of a unique property of Krylov iterations that allow lower accuracy of the matrix-vector products as convergence proceeds, and propose a relaxation strategy based on progressively decreasing p. In extensive numerical tests of the relaxed Krylov iterations, we obtained speed-ups of between 2.1imes and 3.3imes for Laplace problems and between 1.7imes and 4.0imes for Stokes problems. We include an application to Stokes flow around red blood cells, computing with up to 64 cells and problem size up to 131k boundary elements and nearly 400k unknowns. The study was done with an in-house multi-threaded C++ code, on a hexa-core CPU. The code is available on its version-control repository, href{https://github.com/barbagroup/fmm-bem-relaxed}{https://github.com/barbagroup/fmm-bem-relaxed}.


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




Recommendations




Cites Work


Cited In (2)

Uses Software





This page was built for publication: Inexact GMRES iterations and relaxation strategies with fast-multipole boundary element method

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