相关论文: The high-level error bound for shifted surface spl…
The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…
Using the polar decomposition of a bounded linear operator $A$ defined on a complex Hilbert space, we obtain several numerical radius inequalities of the operator $A$, which generalize and improve the earlier related ones. Among other…
In this paper, we consider the related problems of multicalibration -- a multigroup fairness notion and omniprediction -- a simultaneous loss minimization paradigm, both in the distributional and online settings. The recent work of Garg et…
We analyze univariate oscillatory integrals defined on the real line for functions from the standard Sobolev space $H^s({\mathbb{R}})$ and from the space $C^s({\mathbb{R}})$ with an arbitrary integer $s\ge1$. We find tight upper and lower…
We develop several Euclidean operator radius bounds for the product of two $d$-tuple operators using positivity criteria of a $2\times 2$ block matrix whose entries are $d$-tuple operators. From these bounds, by using the polar…
This paper presents the general equation to calculate the standard deviation of reflected ray error from optical error through geometry optics, applying the equation to calculate the standard deviation of reflected ray error for 8 kinds of…
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
A new generalization of multiquadric functions $\phi(x)=\sqrt{c^{2d}+||x||^{2d}}$, where $x\in\mathbb{R}^n$, $c\in \mathbb{R}$, $d\in \mathbb{N}$, is presented to increase the accuracy of quasi-interpolation further. With the restriction to…
We present a new iterative technique based on radial basis function (RBF) interpolation and smoothing for the generation and smoothing of curvilinear meshes from straight-sided or other curvilinear meshes. Our technique approximates the…
We prove interpolating estimates providing a bound for the oscillation of a function in terms of two $L^p$ norms of its gradient. They are based on a pointwise bound of a function on cones in terms of the Riesz potential of its gradient.…
In the era of big data, we first need to manage the data, which requires us to find missing data or predict the trend, so we need operations including interpolation and data fitting. Interpolation is a process to discover deducing new data…
This article presents a novel resolution to the problem of spline interpolation versus least-squares fitting on smooth Riemannian manifolds utilizing the method of gradient flows of networks. This approach represents a contribution to both…
This article pertains to interpolation of Sobolev functions at shrinking lattices $h\mathbb{Z}^d$ from $L_p$ shift-invariant spaces associated with cardinal functions related to general multiquadrics,…
Let $N(t)$ denote the eigenvalue counting funtion of the Laplacian on a compact surface of constant nonnegative curvature, with or without boundary. We define a refined asymptotic formula $\tilde{N}(t)=At+Bt^{1/2}+C$, where the constants…
In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…
In CAGD the design of a surface that interpolates an arbitrary quadrilateral mesh is definitely a challenging task. The basic requirement is to satisfy both criteria concerning the regularity of the surface and aesthetic concepts. With…
One-dimensional scattering problems are of wide physical interest and are encountered in many diverse applications. In this article I establish some very general bounds for reflection and transmission coefficients for one-dimensional…
An error bound for Gaussian Interpolation which is better than the current exponential-type error bound is presented.
The simplex method for linear programming is known to be highly efficient in practice, and understanding its performance from a theoretical perspective is an active research topic. The framework of smoothed analysis, first introduced by…
In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…