Algorithms For Positive Polynomial Approximation

DOI10.1137/17M1131891zbMath1415.65031OpenAlexW2745476525WikidataQ128564071 ScholiaQ128564071MaRDI QIDQ4620318

Frédérique Charles, Martin Campos Pinto, 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) Algorithms for approximation of functions (65D15) Approximate quadratures (41A55)

Related Items (8)

A projection algorithm on the set of polynomials with two bounds ⋮ Conservative semi-Lagrangian schemes for kinetic equations. I: Reconstruction ⋮ Bounds-constrained polynomial approximation using the Bernstein basis ⋮ Geometric Quasilinearization Framework for Analysis and Design of Bound-Preserving Schemes ⋮ Computation of Sum of Squares Polynomials from Data Points ⋮ Density theorems with applications in quantum signal processing ⋮ Algorithms For Positive Polynomial Approximation ⋮ Structure-Preserving Function Approximation via Convex Optimization

Uses Software

• HE-E1GODF
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimized explicit finite-difference schemes for spatial derivatives using maximum norm
• Positivity of cubic polynomials on intervals and positive spline interpolation
• Testing positiveness of polynomials
• Polynomials with bounds and numerical approximation
• Uniform Asymptotic Stability of Strang's Explicit Compact Schemes for Linear Advection
• Newton Methods for Nonlinear Problems
• Algorithms For Positive Polynomial Approximation

This page was built for publication: Algorithms For Positive Polynomial Approximation