Skip to main content
Log in

Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints

Algorithmus 42. Ein Algorithmus für den Ausgleich mit Konvexitätsbedingungen durch kubische Spline-Funktionen

  • Algorithm
  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper an algorithm is presented for fitting a cubic spline satisfying certain local concavity and convexity constraints, to a given set of data points. When using theL 2 norm, this problem results in a quadratic programming problem which is solved by means of the Theil-Van de Panne procedure. The algorithm makes use of the well-conditioned B-splines to represent the cubic splines. The knots are located automatically, as a function of a given upper limit for the sum of squared residuals. A Fortran IV implementation is given.

Zusammenfassung

Es wird ein Algorithmus vorgestellt für den Ausgleich durch kubische Spline-Funktionen, die gewissen Konvexitätsbedingungen genügen müssen. Wenn man dieL 2-Norm verwendet, führt dieses Problem auf ein quadratisches Programmierungsproblem, das man mit dem Verfahren von Theil und Van de Panne lösen kann. Für die Darstellung der kubischen Splines verwendet unser Algorithmus die gut konditionierten B-splines. Die Knoten werden automatisch in Abhängigkeit von einer Obergrenze für die Fehlerquadratsumme lokalisiert. Eine Fortran-IV-Version des Algorithmus ist beigefügt.

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. Amos, D. E., Slater, M. L.: Polynomial and spline approximation by quadratic programming. C.A.C.M.12, 379–381 (1969).

    Google Scholar 

  2. Boot, J. C. G.: Quadratic programming, pp. 95–117. Chicago: Rand Mc Nally 1964.

    Google Scholar 

  3. Carasso, C.: Méthodes numériques pour l'obtention de fonctions spline. Thèse de 3ème cycle, Université de Grenoble, 1966.

  4. Cox, M. G.: The numerical evaluation of B-splines. J. Inst. Maths. Applics10, 134–144 (1972).

    Google Scholar 

  5. Cox, M. G.: Cubic spline fitting with convexity and concavity constraints. National Physical Laboratory Report NAC 23. Teddington, Middlesex 1973.

  6. Curry, H. B., Schoenberg, I. J.: On Polya frequency functions IV. J. Analyse Math.17, 71–107 (1966).

    Google Scholar 

  7. DeBoor, C.: On calculating with B-splines. J. Approx. Theory6, 50–62 (1972).

    Google Scholar 

  8. Greville, T. N. E.: Introduction to spline functions. Theory and applications of spline functions (Greville, T. N. E., ed.), pp. 1–35. New York: Academic Press 1969.

    Google Scholar 

  9. Lafata, P., Rosen, J. B.: An interactive display for approximation by linear programming. C.A.C.M.13, 651–659 (1970).

    Google Scholar 

  10. Rabinowitz, P.: Applications of linear programming to numerical analysis. SIAM Review10, 121–159 (1968).

    Google Scholar 

  11. Theil, H., Van de Panne, C.: Quadratic programming as an extension of conventional quadratic maximization. Management Science7, 1–20 (1960).

    Google Scholar 

  12. Dierckx, P.: An algorithm for least-squares cubic spline fitting with convexity and concavity constraints. Applied Mathematics and Programming Division Report TW 39, K. U. Leuven, 1978.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dierckx, P. Algorithm/algorithmus 42 an algorithm for cubic spline fitting with convexity constraints. Computing 24, 349–371 (1980). https://doi.org/10.1007/BF02237820

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation