Implementation of parallel three-point block codes for solving large systems of ordinary differential equations
- 1 May 2010
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 87 (6) , 1415-1429
Abstract
The three-point fully implicit block methods are developed for solving large systems of ordinary differential equations using variable step size on a parallel shared memory computer. The methods calculate the numerical solution at three points simultaneously and are suitable for parallelization across the method. The methods are in a simple form as Adams Moulton method with the specific aim of gaining efficiency. For large problems, the parallel implementation produced a good speed-up with respect to the sequential timing and hence better efficiency for the methods developed.Keywords
This publication has 8 references indexed in Scilit:
- Parallel block codes for solving large systems of ordinary differential equationsInternational Journal of Simulation and Process Modelling, 2006
- High order Runge–Kutta–Nyström codes for the integration of oscillatory problemsApplied Numerical Mathematics, 2004
- Parallel iterated methods based on variable step‐size multistep Runge—Kutta methods of Radau type for stiff problemsAdvances in Computational Mathematics, 2000
- Runge–Kutta–Nyström‐type parallel block predictor–corrector methodsAdvances in Computational Mathematics, 1999
- Parallel iterated method based on multistep Runge-Kutta of Radau type for stiff problemsAdvances in Computational Mathematics, 1997
- Parallel iterated methods based on multistep Runge-Kutta methods of Radau typeAdvances in Computational Mathematics, 1997
- First Leaves: A Tutorial Introduction to Maple V1992
- Comparing Numerical Methods for Ordinary Differential EquationsSIAM Journal on Numerical Analysis, 1972