The Degree of Copositive Approximation and a Computer Algorithm
From MaRDI portal
Publication:4875507
DOI10.1137/0733020zbMath0847.41016OpenAlexW2044945844MaRDI QIDQ4875507
Publication date: 15 October 1996
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f2e8b51674449ac9b7d8349f5f37887bc2f71ad4
Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation with constraints (41A29) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25) Spline approximation (41A15) Software, source code, etc. for problems pertaining to approximations and expansions (41-04)
Related Items
Positive and copositive spline approximation in \(L_ p[0,1\)], Oscillation-diminishing polynomial approximation in C\(^0_w\) and \(L_p(\mathbb R,d \mu), 1 \leq p < \infty\), Copositive pointwise approximation, Pointwise estimation of the almost copositive approximation of continuous functions by algebraic polynomials, Weak copositive and interwining approximation, On equivalence of moduli of smoothness of polynomials in \(L_p\), \(0 < p \leqslant \infty\), Shape-preserving approximation by polynomials, Interpolated estimate for copositive approximations by algebraic polynomials