In this paper, we have proved the second-order convergence in Loo norm of the Tsertsvadze's difference scheme for the Kuramoto-Tsuzuki equation. The existence, uniqueness and iterative algorithm are also discussed in detail. Furthermore, a Loo second order convergent linearized difference scheme is
A robust semi-explicit difference scheme for the Kuramoto–Tsuzuki equation
✍ Scribed by Tingchun Wang; Boling Guo
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 619 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper, we propose a robust semi-explicit difference scheme for solving the Kuramoto-Tsuzuki equation with homogeneous boundary conditions. Because the prior estimate in L ∞ -norm of the numerical solutions is very hard to obtain directly, the proofs of convergence and stability are difficult for the difference scheme. In this paper, we first prove the second-order convergence in L 2 -norm of the difference scheme by an induction argument, then obtain the estimate in L ∞ -norm of the numerical solutions. Furthermore, based on the estimate in L ∞ -norm, we prove that the scheme is also convergent with second order in L ∞ -norm. Numerical examples verify the correction of the theoretical analysis.
📜 SIMILAR VOLUMES
A nonlinear finite difference scheme is studied for solving the Kuramoto-Tsuzuki equation. Because the maximum estimate of the numerical solution can not be obtained directly, it is difficult to prove the stability and convergence of the scheme. In this paper, we introduce the Brouwer-type fixed poi