Experiments with MRAI time stepping schemes on a distributed memory parallel environment

P. Sloot (Editor), Mikhail A. Bochev, M. Bubak (Editor), L.O. Hertzberger (Editor)

    Research output: Contribution to conferencePaperpeer-review

    55 Downloads (Pure)


    Implicit time stepping is often difficult to parallelize. The recently proposed Minimal Residual Approximate Implicit (MRAI) schemes are specially designed as a cheaper and parallelizable alternative for implicit time stepping. A several GMRES iterations are performed to solve approximately the implicit scheme of interest, and the step size is adjusted to guarantee stability. A natural way to apply the approach is to modify a given implicit scheme in which one is interested. Here, we present numerical results for two parallel implementations of MRAI schemes. One is based on the simple Euler Backward scheme, and the other is the MRAI-modified multistep ODE solver LSODE. On the Cray T3E and IBM SP2 platforms, the MRAI codes exhibit parallelism of explicit schemes. The model problem under consideration is the 3D spatially discretized heat equation. The speed-up results for the Cray T3E and IBM SP2 are reported.
    Original languageUndefined
    Number of pages3
    Publication statusPublished - 1998
    EventHigh-Performance Computing and Networking, International Conference and Exhibition - Amsterdam, the Netherlands
    Duration: 21 Apr 199823 Apr 1998


    ConferenceHigh-Performance Computing and Networking, International Conference and Exhibition
    OtherAplril 21-23, 1998


    • EWI-8612
    • IR-66732

    Cite this