It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the...It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the order of an s-stage monoimplicit Runge-Kutta method is at most s+1 and the stage order is at most 3. In this paper, it is shown that the order of an s-stage mono-implicit Runge-Kutta method being algebraically stable is at most min((s) over tilde, 4), and the stage order together with the optimal B-convergence order is at most min(s, 2), where [GRAPHICS]展开更多
文摘It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the order of an s-stage monoimplicit Runge-Kutta method is at most s+1 and the stage order is at most 3. In this paper, it is shown that the order of an s-stage mono-implicit Runge-Kutta method being algebraically stable is at most min((s) over tilde, 4), and the stage order together with the optimal B-convergence order is at most min(s, 2), where [GRAPHICS]
