NUMERICAL EXPERIMENTS WITH SOME EXPLICIT PSEUDO 2-STEP RK METHODS ON A SHARED-MEMORY COMPUTER

This paper investigates the performance of two explicit pseudo two-ste p Runge-Kutta methods of order 5 and 8 for first-order nonstiff ODEs o n a parallel shared memory computer. For expensive right-hand sides th e parallel implementation gives a speed-up of 3-4 with respect to the sequential one. Furthermore, we compare the codes with the two efficie nt nonstiff codes DOPRI5 and DOP853. For problems where the stepsize i s determined by accuracy rather than by stability our codes are shown to be more efficient. (C) 1998 Elsevier Science Ltd. All rights reserv ed.