Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions

Abstract

Polynomials, trigonometric polynomials, and rational functions are widely used for the discrete approximation of functions or simulation models.Often, it is known beforehand, that the underlying unknown function has certain properties, e.g. nonnegative or increasing on a certain region.However, the approximation may not inherit these properties automatically.We present some methodology (using semidefinite programming and results from real algebraic geometry) for least-norm approximation by polynomials, trigonometric polynomials and rational functions that preserve nonnegativity.(trigonometric) polynomials;rational functions;semidefinite programming;regression;(Chebyshev) approximation