Abstract
For a given function f ∈ C[a,b], we assume that the ordinates \( u_i \approx f(x_i ) \) are known approximately for n + 1 nodes x i ∈ [a,b]. If the u i are obtained by measurements which are in general imprecise, the deviations in the data u i render a straightforward approximation using interpolating methods meaningless. Instead, one needs to find an error compensating function S whose graph passes near the interpolation points (x i , u i ) and is as smooth as possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
[BÖHM74], 6; [ENGE87], p.235 ff.; [REIN71]; [SPÄT73]; [SPÄT74/1]; [SPÄT74/2], p.74-85.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Engeln-Müllges, G., Uhlig, F. (1996). Cubic Fitting Splines for Constructing Smooth Curves. In: Numerical Algorithms with C. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61074-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-61074-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64682-9
Online ISBN: 978-3-642-61074-5
eBook Packages: Springer Book Archive