Related papers: Optimal Points for Cubature Rules and Polynomial I…
Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…
We study the consistency of minimum-norm interpolation in reproducing kernel Hilbert spaces corresponding to bounded kernels. Our main result give lower bounds for the generalization error of the kernel interpolation measured in a…
We study schemes for interpolating functions that take values in the special orthogonal group $SO(n)$. Our focus is on interpolation schemes obtained by embedding $SO(n)$ in a linear space, interpolating in the linear space, and mapping the…
A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…
In this paper we illustrate that paraorthogonality on the unit circle $\mathbb{T}$ is the counterpart to orthogonality on $\mathbb{R}$ when we are interested in the spectral properties. We characterize quasi-paraorthogonal polynomials on…
Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
We study the set of common F_q-rational zeros of systems of multivariate symmetric polynomials with coefficients in a finite field F_q. We establish certain properties on these polynomials which imply that the corresponding set of zeros…
We extend some results on even sets of nodes which have been proved for surfaces up to degree 6 to surfaces up to degree 10. In particular, we give a formula for the minimal cardinality of a nonempty even set of nodes.
One frequently needs to interpolate or approximate gradients on simplicial meshes. Unfortunately, there are very few explicit mathematical results governing the interpolation or approximation of vector-valued functions on Delaunay meshes in…
We decrease the $rms$ mean curvature and area of a variable surface with a fixed boundary by iterating a few times through a curvature-based variational algorithm. For a boundary with a known minimal surface, starting with a deliberately…
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…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
We construct least squares formulations of PDEs with inhomogeneous essential boundary conditions, where boundary residuals are not measured in unpractical fractional Sobolev norms, but which formulations nevertheless are shown to yield a…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
Fully symmetric positive interior (f-SPI) quadrature rules are key building blocks for high-order discretizations of partial differential equations, yet high-degree rules with few nodes remain scarce on reference elements commonly used in…
Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…
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…
We study the generalization error of functions that interpolate prescribed data points and are selected by minimizing a weighted norm. Under natural and general conditions, we prove that both the interpolants and their generalization errors…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…