A third-order semi-discrete genuinely multidimensional central scheme for hyperbolic conservation laws and related problems

Summary. We construct a new third-order semi-discrete genuinely multidimensional central scheme for systems of conservation laws and related convection-diffusion equations. This construction is based on a multidimensional extension of the idea, introduced in [17] – the use of more precise information about the local speeds of propagation, and integration over nonuniform control volumes, which contain Riemann fans. As in the one-dimensional case, the small numerical dissipation, which is independent of , allows us to pass to a limit as . This results in a particularly simple genuinely multidimensional semi-discrete scheme. The high resolution of the proposed scheme is ensured by the new two-dimensional piecewise quadratic non-oscillatory reconstruction. First, we introduce a less dissipative modification of the reconstruction, proposed in [29]. Then, we generalize it for the computation of the two-dimensional numerical fluxes. Our scheme enjoys the main advantage of the Godunov-type central schemes –simplicity, namely it does not employ Riemann solvers and characteristic decomposition. This makes it a universal method, which can be easily implemented to a wide variety of problems. In this paper, the developed scheme is applied to the Euler equations of gas dynamics, a convection-diffusion equation with strongly degenerate diffusion, the incompressible Euler and Navier-Stokes equations. These numerical experiments demonstrate the desired accuracy and high resolution of our scheme. Received February 7, 2000 / Published online December 19, 2000     

Hyperbolic balance laws: Riemann invariants and the generalized Riemann problem

The Generalized Riemann Problem (GRP) for a nonlinear hyperbolic system of m balance laws (or alternatively “quasi-conservative” laws) in one space dimension is now well-known and can be formulated as follows: Given initial-data which are analytic on two sides of a discontinuity, determine the time evolution of the solution at the discontinuity. In particular, the GRP numerical scheme (second-order high resolution) is based on an analytical evaluation of the first time derivative. It turns out that this derivative depends only on the first-order spatial derivatives, hence the initial data can be taken as piecewise linear. The analytical solution is readily obtained for a single equation (m = 1) and, more generally, if the system is endowed with a complete (coordinate) set of Riemann invariants. In this case it can be “diagonalized” and reduced to the scalar case. However, most systems with m > 2 do not admit such a set of Riemann invariants. This paper introduces a generalization of this concept: weakly coupled systems (WCS). Such systems have only “partial set” of Riemann invariants, but these sets are weakly coupled in a way which enables a “diagonalized” treatment of the GRP. An important example of a WCS is the Euler system of compressible, nonisentropic fluid flow (m = 3). The solution of the GRP discussed here is based on a careful analysis of rarefaction waves. A “propagation of singularities” argument is applied to appropriate Riemann invariants across the rarefaction fan. It serves to “rotate” initial spatial slopes into “time derivative”. In particular, the case of a “sonic point” is incorporated easily into the general treatment. A GRP scheme based on this solution is derived, and several numerical examples are presented. Special attention is given to the “acoustic approximation” of the analytical solution. It can be viewed as a proper linearization (different from the approach of Roe) of the nonlinear system. The resulting numerical scheme is the simplest (second-order, high-resolution) generalization of the Godunov scheme.     

A priori error estimates for approximate solutions to convex conservation laws

Summary. We introduce a new technique for proving a priori error estimates between the entropy weak solution of a scalar conservation law and a finite–difference approximation calculated with the scheme of Engquist-Osher, Lax-Friedrichs, or Godunov. This technique is a discrete counterpart of the duality technique introduced by Tadmor [SIAM J. Numer. Anal. 1991]. The error is related to the consistency error of cell averages of the entropy weak solution. This consistency error can be estimated by exploiting a regularity structure of the entropy weak solution. One ends up with optimal error estimates. Received December 21, 2001 / Revised version received February 18, 2002 / Published online June 17, 2002     

一种新的求解双曲型守恒律的三阶中心差分格式

本文提出了一种求解双曲型守恒律新的三阶中心差分格式，主要是引入了一种推广的三阶重构，并证明了这种重构在网格边界无振荡．所提的格式保持了中心差分格式简单的优点，不需用Riemann解算器，避免了进行特征解耦．数值试验结果表明本文格式是高精度、高分辨率的。     

A finite volume scheme for nonlinear parabolic equations derived from one-dimensional local dirichlet problems

In this paper, we propose a new method to compute the numerical flux of a finite volume scheme, used for the approximation of the solution of the nonlinear partial differential equation u_t+div(qf(u))−ΔΦ(u)=0 in a 1D, 2D or 3D domain. The function Φ is supposed to be strictly increasing, but some values s such that Φ′(s)=0 can exist. The method is based on the solution, at each interface between two control volumes, of the nonlinear elliptic two point boundary value problem (qf(υ)+(Φ(υ))′)′=0 with Dirichlet boundary conditions given by the values of the discrete approximation in both control volumes. We prove the existence of a solution to this two point boundary value problem. We show that the expression for the numerical flux can be yielded without referring to this solution. Furthermore, we prove that the so designed finite volume scheme has the expected stability properties and that its solution converges to the weak solution of the continuous problem. Numerical results show the increase of accuracy due to the use of this scheme, compared to some other schemes.     

Finite volume transport schemes

We analyze arbitrary order linear finite volume transport schemes and show asymptotic stability in L ¹ and L ^∞ for odd order schemes in dimension one. It gives sharp fractional order estimates of convergence for BV solutions. It shows odd order finite volume advection schemes are better than even order finite volume schemes. Therefore the Gibbs phenomena is controlled for odd order finite volume schemes. Numerical experiments sustain the theoretical analysis. In particular the oscillations of the Lax–Wendroff scheme for small Courant numbers are correlated with its non stability in L ¹. A scheme of order three is proved to be stable in L ¹ and L ^∞.     

Analysis of a BDF–DGFE scheme for nonlinear convection–diffusion problems

We deal with the numerical solution of a scalar nonstationary nonlinear convection–diffusion equation. We employ a combination of the discontinuous Galerkin finite element method for the space semi-discretization and the k-step backward difference formula for the time discretization. The diffusive and stabilization terms are treated implicitly whereas the nonlinear convective term is treated by a higher order explicit extrapolation method, which leads to the necessity to solve only a linear algebraic problem at each time step. We analyse this scheme and derive a priori asymptotic error estimates in the discrete L ^∞(L ²)-norm and the L ²(H ¹)-seminorm with respect to the mesh size h and time step τ for k = 2,3. Numerical examples verifying the theoretical results are presented. This work is a part of the research project MSM 0021620839 financed by the Ministry of Education of the Czech Republic and was partly supported by the Grant No. 316/2006/B-MAT/MFF of the Grant Agency of the Charles University Prague. The research of M. Vlasák was supported by the project LC06052 of the Ministry of Education of the Czech Republic (Jindřich Nečas Center for Mathematical Modelling).     

Finite volume schemes for nonhomogeneous scalar conservation laws: error estimate

Summary. In this paper, we study finite volume schemes for the nonhomogeneous scalar conservation law with initial condition . The source term may be either stiff or nonstiff. In both cases, we prove error estimates between the approximate solution given by a finite volume scheme (the scheme is totally explicit in the nonstiff case, semi-implicit in the stiff case) and the entropy solution. The order of these estimates is in space-time -norm (h denotes the size of the mesh). Furthermore, the error estimate does not depend on the stiffness of the source term in the stiff case. Received October 21, 1999 / Published online February 5, 2001     

A second-order accurate numerical method for a fractional wave equation

We study a generalized Crank–Nicolson scheme for the time discretization of a fractional wave equation, in combination with a space discretization by linear finite elements. The scheme uses a non-uniform grid in time to compensate for the singular behaviour of the exact solution at t = 0. With appropriate assumptions on the data and assuming that the spatial domain is convex or smooth, we show that the error is of order k ² + h ², where k and h are the parameters for the time and space meshes, respectively.     

One-sided stability and convergence of the Nessyahu–Tadmor scheme

Non-oscillatory schemes are widely used in numerical approximations of nonlinear conservation laws. The Nessyahu–Tadmor (NT) scheme is an example of a second order scheme that is both robust and simple. In this paper, we prove a new stability property of the NT scheme based on the standard minmod reconstruction in the case of a scalar strictly convex conservation law. This property is similar to the One-sided Lipschitz condition for first order schemes. Using this new stability, we derive the convergence of the NT scheme to the exact entropy solution without imposing any nonhomogeneous limitations on the method. We also derive an error estimate for monotone initial data.     

Convergence of an adaptive semi-Lagrangian scheme for the Vlasov-Poisson system

An adaptive semi-Lagrangian scheme for solving the Cauchy problem associated to the periodic 1+1-dimensional Vlasov-Poisson system in the two- dimensional phase space is proposed and analyzed. A key feature of our method is the accurate evolution of the adaptive mesh from one time step to the next one, based on a rigorous analysis of the local regularity and how it gets transported by the numerical flow. The accuracy of the scheme is monitored by a prescribed tolerance parameter ε which represents the local interpolation error at each time step, in the L ^∞ metric. The numerical solutions are proved to converge in L ^∞ towards the exact ones as ε and Δt tend to zero provided the initial data is Lipschitz and has a finite total curvature, or in other words, that it belongs to . The rate of convergence is , which should be compared to the results of Besse who recently established in (SIAM J Numer Anal 42(1):350–382, 2004) similar rates for a uniform semi-Lagrangian scheme, but requiring that the initial data are in . Several numerical tests illustrate the effectiveness of our approach for generating the optimal adaptive discretizations.     

Equilibrium attractivity of Krylov-W-methods for nonlinear stiff ODEs

Since implicit integration schemes for differential equations which use Krylov methods for the approximate solution of linear systems depend nonlinearly on the actual solution a classical stability analysis is difficult to perform. A different, weaker property of autonomous dissipative systemsy′=f(y) is that the norm ‖f(y(t))‖ decreases for any solutiony(t). This property can also be analysed for W-methods using a Krylov-Arnoldi approximation. We discuss different additional assumptions onf and conditions on the Arnoldi process that imply this kind of attractivity to equilibrium points for the numerical solution. One assumption is general enough to cover quasilinear parabolic problems. This work was supported by Deutsche Forschungsgemeinschaft.     

A convergent scheme for a non local Hamilton Jacobi equation modelling dislocation dynamics

We study dislocation dynamics with a level set point of view. The model we present here looks at the zero level set of the solution of a non local Hamilton Jacobi equation, as a dislocation in a plane of a crystal. The front has a normal speed, depending on the solution itself. We prove existence and uniqueness for short time in the set of continuous viscosity solutions. We also present a first order finite difference scheme for the corresponding level set formulation of the model. The scheme is based on monotone numerical Hamiltonian, proposed by Osher and Sethian. The non local character of the problem makes it not monotone. We obtain an explicit convergence rate of the approximate solution to the viscosity solution. We finally provide numerical simulations.This work has been supported by funds from ACI JC 1041 “Mouvements d’interfaces avec termes non-locaux”, from ACI-JC 1025 “Dynamique des dislocations” and from ONERA, Office National d’Etudes et de Recherches. The second author was also supported by the ENPC-Région Ile de France.     

An entropy satisfying MUSCL scheme for systems of conservation laws

Summary. For the high-order numerical approximation of hyperbolic systems of conservation laws, we propose to use as a building principle an entropy diminishing criterion instead of the familiar total variation diminishing criterion introduced by Harten for scalar equations. Based on this new criterion, we derive entropy diminishing projections that ensure, both, the second order of accuracy and all of the classical discrete entropy inequalities. The resulting scheme is a nonlinear version of the classical Van Leer's MUSCL scheme. Strong convergence of this second order, entropy satisfying scheme is proved for systems of two equations. Numerical tests demonstrate the interest of our theory. Received March 28, 1995 / Revised version received June 17, 1995     

Error growth analysis via stability regions for discretizations of initial value problems

This paper deals with numerical methods for the solution of linear initial value problems. Two main theorems are presented on the stability of these methods. Both theorems give conditions guaranteeing a mild error growth, for one-step methods characterized by a rational function ϕ(z). The conditions are related to the stability regionS={z:z∈ℂ with |ϕ(z)|≤1}, and can be viewed as variants to the resolvent condition occurring in the reputed Kreiss matrix theorem. Stability estimates are presented in terms of the number of time stepsn and the dimensions of the space. The first theorem gives a stability estimate which implies that errors in the numerical process cannot grow faster than linearly withs orn. It improves previous results in the literature where various restrictions were imposed onS and ϕ(z), including ϕ′(z)≠0 forz∈σS andS be bounded. The new theorem is not subject to any of these restrictions. The second theorem gives a sharper stability result under additional assumptions regarding the differential equation. This result implies that errors cannot grow faster thann ^β, with fixed β<1. The theory is illustrated in the numerical solution of an initial-boundary value problem for a partial differential equation, where the error growth is measured in the maximum norm.     

Continuous interior penalty finite element method for the time-dependent Navier–Stokes equations: space discretization and convergence

This paper focuses on the numerical analysis of a finite element method with stabilization for the unsteady incompressible Navier–Stokes equations. Incompressibility and convective effects are both stabilized adding an interior penalty term giving L ²-control of the jump of the gradient of the approximate solution over the internal faces. Using continuous equal-order finite elements for both velocities and pressures, in a space semi-discretized formulation, we prove convergence of the approximate solution. The error estimates hold irrespective of the Reynolds number, and hence also for the incompressible Euler equations, provided the exact solution is smooth.     

Entropy formulation for fractal conservation laws

Using an integral formula of Droniou and Imbert (2005) for the fractional Laplacian, we define an entropy formulation for fractal conservation laws with pure fractional diffusion of order λ ∈]0, 1]. This allows to show the existence and the uniqueness of a solution in the L^∞ framework. We also establish a result of controled speed of propagation that generalizes the finite propagation speed result of scalar conservation laws. We finally let the non-local term vanish to approximate solutions of scalar conservation laws, with optimal error estimates for BV initial conditions as Kuznecov (1976) for λ = 2 and Droniou (2003) for λ ∈]1, 2].     

<Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>-minimization methods for Hamilton–Jacobi equations: the one-dimensional case

A new approximation technique based on L ¹-minimization is introduced. It is proven that the approximate solution converges to the viscosity solution in the case of one-dimensional stationary Hamilton–Jacobi equation with convex Hamiltonian. This material is based upon work supported by the National Science Foundation grant DMS-0510650. J.-L. Guermond is on leave from LIMSI, UPRR 3251 CNRS, BP 133, 91403 Orsay Cedex, France.     

A stabilized semi-implicit Galerkin scheme for Navier-Stokes equations

By introducing a time relaxation term for the time derivative of higher frequency components, we proposed a stabilized semi-implicit Galerkin scheme for evolutionary Navier-Stokes equations in this paper. Analysis shows that such a scheme has weaker stability conditions than that of a classical semi-implicit Galerkin scheme and, when a suitable relaxation parameter σ is chosen, it generates an approximate solution with the same accuracy as the classical one. That means the proposed scheme might use a larger time step to generate a bounded approximate solution. Thus it is more suitable for long time simulations.