Affordable Access

Publisher Website

Convergence of an efficient and compact finite difference scheme for the Klein–Gordon–Zakharov equation

Applied Mathematics and Computation
Publication Date
DOI: 10.1016/j.amc.2013.06.059
  • Klein–Gordon–Zakharov Equation
  • Semi-Explicit Scheme
  • Compact Finite Difference Scheme
  • Solvability
  • Convergence
  • Computer Science
  • Mathematics


Abstract A compact and semi-explicit finite difference scheme is proposed and analyzed for the Klein–Gordon–Zakharov (KGZ) equation. The new scheme is decoupled and linearized in practical computation, i.e., at each time step only two tri-diagonal systems of linear algebraic equations need to be solved by Thomas algorithm. So the new scheme is more efficient and more accurate than the classical finite difference schemes. Unique solvability of the difference solution is proved by using the energy method. Besides the standard energy method, in order to overcome the difficulty in obtaining the a priori estimate, an induction argument is introduced to prove that the new scheme is convergent for u(x,t) in the discrete H1-norm, and respectively for m(x,t) in the discrete L2-norm, at the order of O(τ2+h4) with time step τ and mesh size h. Numerical results are reported to verify the theoretical analysis.

There are no comments yet on this publication. Be the first to share your thoughts.


Seen <100 times

More articles like this

Conservative difference methods for the Klein–Gord...

on Journal of Computational and A... Jan 01, 2007

Convergence of a conservative difference scheme fo...

on Applied Mathematics and Comput... Jan 01, 2005

Optimal point-wise error estimate of a compact dif...

on Journal of Mathematical Analys... Apr 01, 2014

A compact difference scheme for a two dimensional...

on Journal of Computational Physi... Oct 01, 2014
More articles like this..