A simple ODE solver based on 2-stage Radau IIA (Q1372091): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126531706, #quickstatements; #temporary_batch_1722546880474
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Jacques J. B. de Swart / rank
Normal rank
 
Property / author
 
Property / author: Jacques J. B. de Swart / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RODAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the efficient implementation of implicit methods for ODEs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714145 / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-0427(97)00141-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126774692 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126531706 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:16, 1 August 2024

scientific article
Language Label Description Also known as
English
A simple ODE solver based on 2-stage Radau IIA
scientific article

    Statements

    A simple ODE solver based on 2-stage Radau IIA (English)
    0 references
    14 April 1998
    0 references
    An initial value problem for an ordinary differential equation (ODE) and its solution via the third-order 2-stage Radau IIA method are presented. The obtained system of nonlinear equations has to be solved usually by a modified Newton process. Several attempts to reduce the LU-costs are briefly described and one new approach with an efficient solver that needs only one LU-decomposition of the dimension of the problem per time step is described. A comparison of the convergence behaviour of this approach with previous ones is presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    2-stage Radau IIA method
    0 references
    LU-decomposition
    0 references
    Newton iteration
    0 references
    convergence
    0 references
    0 references
    0 references