The Degree of Copositive Approximation and a Computer Algorithm | Zendy

Yingkang Hu | Zendy; Xiang Ming Yu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Degree of Copositive Approximation and a Computer Algorithm

Author(s) -

Yingkang Hu,

Xiang Ming Yu

Publication year - 1996

Publication title -

siam journal on numerical analysis

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 2.78

H-Index - 134

eISSN - 1095-7170

pISSN - 0036-1429

DOI - 10.1137/0733020

Subject(s) - degree (music) , mathematics , omega , combinatorics , bounded function , order (exchange) , approximation algorithm , mathematical analysis , physics , acoustics , finance , quantum mechanics , economics

. Our main results are: (1) Let f 2 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 boundedby C! 3 (f; 1=n) for n large enough. This rate is the best in the sense that ! 3 can not be replaced by! 4 ; (2) an algorithm is developed based on the proof; (3) the first result above holds for copositivepolynomial approximation of f ; (4) if f 2 C1[0; 1], then the degree of approximation by copositive...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research