ORDER RESULTS FOR ALGEBRAICALLY STABLEMONO-IMPLICIT RUNGE-KUTTA METHODS

作     者：Ai-guo Xiao(1. Department of Mathematics, Xiangtan University, Xiangtan 411105, China2. ICMSEC, Chinese Academy of Sciences, Beijing 10080, China) 

作者机构：Xiangtan Univ Dept Math Poona 411005 Maharashtra India Chinese Acad Sci ICMSEC Beijing 100080 Peoples R China 

出 版 物：《Journal of Computational Mathematics》 (计算数学（英文）)

年 卷 期：1999年第17卷第6期

页      面：639-644页

核心收录：

学科分类：07[理学] 070102[理学-计算数学] 0701[理学-数学] 

基　　金：国家自然科学基金 

主　　题：ordinary differential equations mono-implicit Runge-Kutta methods order algebraical stability 

摘      要：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]