POLYNOMIAL AND SPLINE APPROXIMATION BY QUADRATIC PROGRAMMING

被引：9

作者：

AMOS, DE

SLATER, ML

机构：

[1] Sandia Laboratory, Albuquerque, New Mexico

来源：

COMMUNICATIONS OF THE ACM | 1969年 / 12卷 / 07期

关键词：

Bernstein polynomials; constant sign derivatives; linear concavity constraints; quadratic programming; splines;

D O I：

10.1145/363156.363163

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The problem of approximation to a given function, or of fitting a given set of data, where the approximating function is required to have certain of its derivatives of specified sign over the whole range of approximation, is studied. Two approaches are presented, in each of which quadratic programming is used to provide both the constraints on the derivatives and the selection of the function which yields the best fit. The first is a modified Berstein polynomial scheme, and the second is a spline fit. © 1969, ACM. All rights reserved.

引用

页码：379 / &