Electronic Resource
Springer
BIT
10 (1970), S. 324-332
ISSN:
1572-9125
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A method is described of obtaining convex polynomial approximations to discrete sets of convex data. The approximations are best convex combinations of certain component convex functions. A Weierstrass-type theorem is proved, to justify the choice of component functions, and numerical illustrations are given.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01934201
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |