Skip to main content
SpringerLink
Log in

Convex interval interpolation with cubic splines, II

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The problem of convex interval interpolation with cubicC 1-splines has an infinite number of solutions, if it is solvable at all. For selecting one of the solutions a regularized mean curvature is minimized. The arising finite dimensional constrained program is solved numerically by means of a dualization approach.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Burmeister, W. Heß and J. W. Schmidt,Convex spline interpolants with minimal curvature, Computing 35 (1985), 219–229.

    Google Scholar 

  2. P. Costantini,On monotone and convex spline interpolation, Math. Comput. 46 (1986), 203–214.

    Google Scholar 

  3. P. Costantini and R. Morandi,Monotone and convex cubic spline interpolation, Calcolo 21 (1984), 281–294.

    Google Scholar 

  4. C. de Boor,A Practical Guide to Splines, New York-Heidelberg-Berlin: Springer-Verlag 1978.

    Google Scholar 

  5. S. Dietze and J. W. Schmidt,Determination of shape preserving spline interpolants with minimal curvature via dual programs, J. Approx. Theory 52 (1988), 43–57.

    Google Scholar 

  6. S. L. Dott and D. F. McAllister,Algorithms for computing shape preserving spline approximations to data, Numer. Math. 46 (1985), 159–174.

    Google Scholar 

  7. F. N. Fritsch and R. E. Carlson,Monotone piecewise cubic interpolation, SIAM J. Numer. Anal. 17 (1980), 238–246.

    Google Scholar 

  8. J. W. Schmidt,Convex interval interpolation with cubic splines, BIT 26 (1986), 377–387.

    Google Scholar 

  9. J. W. Schmidt,An unconstrained dual program for computing convex C 1-spline approximants, Computing 39 (1987), 133–140.

    Google Scholar 

  10. J. W. Schmidt and S. Dietze,Unconstrained duals for partially separable constrained programs, Math. Programming (to appear).

  11. J. W. Schmidt and W. Heß, Schwach verkoppelte Ungleichungssysteme und konvexe Spline-Interpolation, Elem. Math. 39 (1984), 85–95.

    Google Scholar 

  12. J. W. Schmidt and W. Heß,Positivity of cubic polynomials on intervals and positive spline interpolation, BIT 28 (1988), 340–352.

    Google Scholar 

  13. I. J. Schoenberg,Spline function and the problem of graduation, Proc. Nat. Acad. Sci. 52 (1964), 947–950.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Technical University of Dresden, Mommsenstraße 13, 8027, Dresden, Germany

    Jochen W. Schmidt

Authors
  1. Jochen W. Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Julius Albrecht on the occasion of his 65th birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmidt, J.W. Convex interval interpolation with cubic splines, II. BIT 31, 328–340 (1991). https://doi.org/10.1007/BF01931292

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS(MOS) subject classification

Keywords

Search

Navigation