Related papers: An Improved Error Bound for Multiquadric and Inver…
The calculation of scattering amplitudes at higher orders in perturbation theory has reached a high degree of maturity. However, their usage to produce physical predictions within Monte Carlo programs is often precluded by the slow…
We focus on the estimating problem of the infinity norm of the inverse of Nekrasov matrices, give new bounds which involve a parameter, and then determine the optimal value of the parameter such that the new bounds are better than those in…
Inverse optimization, determining parameters of an optimization problem that render a given solution optimal, has received increasing attention in recent years. While significant inverse optimization literature exists for convex…
We examine regular and irregular repeat-accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, we give an upper bound on the decoding error probability of a…
A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…
Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…
For a simple model of mutually interacting qubits it is shown how the errors induced by mutual interactions can be eliminated using concatenated coding. The model is solved exactly for arbitrary interaction strength, for two well-known…
Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable…
We fix an error in the bound obtained in [13] for the crossing number of wrapped butterflies. The new bound finer than the one provided earlier.
Caire, Taricco and Biglieri presented a detailed analysis of bit interleaved coded modulation, a simple and popular technique used to improve system performance, especially in the context of fading channels. They derived an upper bound to…
We analyze the effects of rounding errors in the nodes on barycentric interpolation. These errors are particularly relevant for the first barycentric formula with the Chebyshev points of the second kind. Here, we propose a method for…
We analyse the forward error in the floating point summation of real numbers, from algorithms that do not require recourse to higher precision or better hardware. We derive informative explicit expressions, and new deterministic and…
A priori error bounds have been derived for different balancing-related model reduction methods. The most classical result is a bound for balanced truncation and singular perturbation approximation that is applicable for asymptotically…
This paper computationally obtains optimal bounded-weight, binary, error-correcting codes for a variety of distance bounds and dimensions. We compare the sizes of our codes to the sizes of optimal constant-weight, binary, error-correcting…
Recent work showed that there could be a large gap between the classical uniform convergence bound and the actual test error of zero-training-error predictors (interpolators) such as deep neural networks. To better understand this gap, we…
For nonautonomous, nonuniformly elliptic integrals with so-called $(p,q)$-growth conditions, we show a general interpolation property allowing to get basic higher integrability results for H\"older continuous minimizers under improved…
An extension of sinc interpolation on $\mathbb{R}$ to the class of algebraically decaying functions is developed in the paper. Similarly to the classical sinc interpolation we establish two types of error estimates. First covers a wider…
Certain excess versions of the Minkowski and H\"older inequalities are given. These new results generalize and improve the Minkowski and H\"older inequalities.
In this paper, we first establish the convergence criteria of the residual iteration method for solving quadratic eigenvalue problem- s. We analyze the impact of shift point and the subspace expansion on the convergence of this method. In…
Quadratic permutation polynomial interleavers over integer rings have recently received attention in practical turbo coding systems from deep space applications to mobile communications. In this correspondence, a necessary and sufficient…