arrow
返回

EXPONENTIAL POLYNOMIAL BLOCK METHODS

delete2021-05-13
delete5
delete
OA
AI
T
Tommaso Buvoli *
DOI:10.1137/20M1321346delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by constructing a new class of parallel exponential polynomial block methods (EPBMs) based on the Legendre points. These new integrators can be constructed at arbitrary orders of accuracy and have improved stability compared to existing exponential linear multistep methods. Moreover, if the ODE right-hand-side evaluations can be parallelized efficiently, then high-order EPBMs are significantly more efficient at obtaining highly accurate solutions than exponential linear multistep methods and exponential spectral deferred correction methods of equivalent order.
Keyword:
time-integration
polynomial interpolation
general linear methods
parallelism
high-order
exponential integrators

期刊

SIAM Journal on Scientific Computing 封面图
SIAM Journal on Scientific Computing
IF:
2.6
论文数:
5.1K
被引数:
1.8W

机构

University of California System 封面图
University of California System
学者数:
37.7W
论文数: 33.8W
被引数: 6.6K
引用论文

引用论文

err分享
err收藏
Sensation Seeking, Marijuana Use, and Responses to Prevention Messages
err1990-01-01
err0
PREAI
errLewis Donohew; David M. Helm; Patricia Lawrence; Milton J. Shatzer
err分享
err收藏
err分享
err收藏
err2015-06-01
err0
PREAI
err
err分享
err收藏
学者 查看更多内容