CÁC BÀI BÁO KHOA HỌC 08:10:48 Ngày 13/12/2019 GMT+7
Numerical experiments with some explicit pseudo two-step RK methods on a shared memory computer

This paper investigates the performance of two explicit, pseudo two-step Runge-Kutta methods of order 5 and 8 for first-order nanstiff ODEs on a parallel shared memory computer. For expensive right-hand sides the parallel implementation gives a speed-up of 3-4 with respect to the sequential one. Furthermore, we compare the codes with the two efficient nonstiff codes DOPRI5 and DOP853. For problems where the stepsize is determined by accuracy rather than by stability our codes are shown to be more efficient. © 1998 Elsevier Science Ltd. All rights reserved.

 Cong N.H., Podhaisky H., Weiner R.
    Gửi cho bạn bè
  Từ khóa : Codes (symbols); Computers; Initial value problems; Numerical methods; Ordinary differential equations; Parallel processing systems; Problem solving; Pseudo two step Runge-Kutta methods; Shared memory computer; Runge Kutta methods