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

A three‐level linearized finite difference scheme for the camassa–holm equation

Abstract: The Camassa–Holm (CH) system is a strong nonlinear third‐order evolution equation. So far, the numerical methods for solving this problem are only a few. This article deals with the finite difference solution to the CH equation. A three‐level linearized finite difference scheme is derived. The scheme is proved to be conservative, uniquely solvable, and conditionally second‐order convergent in both time and space in the discrete L∞ norm. Several numerical examples are presented to demonstrate the accuracy and e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 31 publications
0
5
0
Order By: Relevance
“…Crank-Nicolson Scheme and Richardson's Extrapolation. We use a three-level Crank-Nicolson scheme (see [18][19][20][21]) of second-order accuracy to solve the nonlinear and inhomogeneous partial differential equation given by (19) and use Richardson's extrapolation technique for further improving accuracy. Numerically, one can only solve (19) over a finite domain…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Crank-Nicolson Scheme and Richardson's Extrapolation. We use a three-level Crank-Nicolson scheme (see [18][19][20][21]) of second-order accuracy to solve the nonlinear and inhomogeneous partial differential equation given by (19) and use Richardson's extrapolation technique for further improving accuracy. Numerically, one can only solve (19) over a finite domain…”
Section: Methodsmentioning
confidence: 99%
“…is discretization scheme leads to a set of linear equations. Based on the expressions given by (21) and (22), equation (19) can be discretized as…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“… δtujn+αm+1δtruex^()ujnmtrueujn+β6δxxtrue‾xtrue^(3)ujntrueujn+γβ3ujnδxxtrue‾xtrue^(3)utrue‾jn+μδxxxtrue‾xtrue‾xtrue^(5)utrue‾jn=0. Another approach for solving Equation (1), based on the existing finite difference schemes for solving the Camassa–Holm equation [22], Equation (1) can be rewritten as ut+αm+1()um+1x+false(βγfalse)uitalicxxux+γ()italicuuitalicxxx+μuitalicxxxxx=0, where the formula italicuuitalicxxx=()italicuuitalicxxx…”
Section: Finite Difference Schemementioning
confidence: 99%
“…Another approach for solving Equation (1), based on the existing finite difference schemes for solving the Camassa-Holm equation [22], Equation (1) can be rewritten as…”
Section: Construction Of Difference Schemesmentioning
confidence: 99%