Algorithms for positive polynomial approximation

DOI10.1137/17M1131891MaRDI QIDQ4620318zbMATH OpenOpenAlexWikidataFDO

Authors Martin Campos Pinto, Frédérique Charles, Bruno Després

Publication date 8 February 2019

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/17m1131891

zbMATH Keywords

Chebyshev polynomialspolynomial interpolationpositive polynomials

Mathematics Subject Classification ID

Approximation with constraints (41A29) Approximate quadratures (41A55) Algorithms for approximation of functions (65D15)

Recommendations

• scientific article; zbMATH DE number 3390208
• On \(n\)-term approximation with positive coefficients
• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
• scientific article; zbMATH DE number 1995862
• The Degree of Copositive Approximation and a Computer Algorithm

Cites work

• Algorithms for positive polynomial approximation
• scientific article; zbMATH DE number 1061255 (Why is no real title available?)
• scientific article; zbMATH DE number 836627 (Why is no real title available?)
• scientific article; zbMATH DE number 274553 (Why is no real title available?)
• scientific article; zbMATH DE number 3037624 (Why is no real title available?)
• Moments, positive polynomials and their applications
• Newton methods for nonlinear problems. Affine invariance and adaptive algorithms.
• NIST handbook of mathematical functions
• Optimized explicit finite-difference schemes for spatial derivatives using maximum norm
• Polynomials with bounds and numerical approximation
• Positive polynomials and sums of squares: theory and practice
• Positivity of cubic polynomials on intervals and positive spline interpolation
• Testing positiveness of polynomials
• Uniform asymptotic stability of Strang's explicit compact schemes for linear advection

Cited in

(11)

• Conservative semi-Lagrangian schemes for kinetic equations. I: Reconstruction
• Bounds-constrained polynomial approximation using the Bernstein basis
• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
• Algorithms for positive polynomial approximation
• Computation of sum of squares polynomials from data points
• Structure-preserving function approximation via convex optimization
• Geometric Quasilinearization Framework for Analysis and Design of Bound-Preserving Schemes
• Density theorems with applications in quantum signal processing
• On enforcing nonnegativity in polynomial approximations in high dimensions
• A projection algorithm on the set of polynomials with two bounds
• Faster algorithms for computing Hong's bound on absolute positiveness

Describes a project that uses

Uses Software

• HE-E1GODF
• DLMF

This page was built for publication: Algorithms for positive polynomial approximation

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