2013
DOI: 10.1016/j.mcm.2012.08.011
|View full text |Cite
|
Sign up to set email alerts
|

Local Linearization—Runge–Kutta methods: A class of A-stable explicit integrators for dynamical systems

Abstract: a b s t r a c tA new approach for the construction of high order A-stable explicit integrators for ordinary differential equations (ODEs) is theoretically studied. Basically, the integrators are obtained by splitting, at each time step, the solution of the original equation in two parts: the solution of a linear ordinary differential equation plus the solution of an auxiliary ODE. The first one is solved by a Local Linearization scheme in such a way that A-stability is ensured, while the second one can be appr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 62 publications
0
6
0
Order By: Relevance
“…If A is a large and sparse matrix and v is a vector, then we can get exp (A) v by Krylov subspace iterative methods (see, e.g., [22,28,56]). In case the dimension of v is less than a few thousand, we use the standard scaling and squaring method with Padé approximants for computing the exponential of A on a current computer (see, e.g., [20,26,27,39]). In the latter method, m ∈ Z + is chosen such that A/2 m is of order of magnitude 1 and exp (A/2 m ) is approximated by the rational function D pq (A/2 m ) −1 N pq (A/2 m ), where p, q ∈ N and for any matrix X we define…”
Section: Implementation Issuesmentioning
confidence: 99%
See 2 more Smart Citations
“…If A is a large and sparse matrix and v is a vector, then we can get exp (A) v by Krylov subspace iterative methods (see, e.g., [22,28,56]). In case the dimension of v is less than a few thousand, we use the standard scaling and squaring method with Padé approximants for computing the exponential of A on a current computer (see, e.g., [20,26,27,39]). In the latter method, m ∈ Z + is chosen such that A/2 m is of order of magnitude 1 and exp (A/2 m ) is approximated by the rational function D pq (A/2 m ) −1 N pq (A/2 m ), where p, q ∈ N and for any matrix X we define…”
Section: Implementation Issuesmentioning
confidence: 99%
“…Fix p, q ∈ N and m ∈ Z + . For any matrix X we set P pq (X) = D pq (X) −1 N pq (X), where D pq and N pq are as in (20). Then…”
Section: Implementation Issuesmentioning
confidence: 99%
See 1 more Smart Citation
“…This property may be exploited in solving numerical problems for semi-linear stiff systems of equations through operator splitting methods [37,38,39,40]. We note that in the literature, the linear and nonlinear terms of reaction-diffusion models have been decoupled under a variety of numerical integration techniques including: splitting methods [41, and previous references], Implicit-Explicit Runge-Kutta-Chebyshev (IMEX RKC) methods [42,43], PIROCK [44], and Local Linearization Runge-Kutta (LLRK) methods [45,46].…”
Section: High-order Splittingmentioning
confidence: 99%
“…After years of accumulation and development, there are too many methods to solve the numerical solution of nonlinear dynamic systems; the main methods are as follows: perturbation method [3], averaging method [4], Runge-Kutta method [5], Euler method [6], gradient method [7] and so on. Regretfully, these methods have certain advantages in solving certain system but obtain unappealing outcomes when solving problems of general nonlinear dynamic systems, like the lower precision, the complicity and large calculation quantity, Runge phenomenon, and so forth.…”
Section: Introductionmentioning
confidence: 99%