Skip to main content
Log in

Algorithms for computing shape preserving spline approximations to data

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

We treat the problem of approximating data that are sampled with error from a function known to be convex and increasing. The approximating function is a polynomial spline with knots at the data points. This paper presents results (analogous to those in [7] and [9]) that describe some approximation properties of polynomial splines and algorithms for determining the existence of a “shape-preserving” approximant for given data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beatson, R.K.: Convex Approximation by Splines. Univ. of Texas at Austin, Dept. of Mathematics, Tech. Report #25, May 1980

  2. Chui, C.K., Smith, P.W., Ward, J.D.: Degree ofL p Approximation by Monotone Splines. SIAM J. Math. Anal.II, 436–447 (1980)

    Google Scholar 

  3. Chung, W.L.: Automatic Curve Fitting Using An Adaptive Local Algorithm. ACM Trans. Math. Software6, 45–57 (1980)

    Google Scholar 

  4. Craven, P., Wahba, G.: Smoothing Noisy Data With Spline Functions. Numer. Math.31, 377–403 (1979)

    Google Scholar 

  5. Hanson, R.J.: Constrained Least Squares Curve Fitting to Discrete Data UsingB-Splines — A Users Guide. Sandia Laboratories, Albuquerque, N.M., SAND-78-1291, Feb. 1979

  6. Lorentz, G.G.: Bernstein Polynomials. Toronto: University of Toronto Press 1953

    Google Scholar 

  7. McAllister, D.F., Passow, E., Roulier, J.A.: Algorithms for Computing Shape Preserving Spline Interpolations to Data. Math. Comput.31, 717–725 (1977)

    Google Scholar 

  8. McAllister, D.F., Roulier, J.A.: An Algorithm for Computing a Shape Preserving Osculatory Quadratic Spline. Trans. Math. Software7, 331–347 (1981)

    Google Scholar 

  9. McAllister, D.F., Roulier, J.A.: Interpolation by Convex Quadratic Splines. Math. Comput.32, 1156–1162 (1978)

    Google Scholar 

  10. Wahba, G.: How to Smooth Curves and Surfaces with Splines and Cross-Validation. Proceedings of the Twenty-Fourth Conference on the Design of Experiments in Army Research Development and Testing, ARO Report 79-2

  11. Wahba, G.: Optimal Smoothing of Density Estimates. Classification and Clustering, pp. 423–457. New York: Academic Press 1977

    Google Scholar 

  12. Wright, I.W., Wegman, E.J.: Isotonic, Convex, and Related Splines. Ann. Statist.8, 1023–1035 (1980)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Formerly of the Graduate Program in Operations Research, NC State University. Author now

Research supported in part by NASA Grant NAG1-103

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dodd, S.L., McAllister, D.F. Algorithms for computing shape preserving spline approximations to data. Numer. Math. 46, 159–174 (1985). https://doi.org/10.1007/BF01390417

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01390417

Subject Classifications

Navigation