Related papers: The Fekete problem in segmental polynomial interpo…
We define $F$-polynomials as linear combinations of dilations by some frequencies of an entire function $F$. In this paper we use Pade interpolation of holomorphic functions in the unit disk by $F$-polynomials to obtain explicitly…
For the Lagrange interpolation over a triangular domain, we propose an efficient algorithm to rigorously evaluate the interpolation error constant under the maximum norm by using the finite element method (FEM). In solving the optimization…
The authors study the distribution of zeros of the Fekete polynomial f_p(t) (defined for p prime) as p -> infinity. They show that asymptotically a constant fraction of the zeros lie on the unit circle, and they investigate the constant of…
We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
Higher-degree polynomial interpolations carried out on uniformly distributed nodes are often plagued by {\it overfitting}, known as Runge's phenomenon. This work investigates Runge's phenomenon and its suppression in various versions of the…
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…
We consider the logarithmic Fekete problem, which consists of placing a fixed number of points on the unit sphere in $\mathbb{R}^d$, in such a way that the product of all pairs of mutual Euclidean distances is maximized or, equivalently, so…
Let $\Gamma$ be an $L$-shape arc consisting of 2 line segments that meet at an angle different from $\pi$ in the complex $z$-plane $\CC$. This paper is to investigate the behavior of the polynomial interpolants at the Fej\'er points,…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
In this work, we propose a novel formulation for the solution of partial differential equations using finite element methods on unfitted meshes. The proposed formulation relies on the discrete extension operator proposed in the aggregated…
In this article, we study bivariate polynomial interpolation on the node points of degenerate Lissajous figures. These node points form Chebyshev lattices of rank $1$ and are generalizations of the well-known Padua points. We show that…
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…
In this paper, we focus on barycentric weights and Lebesgue constants for Lagrange interpolation of arbitrary node distributions on \([-1,1]\). The following three main works are included: estimates of upper and lower bounds on the…
Let L be an ample line bundle on a (geometrically reduced) projective variety X over any complete valued field. Our main result describes the leading asymptotics of the determinant of cohomology of large powers of L, with respect to the…
In this work, a family of symmetric interpolation points are generated on the four-dimensional simplex (i.e. the pentatope). These points are optimized in order to minimize the Lebesgue constant. The process of generating these points…
The Performance Estimation Problem (PEP) approach consists in computing worst-case performance bounds on optimization algorithms by solving an optimization problem: one maximizes an error criterion over all initial conditions allowed and…
The functional interpolation problem on a continual set of nodes by an integral continued C-fraction is studied. The necessary and sufficient conditions for its solvability are found. As a particular case, the considered integral continued…
Polygonal finite elements generally do not pass the patch test as a result of quadrature error in the evaluation of weak form integrals. In this work, we examine the consequences of lack of polynomial consistency and show that it can lead…