arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1003.5238cs.DCcs.NAmath.NA
收藏

高维微分方程并行求解的高效算法

An efficient algorithm for the parallel solution of high-dimensional differential equations

University of Paderborn(帕德博恩大学);United Technologies Research Center(联合技术研究中心)

Stefan Klus, Tuhin Sahai, Cong Liu, Michael Dellnitz

AI总结:

提出自适应波形松弛方法,结合图划分启发式算法,将高维微分代数方程求解速度提升3-16倍。

摘要:

高维微分方程的研究由于分析和计算上的困难而具有挑战性。这里,我们改进了波形松弛(WR)的速度,这是一种模拟高维微分代数方程的方法。这种新方法称为自适应波形松弛(AWR),并在一个通信网络示例上进行了测试。此外,我们提出了不同的启发式算法,用于计算适用于自适应波形松弛的图划分。我们发现,AWR结合适当的图划分方法可将速度提升3到16倍。

英文摘要:

The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑