Asynchronous Time-Parallel Method based on Laplace Transform
Distributed, Parallel, and Cluster Computing
2019-09-05 v1 Numerical Analysis
Numerical Analysis
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.
Keywords
Cite
@article{arxiv.1909.01473,
title = {Asynchronous Time-Parallel Method based on Laplace Transform},
author = {Frederic Magoules and Qinmeng Zou},
journal= {arXiv preprint arXiv:1909.01473},
year = {2019}
}