Related papers: Optimal Point Sets for Total Degree Polynomial Int…
In this paper we apply the INTERNODES method to solve second order elliptic problems discretized by Isogeometric Analysis methods on non-conforming multiple patches in 2D and 3D geometries. INTERNODES is an interpolation-based method that,…
We establish interpolation analogues of Lebesgue type inequalities on the sets of $C^{\psi}_{\beta}L_{1}$ $2\pi$-periodic functions $f$, which are representable as convolutions of generating kernel $\Psi_{\beta}(t) =…
The aim of this paper is to obtain quantitative bounds for solutions to the optimal matching problem in dimension two. These bounds show that up to a logarithmically divergent shift, the optimal transport maps are close to be the identity…
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
Efficient solution of the lowest eigenmodes is studied for a family of related eigenvalue problems with common $2\times 2$ block structure. It is assumed that the upper diagonal block varies between different versions while the lower…
This paper is devoted to the study of couplings of the Lebesgue measure and the Poisson point process. We prove existence and uniqueness of an optimal coupling whenever the asymptotic mean transportation cost is finite. Moreover, we give…
For exponents in the subcritical range, we revisit some optimal interpolation inequalities on the sphere with carr\'e du champ methods and use the remainder terms to produce improved inequalities. The method provides us with lower estimates…
We describe a randomized algorithm that, given a set $P$ of points in the plane, computes the best location to insert a new point $p$, such that the Delaunay triangulation of $P\cup\{p\}$ has the largest possible minimum angle. The expected…
This article is devoted to developing a theory for effective kernel interpolation and approximation in a general setting. For a wide class of compact, connected $C^\infty$ Riemannian manifolds, including the important cases of spheres and…
As we all known, there is still a long way for us to solve arbitrary multivariate Lagrange interpolation in theory. Nevertheless, it is well accepted that theories about Lagrange interpolation on special point sets should cast important…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.
In this paper, we show that the interpolation spaces between Grand, small or classical Lebesgue are so called Lorentz-Zygmund spaces or more generally $G\Gamma$-spaces. As a direct consequence of our results any Lorentz-Zygmund space…
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the…
We present two methods to algorithmically compute both least and greatest solutions of polynomial equation systems over absorptive semirings (with certain completeness and continuity assumptions), such as the tropical semiring. Both methods…
On one hand, consider the problem of finding global solutions to a polynomial optimization problem and, on the other hand, consider the problem of interpolating a set of points with a complex exponential function. This paper proposes a…
Current state-of-the-art discrete optimization methods struggle behind when it comes to challenging contrast-enhancing discrete energies (i.e., favoring different labels for neighboring variables). This work suggests a multiscale approach…
In this note we consider the optimal design problem for estimating the slope of a polynomial regression with no intercept at a given point, say z. In contrast to previous work, which considers symmetric design spaces we investigate the…
We study polynomial approximation on a $d$-cube, where $d$ is large, and compare interpolation on sparse grids, aka Smolyak's algorithm (SA), with a simple least squares method based on randomly generated points (LS) using standard…
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…