Parallel iterative linear solvers for multistep Runge-Kutta methods (Q1372722): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3030153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the implementation of implicit Runge-Kutta methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiences with sparse matrix solvers in parallel ODE software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ordinary Differential Equations I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superconvergence for Multistep Collocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix valued versions of a result of von Neumann with an application to time discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel linear system solvers for Runge-Kutta-Nyström methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel linear system solvers for Runge-Kutta methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangularly Implicit Iteration Methods for ODE-IVP Solvers / rank
 
Normal rank

Revision as of 20:10, 27 May 2024

scientific article
Language Label Description Also known as
English
Parallel iterative linear solvers for multistep Runge-Kutta methods
scientific article

    Statements

    Parallel iterative linear solvers for multistep Runge-Kutta methods (English)
    0 references
    0 references
    0 references
    0 references
    14 December 1997
    0 references
    The purpose of the paper is to give a numerical method based on implicit multistep Runge-Kutta methods for systems of stiff equations of the type \(y'=f(y)\). It is known that solving the resulting linear system by a Newton process is very costly. The authors develop a method which is adequate for parallel computation more accurate than those in use.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Newton iteration
    0 references
    implicit multistep Runge-Kutta methods
    0 references
    stiff equations
    0 references
    parallel computation
    0 references
    0 references
    0 references
    0 references
    0 references