Constrained approximation by splines with free knots

In this paper, a method that combines shape preservation and least squares approximation by splines with free knots is developed. Besides the coefficients of the spline a subset of the knot sequence, the so-calledfree knots, is included in the optimization process resulting in a nonlinear least squares problem in both the coefficients and the knots. The original problem, a special case of aconstrained semi-linear least squares problem, is reduced to a problem that has only the knots of the spline as variables. The reduced problem is solved by a generalized Gauss-Newton method. Special emphasise is given to the efficient computation of the residual function and its Jacobian.

[1]  C. Corradi.  A Note on the Solution of Separable Nonlinear Least-Squares Problems with Separable Nonlinear Equality Constraints , 1981 .

[2]  Jochen W. Schmidt,et al.  A dual algorithm for convex-concave data smoothing by cubicC2-splines , 1990 .

[3]  C. D. Boor,et al.  Least Squares Cubic Spline Approximation, II - Variable Knots , 1968 .

[4]  L. Kaufman,et al.  A Method for Separable Nonlinear Least Squares Problems with Separable Nonlinear Equality Constraints , 1978 .

[5]  D. Jupp.  Approximation to Data by Splines with Free Knots , 1978 .

[6]  Grace Wahba,et al.  Constrained Regularization for Ill Posed Linear Operator Equations, with Applications in Meteorology and Medicine. , 1982 .

[7]  Paul Dierckx,et al.  Curve and surface fitting with splines , 1994, Monographs on numerical analysis.

[8]  G. Wahba.  Spline models for observational data , 1990 .

[9]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[10]  James W. Daniel,et al.  Stability of the solution of definite quadratic programs , 1973, Math. Program..

[11]  C. Micchelli,et al.  Smoothing and Interpolation in a Convex Subset of a Hilbert Space , 1988 .

[12]  Hubert Schwetlick,et al.  Spline smoothing under constraints on derivatives , 1993 .

[13]  Hubert Schwetlick,et al.  Least squares approximation by splines with free knots , 1995 .

[14]  Anthony V. Fiacco,et al.  Sensitivity analysis for nonlinear programming using penalty methods , 1976, Math. Program..

[15]  Per Christian Hansen,et al.  Analysis of Discrete Ill-Posed Problems by Means of the L-Curve , 1992, SIAM Rev..

[16]  Linda Kaufman,et al.  A Variable Projection Method for Solving Separable Nonlinear Least Squares Problems , 1974 .

[17]  L. Schumaker.  Spline Functions: Basic Theory , 1981 .

[18]  G. Stoyan.  de Boor, C., A Practical Guide to Splines. Applied Mathematical Sciences 27. Berlin‐Heidelberg‐New York, Springer‐Verlag 1978. XXIV, 392 S., DM 32,50. US $ 17.90 , 1980 .

[19]  Tommy Elfving,et al.  An algorithm for computing constrained smoothing spline functions , 1987 .

[20]  L. Kaufman.  A variable projection method for solving separable nonlinear least squares problems , 1974 .

[21]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[22]  Teresa Anne Parks.  Reducible Nonlinear Programming Problems , 1985 .

[23]  C. Paige,et al.  An error analysis of a method for solving matrix equations , 1973 .

[24]  Axel Ruhe,et al.  Algorithms for separable nonlinear least squares problems , 1980 .