关于非均匀波动方程的离散未映射帐篷搭建法的一个注记
A note on the discrete Unmapped Tent Pitching for the heterogeneous wave equation
首次发表
浏览论文内容
中文总结 AI 辅助
研究非均匀波动方程，核心方法是UTP算法，贡献为在离散层面有新观察结果，显示最优分解策略与连续分析预测不同。
中文摘要 AI 辅助
未映射帐篷搭建（UTP）算法是用于波动型问题并行求解的时空域分解方法。最近已将UTP扩展到非均匀设置，并在连续层面比较了不同时空分解的计算成本。本文报告离散层面的观察结果，表明最优分解策略可能与连续分析预测的不同。
英文摘要
The Unmapped Tent Pitching (UTP) algorithm is a space-time domain decomposition method for the parallel solution of wave-type problems. We have recently extended UTP to heterogeneous settings and compared, at the continuous level, the computational cost of different space-time decompositions. In this note, we report discrete-level observations showing that the optimal decomposition strategy may differ from the one predicted by the continuous analysis.
