Piecewise linear approximations of fewest line segments
Dan Wilson
Abstract
Open-access reader
Dan Wilson
Abstract
Open-access reader
Schwerdtfeger has considered the problem of interpolation and curve fitting over a given partition by a sum of continuous sectionally linear functions. He showed how to construct an orthogonal system of these functions over a given partition and how to use this system to obtain an approximation of a given function which is best in the least square sense.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Schwerdtfeger has considered the problem of interpolation and curve fitting over a given partition by a sum of continuous sectionally linear functions. He showed how to construct an orthogonal system of these functions over a given partition and how to use this system to obtain an approximation of a given function which is best in the least square sense.
Key concepts: Piecewise linear function, Partition (number theory), Interpolation (computer graphics), Mathematics, Piecewise, Linear system, Applied mathematics, Approximations of π