A Nonlinear ParaExp Algorithm
We derive and analyze a nonlinear variant of the ParaExp algorithm introduced in Gander and Güttel (SIAM J Sci Comput 35(2):C123–C142, 2013) for linear evolution problems. We show that the nonlinear ParaExp algorithm converges in a finite number of steps, and that it can be interpreted as a parareal algorithm where the coarse integrator solves the linear part of the evolution problem. We also provide a numerical example illustrating the efficiency of the new algorithm.
- 3.M.J. Gander, E. Hairer, Nonlinear convergence analysis for the parareal algorithm, in Domain Decomposition Methods in Science and Engineering XVII (Springer, Berlin, 2007), pp. 45–56Google Scholar
- 9.S. Güttel, A parallel overlapping time-domain decomposition method for ODEs, in Domain Decomposition Methods in Science and Engineering XX (Springer, Berlin, 2013), pp. 483–490Google Scholar