Related papers: The Fekete problem in segmental polynomial interpo…
The Convex Envelope of a given function was recently characterized as the solution of a fully nonlinear Partial Differential Equation (PDE). In this article we study a modified problem: the Dirichlet problem for the underlying PDE. The main…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
In this paper, a piecewise quadratic nonconforming finite element method on rectangular grids for a fourth-order elliptic singular perturbation problem is presented. This proposed method is robustly convergent with respect to the…
We study finite element approximations of the nonhomogeneous Dirichlet problem for the fractional Laplacian. Our approach is based on weak imposition of the Dirichlet condition and incorporating a nonlocal analogous of the normal derivative…
A classical result of Fekete gives necessary conditions on a compact set in the complex plane so that it contains infinitely many sets of conjugate algebraic integers. For such sets, we demonstrate the existence of a sequence of algebraic…
We consider the problem of optimal linear estimation of the functional $$A_N \vec{\xi} =\sum_{j = 0}^{N} (\vec{a}(j))^{\top} \vec{\xi}(j)$$ that depends on the unknown values $\vec{\xi}(j),j=0,1,\dots,N,$ of a vector-valued harmonizable…
We consider a family of random normal matrix models whose eigenvalues tend to occupy lemniscate type droplets as the size of the matrix increases. Under the insertion of a point charge, we derive the scaling limit at the singular boundary…
We solve the following problem: given a polynomial of order $n$ and the corresponding $B\'ezier$ tensor product patches over an unstructured regular quadrilateral mesh of any valence, find a solution to the $G^{1}1$ or $C^{1}1$…
The study of interpolation nodes and their associated Lebesgue constants are central to numerical analysis, impacting the stability and accuracy of polynomial approximations. In this paper, we will explore the Morrow-Patterson points, a set…
We study the problem of finding unitary submatrices of the $N \times N$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of…
In this work we blend interpolation theory with numerical integration, constructing an interpolator based on integrals over $n$-dimensional balls. We show that, under hypotheses on the radius of the $n$-balls, the problem can be treated as…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
We consider a family of Gagliardo-Nirenberg-Sobolev interpolation inequalities which interpolate between Sobolev's inequality and the logarithmic Sobolev inequality, with optimal constants. The difference of the two terms in the…
We adopt the integral definition of the fractional Laplace operator and analyze an optimal control problem for a fractional semilinear elliptic partial differential equation (PDE); control constraints are also considered. We establish the…
In this paper we consider the solvability of a non-convex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study properties and…
There is proposed a method for improving the convergence of Fourier series by function systems, orthogonal at the segment, the application of which allows for smooth functions to receive uniformly convergent series. There is also proposed…
We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…
In this work, we investigate the performance CutFEM as a high fidelity solver as well as we construct a competent and economical reduced order solver for PDE-constrained optimization problems in parametrized domains that live in a fixed…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This work aims to introduce the framework of polynomial optimization theory to solve fractional polynomial problems (FPPs). Unlike other widely used optimization frameworks, the proposed one applies to a larger class of FPPs, not…