Related papers: End-point corrections for the midpoint rule
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
We propose the numerical methods for solution of the weakly regular linear and nonlinear evolutionary (Volterra) integral equation of the first kind. The kernels of such equations have jump discontinuities along the continuous curves…
We present new tight bounds for averaging differential inclusions, which we apply to multi-frequency inclusions consisting of a sum of time periodic set-valued mappings. For this family of inclusions we establish an a tight estimate of…
In this paper, we derive new estimates for the remainder term of the midpoint, trapezoid, and Simpson formulae for functions whose derivatives in absolute value at certain power are quasi-convex. Some applications to special means of real…
This paper presents a practical writing/reading scheme in nonvolatile memories, called balanced modulation, for minimizing the asymmetric component of errors. The main idea is to encode data using a balanced error-correcting code. When…
We introduce new efficient integral representations and methods for evaluation of pdfs, cpds and quantiles of stable distributions. For wide regions in the parameter space, absolute errors of order $10^{-15}$ can be achieved in 0.005-0.1…
Using typical solution strategies to compute the solution curve of challenging problems often leads to the break down of the algorithm. To improve the solution process, numerical continuation methods have proved to be a very efficient tool.…
The concept of asymptotically nonexpansive mappings is an important generalization of the class of nonexpansive mappings. Implicit midpoint procedures are extremely fundamental for solving equations involving nonlinear operators. This paper…
We derive formulas for the efficiency correction of cumulants with many efficiency bins. The derivation of the formulas is simpler than the previously suggested method, but the numerical cost is drastically reduced from the naive method.…
We derive a numerical method, based on operator splitting, to abstract parabolic semilinear boundary coupled systems. The method decouples the linear components which describe the coupling and the dynamics in the bulk and on the surface,…
This work continues the study of linear error correcting codes against adversarial insertion deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and Li \cite{CGHL21} showed the existence of asymptotically…
A novel linear integration rule called $\textit{control neighbors}$ is proposed in which nearest neighbor estimates act as control variates to speed up the convergence rate of the Monte Carlo procedure on metric spaces. The main result is…
For scientific computations on a digital computer the set of real number is usually approximated by a finite set F of "floating-point" numbers. We compare the numerical accuracy possible with difference choices of F having approximately the…
We show how to increase the accuracy of estimates of the two-point correlation function without sacrificing efficiency. We quantify the error of the pair-counts and of the Landy-Szalay estimator by comparing them with exact reference…
Optimal balance is a non-asymptotic numerical method to compute a point on the slow manifold for certain two-scale dynamical systems. It works by solving a modified version of the system as a boundary value problem in time, where the…
The machine learning explosion has created a prominent trend in modern computer hardware towards low precision floating-point operations. In response, there have been growing efforts to use low and mixed precision in general scientific…
Through introducing a new iterative formula for divided differnce using Neville's and Aitken's algorithms,we study new iterative methods for interpolation,numerical differentiation and numerical integration formulas with arbitrary order of…
We consider Proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global…
We propose new local error estimators for splitting and composition methods. They are based on the construction of lower order schemes obtained at each step as a linear combination of the intermediate stages of the integrator, so that the…
The scheme of divided differences is widely used in many approximation and interpolation problems. Computing the Newton coefficients of the interpolating polynomial is the first step of the Bj\"{o}rck and Pereyra algorithm for solving…