BVPs on infinite intervals: A test problem,a nonstandard finite difference scheme and a posteriori error estimator

As far as the numerical solution of boundary value problems defined on an infinite interval is concerned, in this paper, we present a test problem for which the exact solution is known. Then we study an a posteriori estimator for the global error of a nonstandard finite difference scheme previously introduced by the authors. In particular, we show how Richardson extrapolation can be used to improve the numerical solution using the order of accuracy and numerical solutions from 2 nested quasi‐uniform grids. We observe that if the grids are sufficiently fine, the Richardson error estimate gives an upper bound of the global error.     

Global robust synchronization for time-varying phase mismatching electro-mechanical gyrostat systems under variable substitution control

A master–slave scheme for global robust synchronization of two electro-mechanical gyrostat systems with time-varying phase mismatches under variable substitution control is presented in this paper. Under this scheme, a sufficient criterion for the global robust synchronization with bounded error is rigorously proved in the form of matrix inequality and the corresponding estimated error bound is mathematically given. On the basis of the criterion, further derivation brings some simple and optimized algebraic criteria for various single-variable coupling, whose performance is then verified through some numerical examples.     

A rational approximate solution for generalized pantograph‐delay differential equations

In this paper, a new rational approximation based on a rational interpolation and collocation method is proposed for the solutions of generalized pantograph equations. A comprehensive error analysis is provided. The first part of the error analysis gives an upper bound for the absolute error. The second part is based on residual error procedure that estimates the absolute error. Some numerical examples are given to illustrate the method. The theoretical results support the numerical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Global error bound for convex inclusion problems

The existence of global error bound for convex inclusion problems is discussed in this paper, including pointwise global error bound and uniform global error bound. The existence of uniform global error bound has been carefully studied in Burke and Tseng (SIAM J. Optim. 6(2), 265–282, 1996) which unifies and extends many existing results. Our results on the uniform global error bound (see Theorem 3.2) generalize Theorem 9 in Burke and Tseng (1996) by weakening the constraint qualification and by widening the varying range of the parameter. As an application, the existence of global error bound for convex multifunctions is also discussed.     

New error bound for linear complementarity problems for B-matrices

A new error bound for the linear complementarity problem is obtained when the involved matrix is a B-matrix. This bound improves existing results. Finally, two numerical examples are also given to show that the bound is better than some previous results.     

A posteriori error estimates of stabilized finite volume method for the Stokes equations

In this work, the residual‐type posteriori error estimates of stabilized finite volume method are studied for the steady Stokes problem based on two local Gauss integrations. By using the residuals between the source term and numerical solutions, the computable global upper and local lower bounds for the errors of velocity in H¹ norm and pressure in L² norm are derived. Furthermore, a global upper bound of u ? u_h in L²‐norm is also derived. Finally, some numerical experiments are provided to verify the performances of the established error estimators. Copyright © 2015 John Wiley & Sons, Ltd.     

Error bounds for convex differentiable inequality systems in Banach spaces

The paper is devoted to studying the Hoffman global error bound for convex quadratic/affine inequality/equality systems in the context of Banach spaces. We prove that the global error bound holds if the Hoffman local error bound is satisfied for each subsystem at some point of the solution set of the system under consideration. This result is applied to establishing the equivalence between the Hoffman error bound and the Abadie qualification condition, as well as a general version of Wang &; Pang's result [30], on error bound of Hölderian type. The results in the present paper generalize and unify recent works by Luo &; Luo in [17], Li in [16] and Wang &; Pang in [30].     

A posteriori error estimation for convection dominated problems on anisotropic meshes

A singularly perturbed convection–diffusion problem in two and three space dimensions is discretized using the streamline upwind Petrov Galerkin (SUPG) variant of the finite element method. The dominant convection frequently gives rise to solutions with layers; hence anisotropic finite elements can be applied advantageously. The main focus is on a posteriori energy norm error estimation that is robust in the perturbation parameter and with respect to the mesh anisotropy. A residual error estimator and a local problem error estimator are proposed and investigated. The analysis reveals that the upper error bound depends on the alignment of the anisotropies of the mesh and of the solution. Hence reliable error estimation is possible for suitable anisotropic meshes. The lower error bound depends on the problem data via a local mesh Peclet number. Thus efficient error estimation is achieved for small mesh Peclet numbers. Altogether, error estimation approaches for isotropic meshes are successfully extended to anisotropic elements. Several numerical experiments support the analysis. Copyright © 2003 John Wiley & Sons, Ltd.     

Efficient error control in numerical integration of ordinary differential equations and optimal interpolating variable-stepsize peer methods

Automatic global error control of numerical schemes is examined. A new approach to this problem is presented. Namely, the problem is reformulated so that the global error is controlled by the numerical method itself rather than by the user. This makes it possible to find numerical solutions satisfying various accuracy requirements in a single run, which so far was considered unrealistic. On the other hand, the asymptotic equality of local and global errors, which is the basic condition of the new method for efficiently controlling the global error, leads to the concept of double quasi-consistency. This requirement cannot be satisfied within the classical families of numerical methods. However, the recently proposed peer methods include schemes with this property. There exist computational procedures based on these methods and polynomial interpolation of fairly high degree that find the numerical solution in a single run. If the integration stepsize is sufficiently small, the error of this solution does not exceed the prescribed tolerance. The theoretical conclusions of this paper are supported by the numerical results obtained for test problems with known solutions.     

Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification

A global error bound is given on the distance between an arbitrary point in then-dimensional real spaceR ⁿ and its projection on a nonempty convex set determined bym convex, possibly nondifferentiable, inequalities. The bound is in terms of a natural residual that measures the violations of the inequalities multiplied by a new simple condition constant that embodies a single strong Slater constraint qualification (CQ) which implies the ordinary Slater CQ. A very simple bound on the distance to the projection relative to the distance to a point satisfying the ordinary Slater CQ is given first and then used to derive the principal global error bound. This material is based on research supported by National Science Foundation Grant CCR-9322479 and Air Force Office of Scientific Research grant F49620-97-1-0326.     

A new a posteriori error estimate for convection–reaction–diffusion problems

A new a posteriori error estimate is derived for the stationary convection–reaction–diffusion equation. In order to estimate the approximation error in the usual energy norm, the underlying bilinear form is decomposed into a computable integral and two other terms which can be estimated from above using elementary tools of functional analysis. Two auxiliary parameter-functions are introduced to construct such a splitting and tune the resulting bound. If these functions are chosen in an optimal way, the exact energy norm of the error is recovered, which proves that the estimate is sharp. The presented methodology is completely independent of the numerical technique used to compute the approximate solution. In particular, it is applicable to approximations which fail to satisfy the Galerkin orthogonality, e.g. due to an inconsistent stabilization, flux limiting, low-order quadrature rules, round-off and iteration errors, etc. Moreover, the only constant that appears in the proposed error estimate is global and stems from the Friedrichs–Poincaré inequality. Numerical experiments illustrate the potential of the proposed error estimation technique.     

A sharp upper bound on the spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain an upper bound on the spectral radius of the adjacency matrix and characterize graphs for which the bound is attained.     

Robust a posteriori error estimation for the nonconforming Fortin-Soulie finite element approximation

We obtain a computable a posteriori error bound on the broken energy norm of the error in the Fortin-Soulie finite element approximation of a linear second order elliptic problem with variable permeability. This bound is shown to be efficient in the sense that it also provides a lower bound for the broken energy norm of the error up to a constant and higher order data oscillation terms. The estimator is completely free of unknown constants and provides a guaranteed numerical bound on the error.

     

Adaptive meshless Galerkin boundary node methods for hypersingular integral equations

Adaptive refinement techniques are developed in this paper for the meshless Galerkin boundary node method for hypersingular boundary integral equations. Two types of error estimators are derived. One is a perturbation error estimator that is formulated based on the difference between numerical solutions obtained using two consecutive nodal arrangements. The other is a projection error estimator that is formulated based on the difference between the numerical solution itself and its projection. These error estimators are proven to have an upper and a lower bound by the constant multiples of the exact error in the energy norm. A localization scheme is presented to accomodate the non-local property of hypersingular integral operators for the needed computable local error indicators. The convergence of the adaptive meshless techniques is verified theoretically. To confirm the theoretical results and to show the efficiency of the adaptive techniques, numerical examples in 2D and 3D with high singularities are provided.     

A posteriori H1 error estimation for a singularly perturbed reaction diffusion problem on anisotropic meshes

The paper deals with a singularly perturbed reaction diffusionmodel problem. The focus is on reliable a posteriori error estimatorsfor the H¹ seminorm that can be applied to anisotropic finiteelement meshes. A residual error estimator and a local problemerror estimator are proposed and rigorously analysed. They arelocally equivalent, and both bound the error reliably. Threemodifications of these estimators are introduced and discussed. Much attention is given to the performance of the error estimatorin numerical experiments. This helps to identify those estimatorsthat are suitable for practical applications.     

A Shishkin mesh for a singularly perturbed Riccati equation

In this paper a singularly perturbed Riccati initial value problem is examined. Parameter explicit bounds on the solution and its derivatives are given. A numerical method composed of an implicit difference operator and a piecewise-uniform Shishkin mesh is constructed. A theoretical parameter independently bound on the errors in the numerical approximations is established. Numerical results are presented which are in agreement with the theoretical error bound.     

QMC Rules of Arbitrary High Order: Reproducing Kernel Hilbert Space Approach

In this paper we consider numerical integration of smooth functions lying in a particular reproducing kernel Hilbert space. We show that the worst-case error of numerical integration in this space converges at the optimal rate, up to some power of a log?N factor. A similar result is shown for the mean square worst-case error, where the bound for the latter is always better than the bound for the square worst-case error. Finally, bounds for integration errors of functions lying in the reproducing kernel Hilbert space are given. The paper concludes by illustrating the theory with numerical results.     

Asymptotic bounds for the expected L error of a multivariate kernel density estimator

The kernel estimator of a multivariate probability density function is studied. An asymptotic upper bound for the expected L¹ error of the estimator is derived. An asymptotic lower bound result and a formula for the exact asymptotic error are also given. The goodness of the smoothing parameter value derived by minimizing an explicit upper bound is examined in numerical simulations that consist of two different experiments. First, the L¹ error is estimated using numerical integration and, second, the effect of the choice of the smoothing parameter in discrimination tasks is studied.     

Absolute Error Estimators by Equilibrated Tractions in the FEM for Linear and Finite Elasticity

In this contribution, adaptive finite element methods are presented based on the approximation of large‐ and smallstrain elasticity. Upper bound residual global and local a posteriori error estimators without interpolation constants are derived by solving auxiliary local Neumann problems with equilibrated tractions. Illustrative examples show the numerical and physical features of the presented methodology.     

Extremal graph characterization from the bounds of the spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. The eigenvalues of a graph are the eigenvalues of its adjacency matrix. We obtain a lower bound and an upper bound on the spectral radius of the adjacency matrix of weighted graphs and characterize graphs for which the bounds are attained.