Piecewise cubic curve-fitting algorithm

Yan, Zheng

doi:10.1090/S0025-5718-1987-0890262-0

Piecewise cubic curve-fitting algorithm
HTML articles powered by AMS MathViewer

by Zheng Yan PDF

Math. Comp. 49 (1987), 203-213 Request permission

Abstract:

We give a piecewise cubic curve fitting algorithm which preserves monotonicity of the data. The algorithm has a higher order of convergence than the Fritsch-Carlson algorithm and is simpler than the Eisenstat-Jackson-Lewis algorithm.

References

J. Assoc. Comput. Mach.

Carl de Boor, A practical guide to splines, Applied Mathematical Sciences, vol. 27, Springer-Verlag, New York-Berlin, 1978. MR 507062, DOI 10.1007/978-1-4612-6333-3
S. C. Eisenstat, K. R. Jackson, and J. W. Lewis, The order of monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 22 (1985), no. 6, 1220–1237. MR 811195, DOI 10.1137/0722075
F. N. Fritsch and R. E. Carlson, Monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 17 (1980), no. 2, 238–246. MR 567271, DOI 10.1137/0717021
David F. McAllister and John A. Roulier, An algorithm for computing a shape-preserving osculatory quadratic spline, ACM Trans. Math. Software 7 (1981), no. 3, 331–347. MR 630439, DOI 10.1145/355958.355964
Martin H. Schultz, Spline analysis, Prentice-Hall Series in Automatic Computation, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1973. MR 0362832