Related papers: Minimal Cubature rules and polynomial interpolatio…
A novel mathematical framework is derived for the addition of nodes to univariate and interpolatory quadrature rules. The framework is based on the geometrical interpretation of the Vandermonde matrix describing the relation between the…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
We study multivariate integration over the $s$-dimensional unit cube in a weighted space of infinitely differentiable functions. It is known from a recent result by Suzuki that there exists a good quasi-Monte Carlo (QMC) rule which achieves…
We extend the method of Ghasemi and Marshall [SIAM. J. Opt. 22(2) (2012), pp 460-473], to obtain a lower bound $f_{{\rm gp},M}$ for a multivariate polynomial $f(x) \in \mathbb{R}[x]$ of degree $ \le 2d$ in $n$ variables $x = (x_1,...,x_n)$…
A method for 3D interpolation between hard spheres is described. The function to be interpolated could be the charge density between atoms in condensed matter. Its electrostatic potential is found analytically, and so are various integrals.…
For the Gegenbauer weight function $w_{\lambda}(t)=(1-t^2)^{\lambda-1/2}$, $\lambda>-1/2$, we denote by $\Vert\cdot\Vert_{w_{\lambda}}$ the associated $L_2$-norm, $$ \Vert…
We establish the Gaussian Multi-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose $\mathbb{R}^n$ into $q$ cells of prescribed (positive) Gaussian measure when $2 \leq q \leq n+1$, is to use a "simplicial cluster",…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
We construct the Poincare polynomials for Landau-Ginzburg orbifolds with projection operators.Using them we show that special types of dualities including Poincare duality are realized under certain conditions. When Calabi-Yau…
The cubature on Wiener space method, a high-order weak approximation scheme, is established for SPDEs in the case of unbounded characteristics and unbounded payoffs. We first introduce a recently described flexible functional analytic…
We consider interpolation of univariate functions on arbitrary sets of nodes by Gaussian radial basis functions or by exponential functions. We derive closed-form expressions for the interpolation error based on the…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
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…
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…
We obtain new curvature estimates and Bernstein type results for minimal $n-$submanifolds in $\ir{n+m},\, m\ge 2$ under the condition that the rank of its Gauss map is at most 2. In particular, this applies to minimal surfaces in Euclidean…
We consider the type IIA string compactified on the Calabi-Yau space given by a degree 12 hypersurface in the weighted projective space ${\bf P}^4_{(1, 1, 2,2, 6)}$. We express the prepotential of the low-energy effective supergravity…
We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…
We prove the following proposition. Under linear interpolation on a Euclidean $n$-dimensional ball $B$, an interpolation projector whose nodes coincide with the vertices of a regular simplex inscribed into the boundary sphere has the…
In this paper, we study the optimal general convergence rates for quadratures derived from Chebyshev points. By building on the aliasing errors on integration of Chebyshev polynomials, together with the asymptotic formulae on the…