Related papers: Integral Estimates for Approximations by Volume Pr…
This paper is concerned with the problem of sampling and interpolation involving derivatives in shift-invariant spaces and the error analysis of the derivative sampling expansions for fundamentally large classes of functions. A new type of…
In this note functions that transform open segments of a linear space into open segments of another linear space are studied and characterized. Assuming that the range is non-collinear, it is proved that such a map can always be expressed…
Probability estimation by maximum entropy reconstruction of an initial relative frequency estimate from its projection onto a hypergraph model of the approximate conditional independence relations exhibited by it is investigated. The…
We prove various inequalities measuring how far from an isometry a local map from a manifold of high curvature to a manifold of low curvature must be. We consider the cases of volume-preserving, conformal and quasi-conformal maps. The…
We study large deviations for some non-local parabolic type equations. We show that, under some assumptions on the non-local term, problems defined in a bounded domain converge with an exponential rate to the solution of the problem defined…
Brenier's theorem is a cornerstone of optimal transport that guarantees the existence of an optimal transport map $T$ between two probability distributions $P$ and $Q$ over $\mathbb{R}^d$ under certain regularity conditions. The main goal…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
The stationary points of the total scalar curvature functional on the space of unit volume metrics on a given closed manifold are known to be precisely the Einstein metrics. One may consider the modified problem of finding stationary points…
Accurate asymptotic solutions are presented for axisymmetric deformation of thin layers constrained by either two rigid plates or two rigid spheres. Those solutions are developed using Saint-Venant's principle and the layer thinness as the…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…
We develop a semi-discretization approximation for scalar conservation laws with multiple rough time dependence in inhomogeneous fluxes. The method is based on Brenier's transport-collapse algorithm and uses characteristics defined in the…
We give explicit versions for some of Ratner's estimates on the decay of matrix coefficients of SL(2,R)-representations.
Various norms can be defined on a Krein space by choosing different underlying fundamental decompositions. Some estimates of norms on Krein spaces are discussed and few results in Bognar's paper are generalized.
The Brier Score is a widely-used criterion to assess the quality of probabilistic predictions of binary events. The expectation value of the Brier Score can be decomposed into the sum of three components called reliability, resolution, and…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
Estimating Wasserstein distances between two high-dimensional densities suffers from the curse of dimensionality: one needs an exponential (wrt dimension) number of samples to ensure that the distance between two empirical measures is…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
This paper deals with bounding the error on the estimation of quantities of interest obtained by finite element and domain decomposition methods. The proposed bounds are written in order to separate the two errors involved in the resolution…