On the use of parallel processors for implicit Runge-Kutta methods (Q1310614): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02243848 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W152201461 / rank
 
Normal rank

Latest revision as of 08:42, 30 July 2024

scientific article
Language Label Description Also known as
English
On the use of parallel processors for implicit Runge-Kutta methods
scientific article

    Statements

    On the use of parallel processors for implicit Runge-Kutta methods (English)
    0 references
    0 references
    0 references
    0 references
    7 July 1994
    0 references
    Using an implicit Runge-Kutta method for a system of stiff differential equations one has to solve in each integration step a nonlinear system of equations for the internal approximation vectors. The authors discuss and propose modified Newton schemes that allow computation of the Newton correction in parallel. They prove that the scheme converges and show by numerical experiments a speedup of 1.8 to 4.1 on a 6 processors Sequent Symmetry.
    0 references
    parallel computing
    0 references
    Newton method
    0 references
    convergence
    0 references
    implicit Runge Kutta method
    0 references
    system
    0 references
    stiff differential equations
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references