Related papers: Note on Error Bound for Trace Approximation of Pro…
In this paper a spline based integral approximation is utilized to propose a sequence of approximations to the error function that converge at a significantly faster manner than the default Taylor series. The approximations can be improved…
We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…
We consider a sequence of composite Bernstein operators and the quadrature formulae associated with them. Upper bounds for the approximation error of continuous functions and for the approximation of integrals of continuous functions are…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
We study the approximation of stationary processes by a simple class of purely deterministic signals. This has an analytic counterpart in the approximation of symmetric positive definite Toeplitz matrices by submatrices of finite rank. We…
Gromov's Lipschitz order is an order relation on the set of metric measure spaces. One of the compactifications of the space of isomorphism classes of metric measure spaces equipped with the concentration topology is constructed by using…
Many problems in computer science and applied mathematics require rounding a vector $\mathbf{w}$ of fractional values lying in the interval $[0,1]$ to a binary vector $\mathbf{x}$ so that, for a given matrix $\mathbf{A}$,…
The unconstrained minimization of a sufficiently smooth objective function $f(x)$ is considered, for which derivatives up to order $p$, $p\geq 2$, are assumed to be available. An adaptive regularization algorithm is proposed that uses…
In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…
For some kernel matrices, low-rank approximations can be quickly obtained via analytic techniques. One important class of analytic methods that has received attention in recent years is based on the use of proxy points. Accuracy analysis…
The paper examines local approximation errors of finite difference schemes in electromagnetic analysis. Despite a long history of the subject, several accuracy-related issues have been overlooked and/or remain controversial. For example,…
Based on two point spline approximations of arbitrary order, a series of functions that define lower bounds for sin(x) and sin(x)/x, over the interval [0,Pi/2], with increasingly low relative errors and smaller relative errors than…
We propose a posteriori error estimators for classical low-order inf-sup stable and stabilized finite element approximations of the Stokes problem with singular sources in two and three dimensional Lipschitz, but not necessarily convex,…
The error bound property for a solution set defined by a set-valued mapping refers to an inequality that bounds the distance between vectors closed to a solution of the given set by a residual function. The error bound property is a…
We introduce an infinite family of approximations for a Dirichlet $L$-function $L(s, \chi)$ arising from truncated Euler products. These approximations are entire functions and satisfy the same functional equation as $L(s, \chi)$. We…
The stories told in this paper are dealing with the solution of finite, infinite, and biinfinite Toeplitz-type systems. A crucial role plays the off-diagonal decay behavior of Toeplitz matrices and their inverses. Classical results of…
Explicit pointwise error bounds for the interpolation of a smooth function by piecewise exponential splines of order four are given. Estimates known for cubic splines are extended to a natural class of piecewise exponential splines which…
We prove lower bounds for the approximation error of the variation-diminishing Schoenberg operator on the interval $[0,1]$ in terms of classical moduli of smoothness depending on the degree of the spline basis using a functional analysis…
For conforming finite element approximations of the Laplacian eigenfunctions, a fully computable guaranteed error bound in the $L^2$ norm sense is proposed. The bound is based on the a priori error estimate for the Galerkin projection of…
Prior recent work, devoted to the study of polynomial Krylov techniques for the approximation of the action of the matrix exponential ${\rm e}^{tA}v$, is extended to the case of associated $\varphi$-functions (which occur within the class…