Related papers: Optimal error bounds on the exponential integrator…
We prove sharp, computable error estimates for the propagation of errors in the numerical solution of ordinary differential equations. The new estimates extend previous estimates of the influence of data errors and discretisation errors…
This paper shows that error bounds can be used as effective tools for deriving complexity results for first-order descent methods in convex minimization. In a first stage, this objective led us to revisit the interplay between error bounds…
In this paper we obtain an approximation for the multivariate Laplace's integral with a large parameter and estimate error term for two cases, when the maximum of the exponent is in the interior of the domain and on the boundary. We are…
Error bounds, which refer to inequalities that bound the distance of vectors in a test set to a given set by a residual function, have proven to be extremely useful in analyzing the convergence rates of a host of iterative methods for…
We establish uniform error bounds of the L1 discretization of the Caputo derivative of H\"older continuous functions. The result can be understood as: error = (degree of smoothness - order of the derivative). We present an elementary proof…
Numerical multiscale methods usually rely on some coupling between a macroscopic and a microscopic model. The macroscopic model is incomplete as effective quantities, such as the homogenized material coefficients or fluxes, are missing in…
We consider the nonlinear Schr\"odinger equation with dispersion modulated by a (formal) derivative of a time-dependent function with fractional Sobolev regularity of class $W^{\alpha,2}$ for some $\alpha\in (0,1)$. Due to the loss of…
We study the problem of global extremum seeking in the presence of local extrema. We investigate two different perturbation-based methods: 1) a well-known classical extremum seeking scheme for steady-state output optimization, and 2) a…
We calculate the two-particle irreducible (2PI) effective potential of the O(N) linear sigma model in 1+1 dimensions. The approximations we use are the next-to-leading order of a 1/N expansion (for arbitrary N) and a kind of "resummed loop…
We establish the optimal convergence of solutions to integro-differential equations (IDEs) governed by symmetric integrodifferential $p$-L\'evy operators, $1 < p < \infty$, in the presence of nonlocal Dirichlet or Neumann boundary…
Many practical optimization problems lack strong convexity. Fortunately, recent studies have revealed that first-order algorithms also enjoy linear convergences under various weaker regularity conditions. While the relationship among…
This paper is devoted to the error analysis of a time-spectral algorithm for fractional diffusion problems of order $\alpha$ ($0 < \alpha < 1$). The solution regularity in the Sobolev space is revisited, and new regularity results in the…
The pseudo-potential method is applied to derive diverse propagating electron hole structures, in a nonthermal or $\kappa$ particle distribution function background. The associated distribution function Ansatz reproduces the Schamel…
Incremental gradient and incremental proximal methods are a fundamental class of optimization algorithms used for solving finite sum problems, broadly studied in the literature. Yet, without strong convexity, their convergence guarantees…
Error estimates for the numerical solution of the master equation are presented. Estimates are based on adjoint methods. We find that a good estimate can often be computed without spending computational effort on a dual problem. Estimates…
An initial-boundary value problem with a Caputo time derivative of fractional order $\alpha\in(0,1)$ is considered, solutions of which typically exhibit a singular behaviour at an initial time. For this problem, we give a simple framework…
A dispersive analysis of $\eta\to 3\pi$ decays has been performed in the past by many authors. The numerical analysis of the pertinent integral equations is hampered by two technical difficulties: i) The angular averages of the amplitudes…
In a recent paper~\cite{paper2}, we proposed the concept of optimal error bounds for an iterative process, which allows us to obtain the convergence result of the iterative sequence to the common fixed point of the nonexpansive mappings in…
We study the problem of exact sampling under an exponential communication cost, specifically Campbell's average codeword length $L(t)$ of order $t$, and R\'enyi's entropy. We provide a lower bound on the Campbell cost of exact sampling that…
We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…