Asynchronous time-parallel method based on Laplace transform

From MaRDI portal




Abstract: Laplace transform method has proved to be very efficient and easy to parallelize for the solution of time-dependent problems. However, the synchronization delay among processors implies an upper bound on the expectable acceleration factor, which leads to a lot of wasted time. In this paper, we propose an original asynchronous Laplace transform method formalized for quasilinear problems based on the well-known Gaver-Stehfest algorithm. Parallel experiments show the convergence of our new method, as well as several interesting properties compared with the classical algorithms.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Asynchronous time-parallel method based on Laplace transform

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