2000
DOI: 10.1002/(sici)1097-0207(20000510)48:1<55::aid-nme867>3.0.co;2-x
|View full text |Cite
|
Sign up to set email alerts
|

An efficient method for solving implicit and explicit stiff differential equations

Abstract: SUMMARYWhen the s-stage fully implicit Runge}Kutta (RK) method is used to solve a system of n ordinary di!erential equations (ODE) the resulting algebraic system has a dimension ns. Its solution by Gauss elimination is expensive and requires 2sn/3 operations. In this paper we present an e$cient algorithm, which di!ers from the traditional RK method. The formal procedure for uncoupling the algebraic system into a block-diagonal matrix with s blocks of size n is derived for any s. Its solution is s/2 times faste… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Figure 1 illustrates the fully implicit and diagonally implicit classes of Runge-Kutta (RK) methods, which can be defined as a 3 × 3 matrix. As stated in [15], RK methods are characterized by excellent stability properties that make them useful for solving stiff ODEs systems. However, for a Fully Implicit Runge-Kutta (FIRK) method, a system of n × r non-linear equations must be solved in each of its integration stage, where n is the dimension of the problem and r is the number of stages, as described by [16].…”
Section: Introductionmentioning
confidence: 99%
“…Figure 1 illustrates the fully implicit and diagonally implicit classes of Runge-Kutta (RK) methods, which can be defined as a 3 × 3 matrix. As stated in [15], RK methods are characterized by excellent stability properties that make them useful for solving stiff ODEs systems. However, for a Fully Implicit Runge-Kutta (FIRK) method, a system of n × r non-linear equations must be solved in each of its integration stage, where n is the dimension of the problem and r is the number of stages, as described by [16].…”
Section: Introductionmentioning
confidence: 99%