Numerical investigations of new low‐order explicit last stage diagonal implicit Runge–Kutta schemes with the finite‐element method

<jats:title>Abstract</jats:title><jats:p>Initial value problems can be solved efficiently by means of Runge–Kutta algorithms with adaptive step size control. Diagonally implicit Runge–Kutta (DIRK) methods are the most popular class among the diverse family of Runge–Kutta algorithms. In this paper, the novel class of low‐order explicit last‐stage diagonally implicit Runge–Kutta (ELDIRK) methods are explored, which combine implicit schemes with an additional explicit evaluation as an explicit last stage. ELDIRK Butcher tableaus are used to control embedded RK methods to obtain solutions of different orders. The lower‐order solution is obtained by classical implicit RK stages and the higher‐order solution is obtained by additional explicit evaluation. As a result, a significant reduction in computational cost is achieved by skipping the iterative solution of nonlinear systems for the additional step. The examination of the heat problem and the use of the innovative Butcher tableau in the finite‐element method are the main contributions of this work. Thus, it is possible to establish adaptive step size control for the new low‐order embedded methods based on an empirical method for error estimation. Two‐dimensional simulations are used to show an appropriate algorithm for the ELDIRK schemes. The new Runge–Kutta schemes' predictions of higher‐order convergence are confirmed, and their successful outcomes are illustrated.</jats:p>