Derivation of new Degrees for Best (Co)convex and Unconstrained Polynomial Approximation in \mathbbL^{α, β}_p space: I

2020/05/15 by Malik Saad Al-Muhja, Al-Muhja, Malik Saad, Habibulla Akhadkulov +3
Computer Science · Mathematics · #Matrix Theory and Algorithms #Mathematical functions and polynomials #Mathematical Approximation and Integration

paper · pdf · doi:10.48550/arxiv.2005.07747

Abstract

The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex polynomial as (co)convex polynomial herein.

Related

• Polynomial convexity with degree bounds
• Uniform and pointwise shape preserving approximation (SPA) by algebraic polynomials: an update
• On Extend the Domain of (Co)convex Polynomial
• Almost optimal polynomial approximation on convex sets in ℂ
• Approximating a norm by a polynomial