2002
DOI: 10.1002/num.10012
|View full text |Cite
|
Sign up to set email alerts
|

An efficient high‐order algorithm for solving systems of reaction‐diffusion equations

Abstract: An efficient higher-order finite difference algorithm is presented in this article for solving systems of twodimensional reaction-diffusion equations with nonlinear reaction terms. The method is fourth-order accurate in both the temporal and spatial dimensions. It requires only a regular five-point difference stencil similar to that used in the standard second-order algorithm, such as the Crank-Nicolson algorithm. The Padé approximation and Richardson extrapolation are used to achieve high-order accuracy in th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
34
0

Year Published

2006
2006
2020
2020

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 71 publications
(34 citation statements)
references
References 11 publications
0
34
0
Order By: Relevance
“…The error decreases when we decrease the size ℎ and value of . To evaluate the convergence order of our proposed method defined in [28], plugℎ = = 1 4 and halving the grid size. We see that the error is decreasing regularly, the results for ‖ ‖ 2 and the convergence rate are given in Table 1, Table 2 and Table 3.…”
Section: Test Problemmentioning
confidence: 99%
“…The error decreases when we decrease the size ℎ and value of . To evaluate the convergence order of our proposed method defined in [28], plugℎ = = 1 4 and halving the grid size. We see that the error is decreasing regularly, the results for ‖ ‖ 2 and the convergence rate are given in Table 1, Table 2 and Table 3.…”
Section: Test Problemmentioning
confidence: 99%
“…In this article, we first apply the compact high-order approximation developed in [14] to turn the time-dependent reaction-diffusion equation given in Eq. (1) into a system of ordinary differential equations (ODE).…”
Section: U(a T) = G 1 (T) U(b T) = G 2 (T) T ∈ [0 T ]mentioning
confidence: 99%
“…In [14], an efficient fourth-order algorithm based on Padé approximation was presented for solving the two-dimensional equation. It is fourth-order accurate in both the temporal and spatial dimensions, and requires only a compact stencil as used by the standard second-order CrankNicholson algorithm.…”
Section: U(a T) = G 1 (T) U(b T) = G 2 (T) T ∈ [0 T ]mentioning
confidence: 99%
“…Liao et al [7] implemented a CFD scheme for reaction-diffusion problems. A CFD scheme for the generalized one dimensional Sine-Gordon equation with error analysis was introduced in [4].…”
Section: Introductionmentioning
confidence: 99%