首页> 外文OA文献 >A comparison of high-order explicit Runge–Kutta, extrapolation, and deferred correction methods in serial and parallel
【2h】

A comparison of high-order explicit Runge–Kutta, extrapolation, and deferred correction methods in serial and parallel

机译:串行和并行比较高阶显式Runge-Kutta,外推和延迟校正方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We compare the three main types of high-order one-step initial value solvers:extrapolation, spectral deferred correction, and embedded Runge–Kutta pairs.We consider orders four through twelve, including both serial and parallel implementations.We cast extrapolation and deferred correction methods as fixed-orderRunge–Kutta methods, providing a natural framework for the comparison. Thestability and accuracy properties of the methods are analyzed by theoreticalmeasures, and these are compared with the results of numerical tests. In serial,the eighth-order pair of Prince and Dormand (DOP8) is most efficient. Butother high-order methods can be more efficient than DOP8 when implemented inparallel. This is demonstrated by comparing a parallelized version of the wellknownODEX code with the (serial) DOP853 code. For an N-body problem withN = 400, the experimental extrapolation code is as fast as the tuned Runge–Kuttapair at loose tolerances, and is up to two times as fast at tight tolerances.
机译:我们比较了高阶一阶初始值求解器的三种主要类型:外推法,频谱延迟校正法和嵌入式Runge-Kutta对。我们考虑了四到十二阶,包括串行和并行实现。我们进行外推法和延迟校正。方法是固定顺序的Runge–Kutta方法,为比较提供了自然的框架。通过理论方法对方法的稳定性和准确性进行了分析,并与数值试验结果进行了比较。串行而言,Prince and Dormand(DOP8)的八阶对效率最高。但是,并行实现时,其他高阶方法可能比DOP8更有效。通过将众所周知的ODEX代码的并行化版本与(串行)DOP853代码进行比较来证明这一点。对于N = 400的N体问题,实验外推代码在宽松公差下的速度与调整后的Runge-Kuttapair一样快,而在严格公差下的速度则高达两倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号