Fourth‐order compact scheme for the one‐dimensional sine‐Gordon equation

Finite difference scheme to the generalized one‐dimensional sine‐Gordon equation is considered in this paper. After approximating the second order derivative in the space variable by the compact finite difference, we transform the sine‐Gordon equation into an initial‐value problem of a second‐order ordinary differential equation. Then Padé approximant is used to approximate the time derivatives. The resulting fully discrete nonlinear finite‐difference equation is solved by a predictor‐corrector scheme. Both Dirichlet and Neumann boundary conditions are considered in our proposed algorithm. Stability analysis and error estimate are given for homogeneous Dirichlet boundary value problems using energy method. Numerical results are given to verify the condition for stability and convergence and to examine the accuracy and efficiency of the proposed algorithm. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

On the numerical solution of the Klein‐Gordon equation

A predictor–corrector (P–C) scheme based on the use of rational approximants of second‐order to the matrix‐exponential term in a three‐time level reccurence relation is applied to the nonlinear Klein‐Gordon equation. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. Both the predictor and the corrector scheme are analyzed for local truncation error and stability. The proposed method is applied to problems possessing periodic, kinks and single, double‐soliton waves. The accuracy as well as the long time behavior of the proposed scheme is discussed. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Space‐time spectral collocation method for the one‐dimensional sine‐Gordon equation

In this article, we introduce a new space‐time spectral collocation method for solving the one‐dimensional sine‐Gordon equation. We apply a spectral collocation method for discretizing spatial derivatives, and then use the spectral collocation method for the time integration of the resulting nonlinear second‐order system of ordinary differential equations (ODE). Our formulation has high‐order accurate in both space and time. Optimal a priori error bounds are derived in the L²‐norm for the semidiscrete formulation. Numerical experiments show that our formulation have exponential rates of convergence in both space and time. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 670–690, 2015     

A predictor‐‐corrector scheme for the sine‐Gordon equation

A predictor–corrector scheme is developed for the numerical solution of the sine‐Gordon equation using the method of lines approach. The solution of the approximating differential system satisfies a recurrence relation, which involves the cosine function. Pade' approximants are used to replace the cosine function in the recurrence relation. The resulting schemes are analyzed for order, stability, and convergence. Numerical results demonstrate the efficiency and accuracy of the predictor–corrector scheme over some well‐known existing methods. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 133–146, 2000     

Convergence of the interpolated coefficient finite element method for the two‐dimensional elliptic sine‐Gordon equations

An interpolated coefficient finite element method is presented and analyzed for the two‐dimensional elliptic sine‐Gordon equations with Dirichlet boundary conditions. It is proved that the discretization scheme admits at least one solution, and that a subsequence of the approximation solutions converges to an exact solution in L²‐norm as the mesh size tends to zero. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2011     

The boundary integral equation approach for numerical solution of the one‐dimensional Sine‐Gordon equation

This article describes a numerical method based on the boundary integral equation and dual reciprocity method for solving the one‐dimensional Sine‐Gordon (SG) equation. The time derivative is approximated by the time‐stepping method and a predictor–corrector scheme is employed to deal with the nonlinearity which appears in the problem. Numerical results are presented for some problems to demonstrate the usefulness and accuracy of this approach. In addition, the conservation of energy in SG equation is investigated. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

A numerical method for computing radially symmetric solutions of a dissipative nonlinear modified Klein‐Gordon equation

In this article we develop a finite‐difference scheme to approximate radially symmetric solutions of a dissipative nonlinear modified Klein‐Gordon equation subject to smooth initial conditions ? and ψ in an open sphere D around the origin, with constant internal and external damping coefficients—β and γ, respectively—, and nonlinear term of the form G′(w) = w^p, with p > 1 an odd number. The functions ? and ψ are radially symmetric in D, and ?, ψ, r?, and rψ are assumed to be small at infinity. We prove that our scheme is consistent order ??(Δt²) + ??(Δr²) for G′ identically equal to zero and provide a necessary condition for it to be stable order n. Part of our study will be devoted to compare the physical effects of β and γ. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

A novel attempt for finding comparatively accurate solution for sine‐Gordon equation comprising Riesz space fractional derivative

In this paper, a numerical procedure involving Chebyshev wavelet method has been implemented for computing the approximate solution of Riesz space fractional sine‐Gordon equation (SGE). Two‐dimensional Chebyshev wavelet method is implemented to calculate the numerical solution of space fractional SGE. The fractional SGE is considered as an interpolation between the classical SGE (corresponding to α = 2) and nonlocal SGE (corresponding to α = 1). As a consequence, the approximate solutions of fractional SGE obtained by using Chebyshev wavelet approach were compared with those derived by using modified homotopy analysis method with Fourier transform. Copyright © 2015 John Wiley & Sons, Ltd.     

Adaptive stabilization of the sine‐Gordon equation by boundary control

This paper is concerned with adaptive global stabilization of the sine‐Gordon equation without damping by boundary control. An adaptive stabilizer is constructed by the concept of high‐gain output feedback. The closed‐loop system is shown to be locally well‐posed by the Banach fixed point theorem and then to be globally well‐posed by the Lyapunov method. Moreover, using a multiplier method global exponential stabilization of the system is proved. Copyright © 2004 John Wiley & Sons, Ltd.     

A numerical method for one‐dimensional nonlinear Sine‐Gordon equation using collocation and radial basis functions

In this article, we propose a numerical scheme to solve the one‐dimensional undamped Sine‐Gordon equation using collocation points and approximating the solution using Thin Plate Splines (TPS) radial basis function (RBF). The scheme works in a similar fashion as finite difference methods. The results of numerical experiments are presented and are compared with analytical solutions to confirm the good accuracy of the presented scheme.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

A pseudo‐spectral method that uses an overlapping multidomain technique for the numerical solution of sine‐Gordon equation in one and two spatial dimensions

In this article, we study an explicit scheme for the solution of sine‐Gordon equation when the space discretization is carried out by an overlapping multidomain pseudo‐spectral technique. By using differentiation matrices, the equation is reduced to a nonlinear system of ordinary differential equations in time that can be discretized with the explicit fourth‐order Runge–Kutta method. To achieve approximation with high accuracy in large domains, the number of space grid points must be large enough. This yields very large and full matrices in the pseudo‐spectral method that causes large memory requirements. The domain decomposition approach provides sparsity in the matrices obtained after the discretization, and this property reduces storage for large matrices and provides economical ways of performing matrix–vector multiplications. Therefore, we propose a multidomain pseudo‐spectral method for the numerical simulation of the sine‐Gordon equation in large domains. Test examples are given to demonstrate the accuracy and capability of the proposed method. Numerical experiments show that the multidomain scheme has an excellent long‐time numerical behavior for the sine‐Gordon equation in one and two dimensions. Copyright © 2013 John Wiley & Sons, Ltd.     

Numerical results for the Klein‐Gordon equation in de Sitter spacetime

We consider the initial value problem for the Klein‐Gordon equation in de Sitter spacetime. We use the central difference scheme on the temporal discretization. We also discretize the spatial variable using the finite element method with implicit and the Crank‐Nicolson schemes for the numerical solution of the initial value problem. In order to show the accuracy for the results of the solutions, we also examine the finite difference methods. We observe that the numerical results obtained by using these methods are compatible.     

An accurate numerical method for solving the linear fractional Klein–Gordon equation

In this article, an implementation of an efficient numerical method for solving the linear fractional Klein–Gordon equation (LFKGE) is introduced. The fractional derivative is described in the Caputo sense. The method is based upon a combination between the properties of the Chebyshev approximations and finite difference method (FDM). The proposed method reduces LFKGE to a system of ODEs, which is solved using FDM. Special attention is given to study the convergence analysis and deduce an error upper bound of the proposed method. Numerical example is given to show the validity and the accuracy of the proposed algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

Finite analytic numerical method for solving two‐dimensional quasi‐Laplace equation

A typical power series analytic solution of quasi‐Laplace equation in the infinitesimal angle domain around the singular point of the square cells is provided in this article. Toward the singular point, the gradient of the potential variable will tend to infinity, which is described by the first term of the power series solution. Based on this analytic solution, three finite analytic numerical methods are proposed. These methods are analogous and are constructed, respectively, when considering different numbers of the terms or using different schemes to determine the relevant parameters in the power series. Numerical examples show that all of the three finite analytic numerical methods proposed can provide rather accurate solutions than the traditional numerical methods. In contrast, when using the traditional numerical schemes to solve the quasi‐Laplace equation in a strong heterogeneous medium, the refinement ratio for the grid cell needs to increase dramatically to get an accurate result. In practical applications, subdividing each origin cell into 2 × 2 or 3 × 3 subcells is enough for the finite analytical numerical methods to get relatively accurate results. The finite analytical numerical methods are also convenient to construct the flux field with high accuracy.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1755–1769, 2014     

A numerical method based on integro‐differential formulation for solving a one‐dimensional Stefan problem

A numerical method based on an integro‐differential formulation is proposed for solving a one‐dimensional moving boundary Stefan problem involving heat conduction in a solid with phase change. Some specific test problems are solved using the proposed method. The numerical results obtained indicate that it can give accurate solutions and may offer an interesting and viable alternative to existing numerical methods for solving the Stefan problem. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

On the complete group classification of the one‐dimensional nonlinear Klein–Gordon equation with a delay

This research gives a complete Lie group classification of the one‐dimensional nonlinear delay Klein–Gordon equation. First, the determining equations are derived and their complete solutions are found. Then the complete group classification and representations of all invariant solutions are obtained. Copyright © 2015 John Wiley & Sons, Ltd.     

A novel variable‐order fractional nonlinear Klein Gordon model: A numerical approach

In this article, a novel variable order fractional nonlinear Klein Gordon model is presented where the variable‐order fractional derivative is defined in the Caputo sense. The merit of nonstandard numerical techniques is extended here and we present the weighted average nonstandard finite difference method to study numerically the proposed model. Special attention is paid to study the convergence and to the stability analysis of the numerical technique. Moreover, the truncation error is analyzed. Three test examples are provided. Comparative studies are done between the used numerical technique and the weighted average finite difference method. It is found that the stability regions are larger by using the weighted average nonstandard finite difference method.     

A moving Kriging‐based MLPG method for nonlinear Klein–Gordon equation

In this paper, the meshless local Petrov–Galerkin approximation is proposed to solve the 2‐D nonlinear Klein–Gordon equation. We used the moving Kriging interpolation instead of the MLS approximation to construct the meshless local Petrov–Galerkin shape functions. These shape functions possess the Kronecker delta function property. The Heaviside step function is used as a test function over the local sub‐domains. Here, no mesh is needed neither for integration of the local weak form nor for construction of the shape functions. So the present method is a truly meshless method. We employ a time‐stepping method to deal with the time derivative and a predictor–corrector scheme to eliminate the nonlinearity. Several examples are performed and compared with analytical solutions and with the results reported in the extant literature to illustrate the accuracy and efficiency of the presented method. Copyright © 2016 John Wiley & Sons, Ltd.