A theoretical analysis of a new finite volume scheme for second order hyperbolic equations on general nonconforming multidimensional spatial meshes

We consider the wave equation, on a multidimensional spatial domain. The discretization of the spatial domain is performed using a general class of nonconforming meshes which has been recently studied for stationary anisotropic heterogeneous diffusion problems, see Eymard et al. (IMAJ Numer Anal 30 (2010), 1009–1043). The discretization in time is performed using a uniform mesh. We derive a new implicit finite volume scheme approximating the wave equation and we prove error estimates of the finite volume approximate solution in several norms which allow us to derive error estimates for the approximations of the exact solution and its first derivatives. We prove in particular, when the discrete flux is calculated using a stabilized discrete gradient, the convergence order is begin{align*} h_mathcal{D}end{align*} (resp. k) is the mesh size of the spatial (resp. time) discretization. This estimate is valid under the regularity assumption begin{align*}uin C^3(lbrack 0,Trbrack;C^2(overline{Omega}))end{align*} for the exact solution u. The proof of these error estimates is based essentially on a comparison between the finite volume approximate solution and an auxiliary finite volume approximation. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Convergence analysis of some first order and second order time accurate gradient schemes for semilinear second order hyperbolic equations

This work is devoted to the convergence analysis of finite volume schemes for a model of semilinear second order hyperbolic equations. The model includes for instance the so‐called Sine‐Gordon equation which appears for instance in Solid Physics (cf. Fang and Li, Adv Math (China) 42 (2013), 441–457; Liu et al., Numer Methods Partial Differ Equ 31 (2015), 670–690). We are motivated by two works. The first one is Eymard et al. (IMA J Numer Anal 30 (2010), 1009–1043) where a recent class of nonconforming finite volume meshes is introduced. The second one is Eymard et al. (Numer Math 82 (1999), 91–116) where a convergence of a finite volume scheme for semilinear elliptic equations is provided. The mesh considered in Eymard et al. (Numer Math 82 (1999), 91–116) is admissible in the sense of Eymard et al. (Elsevier, Amsterdam, 2000, 723–1020) and a convergence of a family of approximate solutions toward an exact solution when the mesh size tends to zero is proved. This article is also a continuation of our previous two works (Bradji, Numer Methods Partial Differ Equ 29 (2013), 1278–1321; Bradji, Numer Methods Partial Differ Equ 29 (2013), 1–39) which dealt with the convergence analysis of implicit finite volume schemes for the wave equation. We use as discretization in space the generic spatial mesh introduced in Eymard et al. (IMA J Numer Anal 30 (2010), 1009–1043), whereas the discretization in time is performed using a uniform mesh. Two finite volume schemes are derived using the discrete gradient of Eymard et al. (IMA J Numer Anal 30 (2010), 1009–1043). The unknowns of these two schemes are the values at the center of the control volumes, at some internal interfaces, and at the mesh points of the time discretization. The first scheme is inspired from the previous work (Bradji, Numer Methods Partial Differ Equ 29 (2013), 1–39), whereas the second one (in which the discretization in time is performed using a Newmark method) is inspired from the work (Bradji, Numer Methods Partial Differ Equ 29 (2013), 1278–1321). Under the assumption that the mesh size of the time discretization is small, we prove the existence and uniqueness of the discrete solutions. If we assume in addition to this that the exact solution is smooth, we derive and prove three error estimates for each scheme. The first error estimate is concerning an estimate for the error between a discrete gradient of the approximate solution and the gradient of the exact solution whereas the second and the third ones are concerning the estimate for the error between the exact solution and the discrete solution in the discrete seminorm of and in the norm of . The convergence rate is proved to be for the first scheme and for the second scheme, where (resp. k) is the mesh size of the spatial (resp. time) discretization. The existence, uniqueness, and convergence results stated above do not require any relation between k and . The analysis presented in this work is also applicable in the gradient schemes framework. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 5–33, 2017     

A theoretical analysis of a new second order finite volume approximation based on a low-order scheme using general admissible spatial meshes for the one dimensional wave equation

This paper details our note [6] and it is an extension of our previous works  and  which dealt with first order (both in time and space) and second order time accurate (second order in time and first order in space) implicit finite volume schemes for second order hyperbolic equations with Dirichlet boundary conditions on general nonconforming multidimensional spatial meshes introduced recently in [14]. We aim in this work (and some forthcoming studies) to get higher order (both in time and space) finite volume approximations for the exact solution of hyperbolic equations using the class of spatial generic meshes introduced recently in [14] on low order schemes from which the matrices used to compute the discrete solutions are sparse. We focus in the present contribution on the one dimensional wave equation and on one of its implicit finite volume schemes described in [4]. The implicit finite volume scheme approximating the one dimensional wave equation we consider (hereafter referred to as the basic finite volume scheme) yields linear systems to be solved successively. The matrices involved in these linear systems are tridiagonal, symmetric and definite positive. The finite volume approximate solution of the basic finite volume scheme is of order h+k$h+k$, where h (resp. k  ) is the mesh size of the spatial (resp. time) discretization. We construct a new finite volume approximation of order (h+k)²${(h+k)}^2$ in several discrete norms which allow us to get approximations of order two for the exact solution and its first derivatives. This new high-order approximation can be computed using linear systems whose matrices are the same ones used to compute the discrete solution of the basic finite volume scheme while the right hand sides are corrected. The construction of these right hand sides includes the approximation of some high order spatial derivatives of the exact solution. The computation of the approximation of these high order spatial derivatives can be performed using the same matrices stated above with another two tridiagonal matrices. The manner by which this new high-order approximation is constructed can be repeated to compute successively finite volume approximations of arbitrary order using the same matrices stated above. These high-order approximations can be obtained on any one dimensional admissible finite volume mesh in the sense of [13] without any condition. To reach the above results, a theoretical framework is developed and some numerical examples supporting the theory are presented. Some of the tools of this framework are new and interesting and they are stated in the one space dimension but they can be extended to several space dimensions. In particular a new and useful a prior estimate for a suitable discrete problem is developed and proved. The proof of this a prior estimate result is based essentially on the decomposition of the solution of the discrete problem into the solutions of two suitable discrete problems. A new technique is used in order to get a convenient finite volume approximation whose discrete time derivatives of order up to order two are also converging towards the solution of the wave equation and their corresponding time derivatives.     

Biquadratic finite volume element method based on optimal stress points for second order hyperbolic equations

Based on optimal stress points, we develop a full discrete finite volume element scheme for second order hyperbolic equations using the biquadratic elements. The optimal order error estimates in L^∞(H¹), L^∞(L²) norms are derived, in addition, the superconvergence of numerical gradients at optimal stress points is also discussed. Numerical results confirm the theoretical order of convergence. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2013     

A study on a second order finite difference scheme for fractional advection–diffusion equations

Second order finite difference schemes for fractional advection–diffusion equations are considered in this paper. We note that, when studying these schemes, advection terms with coefficients having the same sign as those of diffusion terms need additional estimates. In this paper, by comparing generating functions of the corresponding discretization matrices, we find that sufficiently strong diffusion can dominate the effects of advection. As a result, convergence and stability of schemes are obtained in this situation.     

New estimates of mixed finite element method for fourth‐order wave equation

The conforming bilinear mixed finite element method is established for a fourth‐order wave equation. By applying the interpolation and projection simultaneously, the superclose and superconvergence results of order O (h ²) for the original variable u and intermediate variable p  =? a ₁(X )Δu in H¹‐norm are achieved for the semi‐discrete and fully discrete schemes, respectively (where a ₁(X ) is the coefficient appeared in the equation). The distinct advantage of this method is that it can reduce the smoothness of solutions u ,u _t , and p compared with the existing literature for getting optimal estimates alone. At last, some numerical results are carried out to validate the theoretical analysis. Copyright © 2017 John Wiley & Sons, Ltd.     

RBF‐ENO/WENO schemes with Lax–Wendroff type time discretizations for Hamilton–Jacobi equations

In this research, a class of radial basis functions (RBFs) ENO/WENO schemes with a Lax–Wendroff time discretization procedure, named as RENO/RWENO‐LW, for solving Hamilton–Jacobi (H–J) equations is designed. Particularly the multi‐quadratic RBFs are used. These schemes enhance the local accuracy and convergence by locally optimizing the shape parameters. Comparing with the original WENO with Lax–Wendroff time discretization schemes of Qiu for HJ equations, the new schemes provide more accurate reconstructions and sharper solution profiles near strong discontinuous derivative. Also, the RENO/RWENO‐LW schemes are easy to implement in the existing original ENO/WENO code. Extensive numerical experiments are considered to verify the capability of the new schemes.     

A full analysis of a new second order finite volume approximation based on a low-order scheme using general admissible spatial meshes for the unsteady one dimensional heat equation

The present work is an extension of our previous works ,  and  which dealt with first order (both in time and space) and second order time accurate (second order in time and first order in space) implicit finite volume schemes for parabolic equations. We aim in this work (and some forthcoming studies) at getting higher order (both in time and space) finite volume approximations for the exact solution of parabolic equations using the class of spatial generic meshes introduced recently in [13]. We focus in the present contribution on the one dimensional heat equation and its implicit finite volume scheme described in [3]. The implicit finite volume scheme approximating the one dimensional heat equation we consider (hereafter referred to as the basic finite volume scheme) yields linear systems to be solved successively. The matrices involved in these linear systems are tridiagonal. The finite volume approximate solution is of order h+k$h+k$, where h (resp. k  ) is the mesh size of the spatial (resp. time) discretization. We construct a new finite volume approximation of order (h+k)²${(h+k)}^2$ in several discrete norms which allows us to get approximations of order two for the exact solution and its first derivatives. This new high-order approximation can be computed using the same linear systems involved in the basic finite volume scheme while the right hand sides are corrected. The construction of these right hand sides includes the approximations of the second, third, and fourth spatial derivatives of the exact solution. The computation of the approximation of these high-order derivatives can be performed using the same matrices stated above with another two tridiagonal matrices. The manner by which this new high-order approximation is constructed can be repeated to compute successively finite volume approximations of arbitrary order using the same matrices stated above. These high-order approximations can be obtained on any one dimensional admissible finite volume mesh in the sense of [12] without any restrictive condition on the spatial mesh. A full analysis for the stated theoretical results as well as some numerical examples supporting the theory is presented. The results obtained in the present study are based essentially on two facts. The first fact is the use of the results provided in [3] which state the convergence order of the finite volume approximate solution in several norms. The second fact is the comparison between the stated new higher order approximations and suitable auxiliary finite volume approximations.     

A fourth‐order H1‐Galerkin mixed finite element method for Kuramoto–Sivashinsky equation

A H¹‐Galerkin mixed finite element method is applied to the Kuramoto–Sivashinsky equation by using a splitting technique, which results in a coupled system. The method described in this article may also be considered as a Petrov–Galerkin method with cubic spline space as trial space and piecewise linear space as test space, since the second derivative of a cubic spline is a linear spline. Optimal‐order error estimates are obtained without any restriction on the mesh for both semi‐discrete and fully discrete schemes. The advantage of this method over that presented in Manickam et al., Comput. Math. Appl. vol. 35(6) (1998) pp. 5–25; for the same problem is that the size (i.e., (n + 1) × (n + 1)) of each resulting linear system is less than half of the size of the linear system of the earlier method, where n is the number of subintervals in the partition. Further, there is a requirement of less regularity on exact solution in this method. The results are validated with numerical examples. Finally, instability behavior of the solution is numerically captured with this method.     

Long time error analysis of the fourth‐order compact finite difference methods for the nonlinear Klein–Gordon equation with weak nonlinearity

We present the fourth‐order compact finite difference (4cFD) discretizations for the long time dynamics of the nonlinear Klein–Gordon equation (NKGE), while the nonlinearity strength is characterized by ?^p with a constant p ∈ ?⁺ and a dimensionless parameter ? ∈ (0, 1] . Based on analytical results of the life‐span of the solution, rigorous error bounds of the 4cFD methods are carried out up to the time at O(?^?p) . We pay particular attention to how error bounds depend explicitly on the mesh size h and time step τ as well as the small parameter ? ∈ (0, 1] , which indicate that, in order to obtain ‘correct’ numerical solutions up to the time at O(?^?p) , the ? ‐scalability (or meshing strategy requirement) of the 4cFD methods should be taken as: h = O(?^p/4) and τ = O(?^p/2) . It has better spatial resolution capacity than the classical second order central difference methods. By a rescaling in time, it is equivalent to an oscillatory NKGE whose solution propagates waves with wavelength at O(1) in space and O(?^p) in time. It is straightforward to get the error bounds of the oscillatory NKGE in the fixed time. Finally, numerical results are provided to confirm our theoretical analysis.