Related papers: A posteriori error analysis of round-off errors in…
We examine numerical rounding errors of some deterministic solvers for systems of ordinary differential equations (ODEs). We show that the accumulation of rounding errors results in a solution that is inherently random and we obtain the…
It is well known that the computation of accurate trajectories of the Lorenz system is a difficult problem. Computed solutions are very sensitive to the discretization error determined by the time step size and polynomial order of the…
Solving Linear Ordinary Differential Equations (ODEs) plays an important role in many applications. There are various numerical methods and solvers to obtain approximate solutions. However, few work about global error estimation can be…
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal…
In backward error analysis, an approximate solution to an equation is compared to the exact solution to a nearby modified equation. In numerical ordinary differential equations, the two agree up to any power of the step size. If the…
Inverse problems use physical measurements along with a computational model to estimate the parameters or state of a system of interest. Errors in measurements and uncertainties in the computational model lead to inaccurate estimates. This…
A posteriori error estimates are an important tool to bound discretization errors in terms of computable quantities avoiding regularity conditions that are often difficult to establish. For non-linear and non-differentiable problems,…
A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…
For the pure biharmonic equation and a biharmonic singular perturbation problem, a residual-based error estimator is introduced which applies to many existing nonconforming finite elements. The error estimator involves the local…
The study addresses the problem of precision in floating-point (FP) computations. A method for estimating the errors which affect intermediate and final results is proposed and a summary of many software simulations is discussed. The basic…
Probabilistic solvers for ordinary differential equations assign a posterior measure to the solution of an initial value problem. The joint covariance of this distribution provides an estimate of the (global) approximation error. The…
This work deals with the a posteriori error estimates for the Darcy-Forchheimer problem. We introduce the corresponding variational formulation and discretize it by using the finite-element method. A posteriori error estimate with two types…
We study error propagation in both an explicit and an implicit method for solving Volterra integro-differential equations. We determine the relationship between local and global errors. We derive upper bounds for the global error, and show…
In a general setting, we study a posteriori estimates used in finite element analysis to measure the error between a solution and its approximation. The latter is not necessarily generated by a finite element method. We show that the error…
We establish guaranteed and practically computable a posteriori error bounds for source problems and eigenvalue problems involving linear Schr{\"o}dinger operators with atom-centered potentials discretized with linear combinations of atomic…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
Floating-point round-off errors are ubiquitous in numerically intensive programs arising in fields such as scientific computing and optimization. As floating-point errors potentially lead to unexpected and catastrophic program failures, one…
Generalized polynomial chaos expansions are a powerful tool to study differential equations with random coefficients, allowing in particular to efficiently approximate random invariant sets associated to such equations. In this work, we use…
We present a hybrid a-priori/a-posteriori goal oriented error estimator for a combination of dynamic iteration-based solution of ordinary differential equations discretized by finite elements. Our novel error estimator combines estimates…
In a posteriori error analysis, the relationship between error and estimator is usually spoiled by so-called oscillation terms, which cannot be bounded by the error. In order to remedy, we devise a new approach where the oscillation has the…