TY - JOUR
T1 - On the choice of segments in piecewise approximation
AU - Hawkins, Douglas M.
PY - 1972/4
Y1 - 1972/4
N2 - An optimal choice of segment boundaries in piecewise approximation is shown to be soluble by means of a dynamic programme in a scalar state variable. It is shown that the composite error function is continuous in modulus, and that for approximation of concave or convex functions by linear segments, the composite approximation is continuous. Provided the residual term satisfies certain requirements, the solution has uniqueness properties and can be found by means of a grid search method.
AB - An optimal choice of segment boundaries in piecewise approximation is shown to be soluble by means of a dynamic programme in a scalar state variable. It is shown that the composite error function is continuous in modulus, and that for approximation of concave or convex functions by linear segments, the composite approximation is continuous. Provided the residual term satisfies certain requirements, the solution has uniqueness properties and can be found by means of a grid search method.
UR - http://www.scopus.com/inward/record.url?scp=0003490686&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0003490686&partnerID=8YFLogxK
U2 - 10.1093/imamat/9.2.250
DO - 10.1093/imamat/9.2.250
M3 - Article
AN - SCOPUS:0003490686
SN - 0272-4960
VL - 9
SP - 250
EP - 256
JO - IMA Journal of Applied Mathematics (Institute of Mathematics and Its Applications)
JF - IMA Journal of Applied Mathematics (Institute of Mathematics and Its Applications)
IS - 2
ER -