Parallel integration across time of initial value problems using PVM
This paper shows the efficiency of PVM in the solution of initial value problems on distributed architectures. The method used here is a collocation method showing a large possibility of parallelism across time. The solution of the linear or non linear system, which is a part of the method is obtained with Picard's iterations using divided differences. This solution is also obtained in parallel as well as the values of the approximated solution at different times. Numerical examples are considered. The tests have been performed on a network of workstations and on the Connection Machine CM5.
KeywordsP.V.M. parallel methods initial value problems ordinary differential equations collocation methods
Unable to display preview. Download preview PDF.
- 1.R.Alt, J. Vignes, Validation of collocation methods with the CADNA library, Math. Comp. in Sim., 22, 1996, (to appear).Google Scholar
- 2.E Hairer, S.P. Norsett and G. Wanner, Solving Ordinary Differential Equations I: Nonstiff problems, Springer Series in Computational Mathematics 8 (Springer, Berlin 1987).Google Scholar
- 3.A.C. Hindmarsh, ODEPACK, a systematized collection of ODE solvers, scientific computing, R. S. Stepleman et al. (eds.), north-holland, amsterdam, 1983, pp. 55–64.Google Scholar
- 4.H.B. Keller, Numerical Methods for two-point boundary-value problems. Dover Publications, Iue. New-York (1992), 225–227.Google Scholar
- 5.J. Villadsen and M.L. Michelsen, Solution of differential equation models by polynomial approximation. Prentice Hall, Englewood Cliffs, RN.Y., 1978.Google Scholar
- 6.R. Weiss, The application of implicit Runge Kutta and collocation methods to boundary value problems. Math. Comp., 28, (1974), 449–464.Google Scholar