Related papers: An explicit construction of optimized interpolatio…
Padua points is a family of points on the square $[-1,1]^2$ given by explicit formulas that admits unique Lagrange interpolation by bivariate polynomials. The interpolation polynomials and cubature formulas based on the Padua points are…
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 introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
For the quadratic Lagrange interpolation function, an algorithm is proposed to provide explicit and verified bound for the interpolation error constant that appears in the interpolation error estimation. The upper bound for the…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…
Leja points on a compact $K \subset \mathbb{C}$ are known to provide efficient points for interpolation, but their actual implementation can be computationally challenging. So-called pseudo Leja points are a more tractable solution, yet…
Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…
This expository article explores the vital role of interpolation theory and Lorentz spaces in the rigorous analysis of partial differential equations (PDEs). While classical Lebesgue spaces ($L_{p}$) successfully measure the magnitude of…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
The simplest way to obtain continuous interpolation between two points in high dimensional space is to draw a line between them. While previous works focused on the general connectivity between model parameters, we explored linear…
Estimates are obtained for the Lebesgue constants associated with the Gauss quadrature points on $(-1, +1)$ augmented by the point $-1$ and with the Radau quadrature points on either $(-1, +1]$ or $[-1, +1)$. It is shown that the Lebesgue…
We initiate the study of four-point functions of large BPS operators at any value of the coupling. We do it by casting it as a sum over exchange of superconformal primaries and computing the structure constants using integrability. Along…
We examine optimal matchings or transport between two stationary random measures. It covers allocation from the Lebesgue measure to a point process and matching a point process to a regular (shifted) lattice. The main focus of the article…
In the present paper optimal interpolation formulas are constructed in $W_2^{(m,m-1)}(0,1)$ space. Explicit formulas for coefficients of optimal interpolation formulas are obtained. Some numerical results are presented.
We extend recent computer-assisted design and analysis techniques for first-order optimization over structured functions--known as performance estimation--to apply to structured sets. We prove "interpolation theorems" for smooth and…
Consider the Poisson equation with the Dirichlet boundary condition on a three-dimensional polyhedral domain. For singular solutions from the non-smoothness of the domain boundary, we propose new anisotropic tetrahedral mesh refinement…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
We propose new algebraic methods for extracting cylinders and cones from minimal point sets, including oriented points. More precisely, we are interested in computing efficiently cylinders through a set of three points, one of them being…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
This paper can be considered as the sequel of [6], where the authors have proposed an abstract construction of Hardy spaces H^1. They shew an interpolation result for these Hardy spaces with the Lebesgue spaces. Here we describe a more…