A posteriori error estimates for upwind finite volume schemes for nonlinear conservation laws in multi dimensions

In this paper we shall derive a posteriori error estimates in the -norm for upwind finite volume schemes for the discretization of nonlinear conservation laws on unstructured grids in multi dimensions. This result is mainly based on some fundamental a priori error estimates published in a recent paper by C. Chainais-Hillairet. The theoretical results are confirmed by numerical experiments.

     

A posteriori error estimator for expanded mixed hybrid methods

In this article, we construct an a posteriori error estimator for expanded mixed hybrid finite‐element methods for second‐order elliptic problems. An a posteriori error analysis yields reliable and efficient estimate based on residuals. Several numerical examples are presented to show the effectivity of our error indicators. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 23: 330–349, 2007     

A posteriori error estimator competition for conforming obstacle problems

This article on the a posteriori error analysis of the obstacle problem with affine obstacles and Courant finite elements compares five classes of error estimates for accurate guaranteed error control. To treat interesting computational benchmarks, the first part extends the Braess methodology from 2005 of the resulting a posteriori error control to mixed inhomogeneous boundary conditions. The resulting guaranteed global upper bound involves some auxiliary partial differential equation and leads to four contributions with explicit constants. Their efficiency is examined affirmatively for five benchmark examples. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Discrete-time reduced-order estimator design for bilinear stochastic systems with error covariance assignment

This paper is concerned with the design of reduced-order stateestimators for bilinear stochastic discrete-time systems subjectedto estimation error covariance assignment. The purpose of theproblem addressed is to design the reduced-order state estimators for the bilinear stochastic discrete-time systems such thatthe steady-state estimation error covariances achieve the prespecified values. A simple, effective matrix inequality approach is developed to solve this problem. Specifically, (1) the parameterisationof estimation error covariances that certain bilinear errordynamic processes may possess is presented, (2) the characterisationof all reduced-order state estimators that assign such errorcovariances is explicitly derived, and (3) the solvabilityof the assignability conditions is discussed. Furthermore,an illustrative example is used to demonstrate the effectivenessof the proposed design procedure.     

A posteriori error estimation of the new mixed element schemes for second order elliptic problem on anisotropic meshes

This paper presents a posteriori residual error estimator for the new mixed element scheme for second order elliptic problem on anisotropic meshes. The reliability and efficiency of our estimator are established without any regularity assumption on the mesh.     

Derivation of explicit expressions for the error terms in the ordinary and the modified Romberg algorithms

It is proved that the error terms for both the ordinary and the modified Romberg algorithms may be expressed in terms of Bernoulli polynomials and their related periodic functions. The properties of the error terms may thus be described using the known properties of the Bernoulli polynomials and functions.On leave of absence from Kjeller Computer Installation, Norway     

An improved standardized time series Durbin–Watson variance estimator for steady-state simulation

We discuss an improved jackknifed Durbin–Watson estimator for the variance parameter from a steady-state simulation. The estimator is based on a combination of standardized time series area and Cramér–von Mises estimators. Various examples demonstrate its efficiency in terms of bias and variance compared to other estimators.     

One-leg variable-coefficient formulas for ordinary differential equations and local–global step size control

In this paper we discuss a class of numerical algorithms termed one-leg methods. This concept was introduced by Dahlquist in 1975 with the purpose of studying nonlinear stability properties of multistep methods for ordinary differential equations. Later, it was found out that these methods are themselves suitable for numerical integration because of good stability. Here, we investigate one-leg formulas on nonuniform grids. We prove that there exist zero-stable one-leg variable-coefficient methods at least up to order 11 and give examples of two-step methods of orders 2 and 3. In this paper we also develop local and global error estimation techniques for one-leg methods and implement them with the local–global step size selection suggested by Kulikov and Shindin in 1999. The goal of this error control is to obtain automatically numerical solutions for any reasonable accuracy set by the user. We show that the error control is more complicated in one-leg methods, especially when applied to stiff problems. Thus, we adapt our local–global step size selection strategy to one-leg methods.     

Stability and convergence of staggered Runge-Kutta schemes for semilinear wave equations

A staggered Runge-Kutta (staggered RK) scheme is a Runge-Kutta type scheme using a time staggered grid, as proposed by Ghrist et al. in 2000 [6]. Afterwards, Verwer in two papers investigated the efficiency of a scheme proposed by Ghrist et al. [6] for linear wave equations. We study stability and convergence properties of this scheme for semilinear wave equations. In particular, we prove convergence of a fully discrete scheme obtained by applying the staggered RK scheme to the MOL approximation of the equation.     

Error bounds for monotone approximation schemes for parabolic Hamilton-Jacobi-Bellman equations

We obtain nonsymmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton-Jacobi-Bellman equations by introducing a new notion of consistency. Our results are robust and general - they improve and extend earlier results by Krylov, Barles, and Jakobsen. We apply our general results to various schemes including Crank-Nicholson type finite difference schemes, splitting methods, and the classical approximation by piecewise constant controls. In the first two cases our results are new, and in the last two cases the results are obtained by a new method which we develop here.

     

Optimal error estimates of a locally one-dimensional method for the multidimensional heat equation

For the multidimensional heat equation in a parallelepiped, optimal error estimates inL ₂(Q) are derived. The error is of the order of +¦h¦² for any right-hand sidef L ₂(Q) and any initial function ; for appropriate classes of less regularf andu ₀, the error is of the order of ((+¦h¦² ), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996.     

An a posteriori error estimator for the Lame equation based on equilibrated fluxes

Katharina Witowski ^{We derive a new a posteriori error estimator for the Lamésystem based on H(div)-conforming elements and equilibratedfluxes. It is shown that the estimator gives rise to an upperbound where the constant is one up to higher-order terms. Thelower bound is also established using Argyris elements. Thereliability and efficiency of the proposed estimator are confirmedby some numerical tests.}     

An optimal‐order error estimate for MMOC and MMOCAA schemes for multidimensional advection‐reaction equations

In this article, we analyze the modified method of characteristics (MMOC) and an improved version of the MMOC, named the modified method of characteristics with adjusted advection (MMOCAA), for multidimensional advection‐reaction transport equations in a uniform manner. We derive an optimal‐order error estimate for these schemes. Numerical results are presented to verify the theoretical estimates. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 69–84, 2002     

Bandwidth choice for local polynomial estimation of smooth boundaries

Local polynomial methods hold considerable promise for boundary estimation, where they offer unmatched flexibility and adaptivity. Most rival techniques provide only a single order of approximation; local polynomial approaches allow any order desired. Their more conventional rivals, for example high-order kernel methods in the context of regression, do not have attractive versions in the case of boundary estimation. However, the adoption of local polynomial methods for boundary estimation is inhibited by lack of knowledge about their properties, in particular about the manner in which they are influenced by bandwidth; and by the absence of techniques for empirical bandwidth choice. In the present paper we detail the way in which bandwidth selection determines mean squared error of local polynomial boundary estimators, showing that it is substantially more complex than in regression settings. For example, asymptotic formulae for bias and variance contributions to mean squared error no longer decompose into monotone functions of bandwidth. Nevertheless, once these properties are understood, relatively simple empirical bandwidth selection methods can be developed. We suggest a new approach to both local and global bandwidth choice, and describe its properties.     

A priori error estimates for numerical methods for scalar conservation laws. part ii: flux-splitting monotone schemes on irregular Cartesian grids

This paper is the second of a series in which a general theory of a priori error estimates for scalar conservation laws is constructed. In this paper, we focus on how the lack of consistency introduced by the nonuniformity of the grids influences the convergence of flux-splitting monotone schemes to the entropy solution. We obtain the optimal rate of convergence of in for consistent schemes in arbitrary grids without the use of any regularity property of the approximate solution. We then extend this result to less consistent schemes, called consistent schemes, and prove that they converge to the entropy solution with the rate of in ; again, no regularity property of the approximate solution is used. Finally, we propose a new explanation of the fact that even inconsistent schemes converge with the rate of in . We show that this well-known supraconvergence phenomenon takes place because the consistency of the numerical flux and the fact that the scheme is written in conservation form allows the regularity properties of its approximate solution (total variation boundedness) to compensate for its lack of consistency; the nonlinear nature of the problem does not play any role in this mechanism. All the above results hold in the multidimensional case, provided the grids are Cartesian products of one-dimensional nonuniform grids.

     

An improved local branching approach for train formation planning

The train formation plan (TFP) determines routing and frequency of trains, and assigns the demands to trains. In this paper, an improved local branching algorithm is proposed for the TFP model in Iranian railway. This solution strategy is exact in nature, although it is designed to improve the heuristic behavior of the mixed integer programming (MIP) solver at hand. In the local branching algorithm, additional constraints are built in the model for the binary variables, but in the improved local branching algorithm, the additional constraints are built in the model for integer variables. A state-of-the-art method is applied for parameter tuning using design of experiments approach. To evaluate the proposed solution method, we have simulated and solved twenty test problems. The results show the efficiency and effectiveness of the proposed approach. The proposed algorithm is implemented for Iranian Railway network as a case study.     

Pointwise error estimates of the local discontinuous Galerkin method for a second order elliptic problem

In this paper we derive some pointwise error estimates for the local discontinuous Galerkin (LDG) method for solving second-order elliptic problems in (). Our results show that the pointwise errors of both the vector and scalar approximations of the LDG method are of the same order as those obtained in the norm except for a logarithmic factor when the piecewise linear functions are used in the finite element spaces. Moreover, due to the weighted norms in the bounds, these pointwise error estimates indicate that when at least piecewise quadratic polynomials are used in the finite element spaces, the errors at any point depend very weakly on the true solution and its derivatives in the regions far away from . These localized error estimates are similar to those obtained for the standard conforming finite element method.

     

A general mixed covolume framework for constructing conservative schemes for elliptic problems

We present a general framework for the finite volume or covolume schemes developed for second order elliptic problems in mixed form, i.e., written as first order systems. We connect these schemes to standard mixed finite element methods via a one-to-one transfer operator between trial and test spaces. In the nonsymmetric case (convection-diffusion equation) we show one-half order convergence rate for the flux variable which is approximated either by the lowest order Raviart-Thomas space or by its image in the space of discontinuous piecewise constants. In the symmetric case (diffusion equation) a first order convergence rate is obtained for both the state variable (e.g., concentration) and its flux. Numerical experiments are included.

     

A Monte Carlo algorithm for weighted integration over

We present and analyze a new randomized algorithm for numerical computation of weighted integrals over the unbounded domain . The algorithm and its desirable theoretical properties are derived based on certain stochastic assumptions about the integrands. It is easy to implement, enjoys convergence rate, and uses only standard random number generators. Numerical results are also included.