Related papers: On Estimating Machine-Zero Residual
We develop the method of Maximum Entropy (ME) as a technique to generate approximations to probability distributions. The central results consist in (a) justifying the use of relative entropy as the uniquely natural criterion to select a…
The present paper proposes an inf-sup stable divergence free virtual element method and associated a priori, and a posteriori error analysis to approximate the eigenvalues and eigenfunctions of the Stokes spectral problem in one shot. For…
In this paper, a simulation-based method for the analysis and design of abstracted models for a stochastic hybrid system is proposed. The accuracy of a model is evaluated in terms of its capability to reproduce the system output for all the…
We consider initial value problems of nonlinear dynamical systems, which include physical parameters. A quantity of interest depending on the solution is observed. A discretisation yields the trajectories of the quantity of interest in many…
Least squares estimation, a regression technique based on minimisation of residuals, has been invaluable in bringing the best fit solutions to parameters in science and engineering. However, in dynamic environments such as in Geomatics…
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,…
The aim of this work is to analyze the finite element approximation of the two-dimensional stationary Navier-Stokes equations with non-smooth Dirichlet boundary data. The discrete approximation is obtained by considering the Navier-Stokes…
In this paper, we describe a framework to compute expected convergence rates for residuals based on the Calder\'on identities for general second order differential operators for which fundamental solutions are known. The idea is that these…
We compute the integral of a function or the expectation of a random variable with minimal cost and use, for our new algorithm and for upper bounds of the complexity, i.i.d. samples. Under certain assumptions it is possible to select a…
We adapt a previously introduced continuous in time data assimilation (downscaling) algorithm for the 2D Navier-Stokes equations to the more realistic case when the measurements are obtained discretely in time and may be contaminated by…
Optimal damping aims at determining a vector of damping coefficients $\nu$ that maximizes the decay rate of a mechanical system's response. This problem can be formulated as the minimization of the trace of the solution of a Lyapunov…
The finite element method can be viewed as a machine that automates the discretization of differential equations, taking as input a variational problem, a finite element and a mesh, and producing as output a system of discrete equations.…
In this paper we study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximal-projection method…
The goal of this paper is to study convergence and error estimates of the Monte Carlo method for the Navier-Stokes equations with random data. To discretize in space and time, the Monte Carlo method is combined with a suitable deterministic…
Reduced-order modeling is an efficient approach for solving parameterized discrete partial differential equations when the solution is needed at many parameter values. An offline step approximates the solution space and an online step…
This work is concerned with quasi-optimal a-priori finite element error estimates for the obstacle problem in the $L^2$-norm. The discrete approximations are introduced as solutions to a finite element discretization of an accordingly…
We consider elliptic variational inequalities generated by obstacle type problems with thin obstacles. For this class of problems, we deduce estimates of the distance (measured in terms of the natural energy norm) between the exact solution…
Consider the problem of estimating the median of N items to a precision epsilon, i.e., the estimate should be such that, with a high probability, the number of items, with values both smaller than and larger than this estimate, is less than…
We develop a stochastic approximation-type algorithm to solve finite state/action, infinite-horizon, risk-aware Markov decision processes. Our algorithm has two loops. The inner loop computes the risk by solving a stochastic saddle-point…
We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…