Related papers: An Improved Error Bound for Multiquadric and Inver…
We propose an adaptive moment-matching framework for model order reduction of quadratic-bilinear descriptor systems. In this framework, an important issue is the selection of those shift frequencies where moment-matching is to be achieved.…
New error bounds for the linear complementarity problems are given respectively when the involved matrices are Nekrasov matrices and B-Nekrasov matrices. Numerical examples are given to show that new bounds are better respectively than…
We give an improved lower bound for the error of any quadrature computing $\int_{-1}^1 f(x) d\alpha(x)$ of analytic functions bounded in the neighborhood of $[-1,1]$.
New upper and lower bounds for the error probability over an erasure channel are provided, making use of Wei's generalized weights, hierarchy and spectra. In many situations the upper and lower bounds coincide and this allows improvement of…
We show that a recent interpolative new proof of the Bohnenblust--Hille inequality, when suitably handled, recovers its best known constants. This seems to be unexpectedly surprising since the known interpolative approaches only provide…
The most critical component of any adaptive numerical quadrature routine is the estimation of the integration error. Since the publication of the first algorithms in the 1960s, many error estimation schemes have been presented, evaluated…
This paper has been withdrawn by the author becouse the conjecture presented in this paper is false. The correct study of metrics in interpolation spaces for and applcation to nonharmonic Fourier series will be published in S.Petersburg…
Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…
This paper investigates an error covariance matrix splitting technique for multiuser multiple input and multiple output (MIMO) interference downlink channel. Most of the related work has thus far considered the traditional error covariance…
This work is devoted to the study of integration with respect to binomial measures. We develop interpolatory quadrature rules and study their properties. Local error estimates for these rules are derived in a general framework.
We adapt Schaback's error doubling trick [R. Schaback. Improved error bounds for scattered data interpolation by radial basis functions. Math. Comp., 68(225):201--216, 1999.] to give error estimates for radial interpolation of functions…
Lower a posteriori error bounds obtained using the standard bubble function approach are reviewed in the context of anisotropic meshes. A numerical example is given that clearly demonstrates that the short-edge jump residual terms in such…
The double exponential formula was introduced for calculating definite integrals with singular point oscillation functions and Fourier integral. The double exponential transformation is not only useful for numerical computations but it is…
We derive error estimates for a linear-quadratic elliptic distributed optimal control problem with pointwise control constraints that can be applied to standard finite element methods and multiscale finite element methods.
The double exponential formula was introduced for calculating definite integrals with singular point oscillation functions and Fourier-integrals. The double exponential transformation is not only useful for numerical computations but it is…
Motivated by problems in contact mechanics, we propose a duality approach for computing approximations and associated a posteriori error bounds to solutions of variational inequalities of the first kind. The proposed approach improves upon…
Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that…
In this paper we study the algebraic structure of error formulas for ideal interpolation. We introduce the so-called "normal" error formulas and prove that the lexicographic order reduced Gr\"obner basis admits such a formula for all ideal…
We give a lower bound on the probability of error in quantum state discrimination. The bound is a weighted sum of the pairwise fidelities of the states to be distinguished.
Various algebraic multigrid algorithms have been developed for solving problems in scientific and engineering computation over the past decades. They have been shown to be well-suited for solving discretized partial differential equations…