A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS  

作　　者：赵双锁 王昌银 

出　　处：《Numerical Mathematics A Journal of Chinese Universities(English Series)》1994年第1期54-66,共13页

基　　金：national natural science foundation ; natural science foundation of Gansu province.

摘　　要：In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.

关 键 词：IMPLICIT Range-Kutta methods NEWTON ITERATIVE process parallel COMPUTATION iteratively B-CONVERGENCE 

分 类 号：O241[理学—计算数学]