Related papers: Optimal Point Sets for Total Degree Polynomial Int…
The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a…
The optimal one-sided parametric polynomial approximants of a circular arc are considered. More precisely, the approximant must be entirely in or out of the underlying circle of an arc. The natural restriction to an arc's approximants…
A new alternative numerical procedure to the Szeg\H{o} quadrature formulas for the estimation of integrals with respect to a positive Borel measure $\mu$ supported on the unit circle is presented. As in many practical situations, we assume…
In this paper, we propose a trigonometric-interpolation approach for solutions of second order nonlinear ODEs with mixed boundary conditions. The method interpolates secondary derivative $y''$ of a target solution $y$ by a trigonometric…
Hermite spectral method plays an important role in the numerical simulation of various partial differential equations (PDEs) on unbounded domains. In this work, we study the superconvergence properties of Hermite spectral interpolation,…
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…
We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…
In this article, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets related to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
We describe an approach for finding upper bounds on an ODE dynamical system's maximal Lyapunov exponent among all trajectories in a specified set. A minimization problem is formulated whose infimum is equal to the maximal Lyapunov exponent,…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
This is an expanded version of the two papers "Interpolation of Varieties of Minimal Degree" and "Interpolation Problems: Del Pezzo Surfaces." It is well known that one can find a rational normal curve in $\mathbb P^n$ through $n+3$ general…
We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…
We provide a systematic deterministic numerical scheme to approximate the volume (i.e. the Lebesgue measure) of a basic semi-algebraic set whose description follows a sparsity pattern. As in previous works (without sparsity), the underlying…
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
This paper is devoted to a rigorous analysis of exponential convergence of polynomial interpolation and spectral differentiation based on the Gegenbauer-Gauss and Gegenbauer-Gauss-Lobatto points, when the underlying function is analytic on…
High-order interpolation on the Grassmann manifold $\Gr(n, p)$ is often hindered by the computational overhead and derivative instability of SVD-based geometric mappings. To solve the challenges, we propose a stabilized framework that…
In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…