Related papers: Minimal Cubature rules and polynomial interpolatio…
In this paper we obtain $L^1$-weighted norms of classical orthogonal polynomials (Hermite, Laguerre and Jacobi polynomials) in terms of the zeros of these orthogonal polynomials; these expressions are usually known as quadrature rules. In…
When integrating functions that have poles outside the interval of integration, but are regular otherwise, it is suggested that the quadrature rule in question ought to integrate exactly not only polynomials (if any), but also suitable…
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…
Given a nondecreasing function $f$ on $[-1,1]$, we investigate how well it can be approximated by nondecreasing algebraic polynomials that interpolate it at $\pm 1$. We establish pointwise estimates of the approximation error by such…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
Discrete orthogonality relations for Hall-Littlewood polynomials are employed, so as to derive cubature rules for the integration of homogeneous symmetric functions with respect to the density of the circular unitary ensemble (which…
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs)…
Motivated by an application in Magnetic Particle Imaging, we study bivariate Lagrange interpolation at the node points of Lissajous curves. The resulting theory is a generalization of the polynomial interpolation theory developed for a node…
We provide explicit expressions for quadrature rules on the space of $C^1$ quintic splines with uniform knot sequences over finite domains. The quadrature nodes and weights are derived via an explicit recursion that avoids an intervention…
In this paper, we study how to quickly compute the <-minimal monomial interpolating basis for a multivariate polynomial interpolation problem. We address the notion of "reverse" reduced basis of linearly independent polynomials and design…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
Let $\mu$ be a positive Borel measure on the real line and let $L$ be the linear functional on univariate polynomials of bounded degree, defined as integration with respect to $\mu$. In 2020, Blekherman et al., the characterization of all…
We consider a sequence of composite bivariate Bernstein operators and the cubature formula associated with them. The upper bounds for the remainder term of the cubature formula are described in terms of moduli of continuity of order two.…
For a division ring $\mathbb F$, the polynomials $f\in\mathbb F$ can be evaluated "on the left" and "on the right" giving rise to left and right Lagrange interpolation problems. The problems containig interpolation conditions of the same…
After introducing the definitions of positive, negative and companion rules, from a given pair of companion rules we construct a new rule with higher degree of precision The scheme is generalized giving rise to a transformation which we…
Gravitational observables for binary systems exhibit a simple polynomial dependence on the masses $m_1$, $m_2$ of the two scattering objects when they are written in terms of the appropriate kinematic variables in the post-Minkowskian (PM)…
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…
In this paper we analyze the approximation of multivariate integrals over the Euclidean plane for functions which are analytic. We show explicit upper bounds which attain the exponential rate of convergence. We use an infinite grid with…
In this contribution we deal with Gaussian quadrature rules based on orthogonal polynomials associated with a weight function $w(x)= x^{\alpha} e^{-x}$ supported on an interval $(0,z)$, $z>0.$ The modified Chebyshev algorithm is used in…