Abstract
Up to recent times interest has concentrated mainly on ‘implicit methods’ for the numerical solution of the initial-boundary value problem by finite-difference/finite-element methods. However, the increasing availability of parallel computers enabled the ‘explicit methods’ of solution to become competitive, since, besides their simplicity, they exhibit an inherent parallelism as the solution can be obtained at many points simultaneously. This paper investigates the applicability of a new group explicit method parallel processing and the work is concentrated on the selection of a suitable algorithm which can effectively utilize the processing potential of a MIMD parallel ‘testbed’ while it remains stable producing highly accurute results.
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.
