Abstract
This paper reviews and develops i) broadening of the computation front (BCF) techniques, and ii) block implicit (BI) methods to speed up the numerical solution of IVPS in ODEs by using MIMD computing systems. In particular consideration is given to the performance, accuracy and stability characteristics of the techniques and possible extension of the BCF methods to improve the accuracy. It has been shown that it is not possible to get fourth and higher order parallel explicit Runge-Kutta (RK) methods by using the BCF techniques. This paper also characterizes some of the drawbacks of BCF and considers two further techniques to exploit the parallelism embedded in BI methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
