Solving nonlinear parabolic PDEs in several dimensions: Parallelized ESERK codes

• Published in: Journal of computational physics 2020-12, Vol.423, p.109771, Article 109771
• Main Authors: Martín-Vaquero, J., Kleefeld, A.
• Format: Article
• Language: English
• Subjects: Algorithms; Computational physics; Higher-order codes; Multi-dimensional partial differential equations; Nonlinear equations; Nonlinear PDEs; Nonlinear systems; Ordinary differential equations; Parabolic differential equations; Parallel processing; Partial differential equations; Runge-Kutta method; Stability analysis
• ISSN: 0021-9991; 1090-2716
• DOI: 10.1016/j.jcp.2020.109771

•2 new families with over 100 explicit schemes are built for stiff huge systems of ODEs.•4 parallelized codes are provided with excellent results for nonlinear PDEs.•Comparison of the methods, discussion on the optimum order of convergence.•Discussion on how to combine the different families in one algorithm. There is a very large number of very important situations which can be modeled with nonlinear parabolic partial differential equations (PDEs) in several dimensions. In general, these PDEs can be solved by discretizing in the spatial variables and transforming them into huge systems of ordinary differential equations (ODEs), which are very stiff. Therefore, standard explicit methods require a large number of iterations to solve stiff problems. But implicit schemes are computationally very expensive when solving huge systems of nonlinear ODEs. Several families of Extrapolated Stabilized Explicit Runge-Kutta schemes (ESERK) with different order of accuracy (3 to 6) are derived and analyzed in this work. They are explicit methods, with stability regions extended, along the negative real semi-axis, quadratically with respect to the number of stages s, hence they can be considered to solve stiff problems much faster than traditional explicit schemes. Additionally, they allow the adaptation of the step length easily with a very small cost. Two new families of ESERK schemes (ESERK3 and ESERK6) are derived, and analyzed, in this work. Each family has more than 50 new schemes, with up to 84.000 stages in the case of ESERK6. For the first time, we also parallelized all these new variable step length and variable number of stages algorithms (ESERK3, ESERK4, ESERK5, and ESERK6). These parallelized strategies allow to decrease times significantly, as it is discussed and also shown numerically in two problems. Thus, the new codes provide very good results compared to other well-known ODE solvers. Finally, a new strategy is proposed to increase the efficiency of these schemes, and it is discussed the idea of combining ESERK families in one code, because typically, stiff problems have different zones and according to them and the requested tolerance the optimum order of convergence is different.