Determining projection constants of univariate polynomial spaces

DOI10.1016/J.JAT.2018.06.002MaRDI QIDQ1663844zbMATH OpenOpenAlexWikidataFDO

Authors Simon Foucart, Jean B. Lasserre

Publication date 24 August 2018

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.04205

zbMATH Keywords

linear programmingmethod of momentssemidefinite programmingminimal projectionprojection constant

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Best constants in approximation theory (41A44)

Abstract: The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a linear program, and the lower bound, produced by a semidefinite program exploiting the method of moments, are often close enough to deduce the projection constant with reasonable accuracy. The implementation of these programs makes it possible to find the projection constant of several three-dimensional spaces with five digits of accuracy, as well as the projection constants of the spaces of cubic, quartic, and quintic polynomials with four digits of accuracy. Beliefs about uniqueness and shape-preservation of minimal projections are contested along the way.

Recommendations

• Computation of Minimal Projections and Extensions
• Numerical estimation of projection constants
• scientific article; zbMATH DE number 1532379
• Determination of a minimal projection fromC[-1, 1] onto the quadratics
• scientific article; zbMATH DE number 3987883

Cites work

• scientific article; zbMATH DE number 3464348 (Why is no real title available?)
• scientific article; zbMATH DE number 3344977 (Why is no real title available?)
• scientific article; zbMATH DE number 3063315 (Why is no real title available?)
• Basc: constrained approximation by semidefinite programming
• Bounds for polynomials with a unit discrete norm
• Computation of Minimal Projections and Extensions
• Determination of a minimal projection fromC[-1, 1] onto the quadratics
• Minimal shape-preserving projections onto Π_n
• Numerical estimation of projection constants
• On the Minimal Property of the Fourier Projection
• Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points)
• The Growth of Polynomials Bounded at Equally Spaced Points
• The moment problem

Cited in

(5)

• Projecting Lipschitz functions onto spaces of polynomials
• Optimization-aided construction of multivariate Chebyshev polynomials
• A projection algorithm on the set of polynomials with two bounds
• Computation of Chebyshev polynomials for union of intervals
• On projective equivalence of univariate polynomial subspaces

Describes a project that uses

Uses Software

• CVX
• Chebfun
• Basc

This page was built for publication: Determining projection constants of univariate polynomial spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663844)