Related papers: An Improved Error Bound for Multiquadric and Inver…
We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
Recovery type a posteriori error estimators are popular, particularly in the engineering community, for their computationally inexpensive, easy to implement, and generally asymptotically exactness. Unlike the residual type error estimators,…
The implicit boundary integral method (IBIM) provides a framework to construct quadrature rules on regular lattices for integrals over irregular domain boundaries. This work provides a systematic error analysis for IBIMs on uniform…
This paper undertakes a thorough investigation of matrix means interpolation and comparison. We expand the parameter $\vartheta$ beyond the closed interval $[0,1]$ to cover the entire positive real line, denoted as $\mathbb{R}^+$.…
Inner and outer bounds are derived on the optimal performance of fixed length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First an inner bound is derived using a two phase encoding scheme with…
A new generalization of shifted thin plate splines $$\varphi(x)=(c^{2d}+||x||^{2d})\log\left(c^{2d}+||x||^{2d}\right),\qquad x\in\mathbb{R}^n, d\in \mathbb{N}, c>0$$ is presented to increase the accuracy of quasi-interpolation further. With…
Error bound analysis, which estimates the distance of a point to the solution set of an optimization problem using the optimality residual, is a powerful tool for the analysis of first-order optimization algorithms. In this paper, we use…
Error bounds based on worst likely assignments use permutation tests to validate classifiers. Worst likely assignments can produce effective bounds even for data sets with 100 or fewer training examples. This paper introduces a statistic…
Motivated, roughly, by comparing the mean and median of an IID sum of bounded lattice random variables, we develop explicit and effective bounds on the errors involved in the one-term Edgeworth expansion for such sums.
In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.
In this note, we improve Nikulin's inequality in the case of right-angled hyperbolic polyhedra. The new inequality allows to give much shorter proofs of the known dimension bounds. We also improve Nonaka's lower bound on the number of ideal…
This letter derives some new exponential bounds for discrete time, real valued, conditionally symmetric martingales with bounded jumps. The new bounds are extended to conditionally symmetric sub/ supermartingales, and they are compared to…
Following a recent paper by N. Mandache (Inverse Problems 17 (2001), pp. 1435-1444), we establish a general procedure for determining the instability character of inverse problems. We apply this procedure to many elliptic inverse problems…
In this study, the standard IEEE 754 2008 and modulo-based floor functions for rounding non-integers have been presented. Their effects on the accuracy of the bilinear interpolation algorithm have been demonstrated. The improved floor uses…
For exponents in the subcritical range, we revisit some optimal interpolation inequalities on the sphere with carr\'e du champ methods and use the remainder terms to produce improved inequalities. The method provides us with lower estimates…
We are interested in an inverse medium problem with internal data. This problem is originated from multi-waves imaging. We aim in the present work to study the well-posedness of the inversion in terms of the boundary conditions. We…
This paper deals with the error analysis of the trapezoidal rule for the computation of Fourier type integrals, based on two double exponential transformations. The theory allows to construct algorithms in which the steplength and the…
The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…
In this paper, we consider an initial boundary value problem for Maxwell's equations. For this hyperbolic type problem, we derive guaranteed and computable upper bounds for the difference between the exact solution and any pair of vector…