在非线性问题中避免阶降时寻找效率的分裂方法
Looking for efficiency when avoiding order reduction in nonlinear problems with Strang splitting
AI总结:
本文比较了两种避免阶降的分裂方法在计算效率上的差异,发现Alonso等人提出的方法更高效,并通过新定理证明了其中一种实现的阶数。
摘要:
在本文中,我们比较了在使用Strang方法积分具有时间依赖边界条件的非线性初值边界值问题时,避免阶降的两种技术的计算效率。考虑了每种技术的不同实现,我们表明Alonso等人建议的技术比Einkemmer等人建议的技术更高效。此外,对于Alonso等人技术的一种实现,我们通过证明一些新定理来证明其阶数。
英文摘要:
In this paper, we offer a comparison in terms of computational efficiency between two techniques to avoid order reduction when using Strang method to integrate nonlinear initial boundary value problems with time-dependent boundary conditions. Considering different implementations for each of the techniques, we show that the technique suggested by Alonso et al. is more efficient than the one suggested by Einkemmer et al. Moreover, for one of the implementations of the technique by Alonso et al. we justify its order through the proof of some new theorems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。