Nonlinear Convergence Analysis for the Parareal Algorithm
Nonlinear Convergence Analysis for the Parareal Algorithm
复制标题
DOI：
10.1007/978-3-540-75199-1_4
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
M. Gander;E. Hairer
中科院分区：
文献类型：
--
作者：
M. Gander;E. Hairer
时域分解方法有着悠久的历史：[10]已经做出了以下有远见的声明：“在过去的20年里，人们试图通过提供更快的计算机来加速数值计算。今天，随着人们越来越接近电子元件的最大速度，重点放在允许并行执行操作上。在不久的将来，许多数值分析将不得不以一种更“平行”的形式进行重铸。
Time domain decomposition methods have a long history: already [10] made the following visionary statement:“For the last 20 years, one has tried to speed up numerical computation mainly by providing ever faster computers. Today, as it appears that one is getting closer to the maximal speed of electronic components, emphasis is put on allowing operations to be performed in parallel. In the near future, much of numerical analysis will have to be recast in a more “parallel” form.”