Maximum norm error bound of a linearized difference scheme for a coupled nonlinear Schrödinger equations

In this article, a linearized conservative difference scheme for a coupled nonlinear Schrödinger equations is studied. The discrete energy method and an useful technique are used to analyze the difference scheme. It is shown that the difference solution unconditionally converges to the exact solution with second order in the maximum norm. Numerical experiments are presented to support the theoretical results.     

Maximum norm error estimates of efficient difference schemes for second-order wave equations

The three-level explicit scheme is efficient for numerical approximation of the second-order wave equations. By employing a fourth-order accurate scheme to approximate the solution at first time level, it is shown that the discrete solution is conditionally convergent in the maximum norm with the convergence order of two. Since the asymptotic expansion of the difference solution consists of odd powers of the mesh parameters (time step and spacings), an unusual Richardson extrapolation formula is needed in promoting the second-order solution to fourth-order accuracy. Extensions of our technique to the classical ADI scheme also yield the maximum norm error estimate of the discrete solution and its extrapolation. Numerical experiments are presented to support our theoretical results.     

An Engquist-Osher type finite difference scheme with a discontinuous flux function in space

An Engquist-Osher type finite difference scheme is derived for dealing with scalar conservation laws having a flux that is spatially dependent through a possibly discontinuous coefficient. The new monotone difference scheme is based on introducing a new interface numerical flux function, which is called a generalized Engquist-Osher flux. By means of this scheme, the existence and uniqueness of weak solutions to the scalar conservation laws are obtained and the convergence theorem is established. Some numerical examples are presented and the corresponding numerical results are displayed to illustrate the efficiency of the methods.     

A Hamiltonian-conserving Galerkin scheme for the Camassa-Holm equation

A new Hamiltonian-conserving Galerkin scheme for the Camassa-Holm equation is presented. The scheme has an additional welcome feature that in exact arithmetic it is unconditionally stable in the sense that the solution is always bounded. Numerical examples that confirm the theory and the effectiveness of the scheme are also given.     

High-order compact finite difference scheme for option pricing in stochastic volatility models

We derive a new high-order compact finite difference scheme for option pricing in stochastic volatility models. The scheme is fourth order accurate in space and second order accurate in time. Under some restrictions, theoretical results like unconditional stability in the sense of von Neumann are presented. Where the analysis becomes too involved we validate our findings by a numerical study. Numerical experiments for the European option pricing problem are presented. We observe fourth order convergence for non-smooth payoff.     

A priori error estimation for the dual mixed finite element method of the elastodynamic problem in a polygonal domain, II

In this paper we analyze a new dual mixed formulation of the elastodynamic system in polygonal domains by using an implicit scheme for the time discretization. After the analysis of stability of the fully discrete scheme, L^∞ in time, L² in space a priori error estimates for the approximation of the displacement, the strain, the pressure and the rotational are derived. Numerical tests are presented which confirm our theoretical results.     

Error bounds for the large time step Glimm scheme applied to scalar conservation laws

Summary. In this paper we derive an error bound for the large time step, i.e. large Courant number, version of the Glimm scheme when used for the approximation of solutions to a genuinely nonlinear, i.e. convex, scalar conservation law for a generic class of piecewise constant data. We show that the error is bounded by for Courant numbers up to 1. The order of the error is the same as that given by Hoff and Smoller [5] in 1985 for the Glimm scheme under the restriction of Courant numbers up to 1/2. Received April 10, 2000 / Revised version received January 16, 2001 / Published online September 19, 2001     

On one approach to a posteriori error estimates for evolution problems solved by the method of lines

Summary. In this paper, we describe a new technique for a posteriori error estimates suitable to parabolic and hyperbolic equations solved by the method of lines. One of our goals is to apply known estimates derived for elliptic problems to evolution equations. We apply the new technique to three distinct problems: a general nonlinear parabolic problem with a strongly monotonic elliptic operator, a linear nonstationary convection-diffusion problem, and a linear second order hyperbolic problem. The error is measured with the aid of the -norm in the space-time cylinder combined with a special time-weighted energy norm. Theory as well as computational results are presented. Received September 2, 1999 / Revised version received March 6, 2000 / Published online March 20, 2001     

A new high accuracy locally one-dimensional scheme for the wave equation

In this paper, a new locally one-dimensional (LOD) scheme with error of O(Δt⁴+h⁴) for the two-dimensional wave equation is presented. The new scheme is four layer in time and three layer in space. One main advantage of the new method is that only tridiagonal systems of linear algebraic equations have to be solved at each time step. The stability and dispersion analysis of the new scheme are given. The computations of the initial and boundary conditions for the two intermediate time layers are explicitly constructed, which makes the scheme suitable for performing practical simulation in wave propagation modeling. Furthermore, a comparison of our new scheme and the traditional finite difference scheme is given, which shows the superiority of our new method.     

Second-order implicit–explicit scheme for the Gray–Scott model

A second-order scheme for the Gray–Scott (GS) model used to describe the pattern formation is studied. The linear part of the GS equation for the time derivative and the viscous terms is discretized implicitly, while the other (or nonlinear) part of the GS equation explicitly. Galerkin finite element approximation methods are presented and analyzed, as well as methods for solving the resulting system of equations. The optimal L²$L^2$-norm error estimates are derived. Numerical experiments are presented.     

A fully discrete scheme for diffusive-dispersive conservation laws

Summary.   We introduce a fully discrete (in both space and time) scheme for the numerical approximation of diffusive-dispersive hyperbolic conservation laws in one-space dimension. This scheme extends an approach by LeFloch and Rohde [4]: it satisfies a cell entropy inequality and, as a consequence, the space integral of the entropy is a decreasing function of time. This is an important stability property, shared by the continuous model as well. Following Hayes and LeFloch [2], we show that the limiting solutions generated by the scheme need not coincide with the classical Oleinik-Kruzkov entropy solutions, but contain nonclassical undercompressive shock waves. Investigating the properties of the scheme, we stress various similarities and differences between the continuous model and the discrete scheme (dynamics of nonclassical shocks, nucleation, etc). Received November 15, 1999 / Revised version received May 27, 2000 / Published online March 20, 2001     

A combined mixed and discontinuous Galerkin method for compressible miscible displacement problem in porous media

In this paper, we present a numerical scheme for solving the coupled system of compressible miscible displacement problem in porous media. The flow equation is solved by the mixed finite element method, and the transport equation is approximated by a discontinuous Galerkin method. The scheme is continuous in time and a priori hp error estimates is presented.     

Grid structure impact in sparse point representation of derivatives

In the Sparse Point Representation (SPR) method the principle is to retain the function data indicated by significant interpolatory wavelet coefficients, which are defined as interpolation errors by means of an interpolating subdivision scheme. Typically, a SPR grid is coarse in smooth regions, and refined close to irregularities. Furthermore, the computation of partial derivatives of a function from the information of its SPR content is performed in two steps. The first one is a refinement procedure to extend the SPR by the inclusion of new interpolated point values in a security zone. Then, for points in the refined grid, such derivatives are approximated by uniform finite differences, using a step size proportional to each point local scale. If required neighboring stencils are not present in the grid, the corresponding missing point values are approximated from coarser scales using the interpolating subdivision scheme. Using the cubic interpolation subdivision scheme, we demonstrate that such adaptive finite differences can be formulated in terms of a collocation scheme based on the wavelet expansion associated to the SPR. For this purpose, we prove some results concerning the local behavior of such wavelet reconstruction operators, which stand for SPR grids having appropriate structures. This statement implies that the adaptive finite difference scheme and the one using the step size of the finest level produce the same result at SPR grid points. Consequently, in addition to the refinement strategy, our analysis indicates that some care must be taken concerning the grid structure, in order to keep the truncation error under a certain accuracy limit. Illustrating results are presented for 2D Maxwell’s equation numerical solutions.     

Third order nonoscillatory central scheme for hyperbolic conservation laws

Summary. A third-order accurate Godunov-type scheme for the approximate solution of hyperbolic systems of conservation laws is presented. Its two main ingredients include: 1. A non-oscillatory piecewise-quadratic reconstruction of pointvalues from their given cell averages; and 2. A central differencing based on staggered evolution of the reconstructed cell averages. This results in a third-order central scheme, an extension along the lines of the second-order central scheme of Nessyahu and Tadmor \cite{NT}. The scalar scheme is non-oscillatory (and hence – convergent), in the sense that it does not increase the number of initial extrema (– as does the exact entropy solution operator). Extension to systems is carried out by componentwise application of the scalar framework. In particular, we have the advantage that, unlike upwind schemes, no (approximate) Riemann solvers, field-by-field characteristic decompositions, etc., are required. Numerical experiments confirm the high-resolution content of the proposed scheme. Thus, a considerable amount of simplicity and robustness is gained while retaining the expected third-order resolution. Received April 10, 1996 / Revised version received January 20, 1997     

Conservative difference methods for the Klein–Gordon–Zakharov equations

Firstly an implicit conservative finite difference scheme is presented for the initial-boundary problem of the one space dimensional Klein–Gordon–Zakharov (KGZ) equations. The existence of the difference solution is proved by Leray–Schauder fixed point theorem. It is proved by the discrete energy method that the scheme is uniquely solvable, unconditionally stable and second order convergent for U   in _l∞$l_{\infty }$ norm, and for N   in _l2$l_2$ norm on the basis of the priori estimates. Then an explicit difference scheme is proposed for the KGZ equations, on the basis of priori estimates and two important inequalities about norms, convergence of the difference solutions is proved. Because it is explicit and not coupled it can be computed by a parallel method. Numerical experiments with the two schemes are done for several test cases. Computational results demonstrate that the two schemes are accurate and efficient.     

Analysis of a symplectic difference scheme for a coupled nonlinear Schrödinger system

In general, proofs of convergence and stability are difficult for symplectic schemes of nonlinear equations. In this paper, a symplectic difference scheme is proposed for an initial-boundary value problem of a coupled nonlinear Schrödinger system. An important lemma and an induction argument are used to prove the unique solvability, convergence and stability of numerical solutions. An iterative algorithm is also proposed for the symplectic scheme and its convergence is proved. Numerical examples show the efficiency of the symplectic scheme and the correction of our numerical analysis.     

Nonlinear scheme with high accuracy for nonlinear coupled parabolic-hyperbolic system

A nonlinear finite difference scheme with high accuracy is studied for a class of two-dimensional nonlinear coupled parabolic-hyperbolic system. Rigorous theoretical analysis is made for the stability and convergence properties of the scheme, which shows it is unconditionally stable and convergent with second order rate for both spatial and temporal variables. In the argument of theoretical results, difficulties arising from the nonlinearity and coupling between parabolic and hyperbolic equations are overcome, by an ingenious use of the method of energy estimation and inductive hypothesis reasoning. The reasoning method here differs from those used for linear implicit schemes, and can be widely applied to the studies of stability and convergence for a variety of nonlinear schemes for nonlinear PDE problems. Numerical tests verify the results of the theoretical analysis. Particularly it is shown that the scheme is more accurate and faster than a previous two-level nonlinear scheme with first order temporal accuracy.     

A high order uniformly convergent alternating direction scheme for time dependent reaction–diffusion singularly perturbed problems

In this work we design and analyze an efficient numerical method to solve two dimensional initial-boundary value reaction–diffusion problems, for which the diffusion parameter can be very small with respect to the reaction term. The method is defined by combining the Peaceman and Rachford alternating direction method to discretize in time, together with a HODIE finite difference scheme constructed on a tailored mesh. We prove that the resulting scheme is ε-uniformly convergent of second order in time and of third order in spatial variables. Some numerical examples illustrate the efficiency of the method and the orders of uniform convergence proved theoretically. We also show that it is easy to avoid the well-known order reduction phenomenon, which is usually produced in the time integration process when the boundary conditions are time dependent. This research has been partially supported by the project MEC/FEDER MTM2004-01905 and the Diputación General de Aragón.     

On the convergence of finite difference schemes for the heat equation with concentrated capacity

Summary. We investigate the convergence of difference schemes for the one-dimensional heat equation when the coefficient at the time derivative (heat capacity) is represents the magnitude of the heat capacity concentrated at the point . An abstract operator method is developed for analyzing this equation. Estimates for the rate of convergence in special discrete energetic Sobolev's norms, compatible with the smoothness of the solution are obtained. Received November 2, 1999 / Revised version received July 24, 2000 / Published online May 4, 2001     

Analysis and finite element approximations for distributed optimal control problems for implicit parabolic equations

This work concerns analysis and error estimates for optimal control problems related to implicit parabolic equations. The minimization of the tracking functional subject to implicit parabolic equations is examined. Existence of an optimal solution is proved and an optimality system of equations is derived. Semi-discrete (in space) error estimates for the finite element approximations of the optimality system are presented. These estimates are symmetric and applicable for higher-order discretizations. Finally, fully-discrete error estimates of arbitrarily high-order are presented based on a discontinuous Galerkin (in time) and conforming (in space) scheme. Two examples related to the Lagrangian moving mesh Galerkin formulation for the convection-diffusion equation are described.