Representation and Approximation of Positivity Preservers
نویسنده
چکیده
We consider a closed set S ⊆ Rn and a linear operator Φ: R[X1, . . . , Xn]→ R[X1, . . . , Xn] that preserves nonnegative polynomials, in the following sense: if f ≥ 0 on S, then Φ(f) ≥ 0 on S as well. We show that each such operator is given by integration with respect to a measure taking nonnegative functions as its values. This can be seen as a generalization of Haviland’s Theorem, which concerns linear functionals on R[X1, . . . , Xn]. For compact sets S we use the result to show that any nonnegativity preserving operator is a pointwise limit of very simple nonnegativity preservers with finite dimensional range.
منابع مشابه
Matrix positivity preservers in fixed dimension
A celebrated 1942 result of Schoenberg characterizes all entry-wise functions which preserve positivity of matrices of any size. I will present a characterization of polynomials which preserve positivity when applied entry-wise on matrices of a fixed dimension. All put in historical context and motivated by recent demands of statistics of large data and optimization theory. A sketch of the proo...
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملConstrained Interpolation via Cubic Hermite Splines
Introduction In industrial designing and manufacturing, it is often required to generate a smooth function approximating a given set of data which preserves certain shape properties of the data such as positivity, monotonicity, or convexity, that is, a smooth shape preserving approximation. It is assumed here that the data is sufficiently accurate to warrant interpolation, rather than least ...
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کاملRepresentation of a digitized surface by triangular faces
This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...
متن کامل