Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
The Degree Of Copositive Approximation And A Computer Algorithm, Yingkang Hu, Xiang Ming Yu
The Degree Of Copositive Approximation And A Computer Algorithm, Yingkang Hu, Xiang Ming Yu
College of Natural and Applied Sciences
The main results are as follows. (1) Let f ∈ C[0, 1] change its sign a finite number of times; then the degree of copositive approximation of f by splines with n equally spaced knots is bounded by C ω3(f, 1/n) for n large enough. This rate is the best in the sense that ω3 cannot be replaced by ω4. (2) An algorithm is developed based on the proof. (3) The first result above holds for a copositive polynomial approximation of f. (4) If f ∈ C1[0, 1], then the degree of approximation by copositive splines of order r is …