Abstract
We determine the speed up of a recently developed parallel algorithm of solving of systems of linear ODEs on large parallel MIMD computers. The used numerical method for solving systems of linear ODEs is the Runge-Kutta method. An optimal number of subintervals (or processors) and an optimal number of equidistant points for an individual processor are assessed if a total interval is subdivided into N equal parts. It can be proven that the speed up is proportional to N 1/2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Podlubny, I.: Parallel Algorithms for Initial and Value problems for Linear Ordinary Differential Equations and Their Systems, Kybernetika, Prague, 323 (1996) 251–260
Török, C.: On the Parallel Algorithms of Initial Value Problems for Systems of Linear ODEs, Preprints of the 113th Pannonian Applied Mathematical Meeting, Bardejovské Kúpele, (1996) 231–237
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pavluš, M. (1999). Speed Up Estimation for a Parallel Method for Systems of Linear Ordinary Differential Equations. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_68
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive