Efficient parallel predictor-corrector methods (Q1902088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 13:54, 1 February 2024

scientific article
Language Label Description Also known as
English
Efficient parallel predictor-corrector methods
scientific article

    Statements

    Efficient parallel predictor-corrector methods (English)
    0 references
    30 June 1996
    0 references
    A class of parallel predictor-corrector methods for non-stiff problems introduced by the author and other co-workers in a previous paper is re-examined. The methods are a class of general linear methods, including Adams-Bashforth-Radau methods in particular. A modification to the methods is derived which increases the stage order and leads to improved convergence characteristics and stability. The improved methods can be implemented in a parallel environment at no extra cost. The numerical tests show a speedup of about 3.1 over a good sequential Runge-Kutta code.
    0 references
    Runge-Kutta methods
    0 references
    comparison of methods
    0 references
    parallel predictor-corrector methods
    0 references
    linear methods
    0 references
    Adams-Bashforth-Radau methods
    0 references
    convergence
    0 references
    stability
    0 references
    numerical tests
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references