There is an Open Access version for this licensed article that can be read free of charge and without license restrictions. The content of the Open Access version may differ from that of the licensed version.
Pricing information
Please choose your delivery country and your customer group
Diagonally implicit Runge-Kutta discretizations of initial-boundary value problems in partial differential equations are studied. The derivation of bounds for the full discretization error under the assumption that the grid distances in space and time are independent parameters, is considered. The method of lines approach is used to exploit the B-convergence theory for Runge-Kutta schemes applied to stiff problems. Order reduction phenomena are emphasized. Numerical examples confirm theoretical results. It is shown that in partial differential equations, order reduction severely reduces the performances of higher order schemes.