Spline smoothing under constraints on derivatives. (English) Zbl 0796.65005
The paper deals with univariate smoothing splines with space constraints imposed on the solution function. Utilizing the \(B\)-spline representation the authors demonstrate how the original problem can be replaced by a stronger one which in turn can be formulated as the least squares approximation problem with linear constraints. An algorithm for computing a smoothing spline is included.
Reviewer: E.Neuman (Carbondale)
References:
| [1] | L.-E. Andersson and T. Elfving.Interpolation and approximation by monotone cubic splines. J. Approx. Theory, 66:302–333, 1991. · Zbl 0739.41005 · doi:10.1016/0021-9045(91)90033-7 |
| [2] | P. M. Anselone and P. J. Laurent.A general method for the construction of interpolating or smoothing spline functions. Numer. Math., 12:66–82, 1968. · Zbl 0197.13501 · doi:10.1007/BF02170998 |
| [3] | I. Barrodale and F. D. K. Roberts.Algorithm 552. Solution of the constrained 1 1 linear approximation problem. ACM Trans. Math. Software, 6: 231–235, 1980. · Zbl 0442.41001 · doi:10.1145/355887.355896 |
| [4] | Å. Björck.Least squares methods. In P. G. Ciarlet and J. L. Lions, editors,Handbook of Numerical Analysis, volume 1, pages 589–652. Elsevier/North-Holland, 1987. |
| [5] | K. Böhmer.Spline-Funktionen. Teubner, Stuttgart, 1974. |
| [6] | M. G. Cox.The least squares solution of overdetermined linear equations having band or augmented band structure. IMA J. Numer. Anal., 1:3–22, 1981. · Zbl 0469.65020 · doi:10.1093/imanum/1.1.3 |
| [7] | M. G. Cox, P. M. Harris, and H. M. Jones.Strategies for knot placement in least squares data fitting by splines. In Mason and Cox [23], pages 37–45. · Zbl 0745.41008 |
| [8] | M. G. Cox and H. Jones.Shape-preserving spline approximation in the l 1 norm. In J. C. Mason M. G. Cox, editors,Algorithms for approximation, pages 115–129. Clarendon Press, Oxford, 1987. · Zbl 0617.41026 |
| [9] | C. de Boor.Splines as linear combination of B-splines. In G. G. Lorentz, C. K. Chui, and L. L. Schumaker, editors,Approximation Theory II, pages 1–47. Academic Press, New York, 1976. · Zbl 0343.41011 |
| [10] | C. de Boor.A Practical Guide to Splines. Springer, New York, 1978. · Zbl 0406.41003 |
| [11] | L. Eldén.A note on weighted pseudoinverses with application to the regularization of Fredholm integral equations of the first kind. BIT, 22:487–502, 1982. · Zbl 0509.65019 · doi:10.1007/BF01934412 |
| [12] | L. Eldén.An algorithm for the regularization of ill-conditioned banded least squares problems. SIAM J. Sci. Stat. Comput., 5: 237–254, 1984. · Zbl 0546.65014 · doi:10.1137/0905017 |
| [13] | T. Elfving and L.-E. Andersson.An algorithm for computing constrained smoothing spline functions. Numer. Math., 52:583–595, 1988. · Zbl 0622.41006 · doi:10.1007/BF01400893 |
| [14] | F. N. Fritsch.Montoone piecewise cubic data fitting. In Mason and Cox [23], pages 99–106. · Zbl 0743.41007 |
| [15] | R. Hettich and P. Zencke.Numerische Methoden der Approximation und semi-infiniten Optimierung. Teubner, Stuttgart, 1982. · Zbl 0481.65033 |
| [16] | B. Hofmann, R. Hausding, and R. Wolke.Regularization of a Volterra integral equation by linear inequalities. Computing, 43:361–375, 1990. · Zbl 0697.65095 · doi:10.1007/BF02241655 |
| [17] | U. Hornung.Monotone Spline-Interpolation. In L. Collatz, G. Meinardus, and W. Werner, editors,Numerische Methoden der Approximationstheorie, volume 4, ISNM 42, pages 172–191. Birkhäuser, Basel-Stuttgart, 1978. · Zbl 0412.65007 |
| [18] | U. Hornung.Interpolation by smooth functions under restrictions on the derivatives. J. Approx. Theory, 28:227–237, 1980. · Zbl 0432.41001 · doi:10.1016/0021-9045(80)90077-5 |
| [19] | L. D. Irvine, S. P. Marin, and P. W. Smith.Constrained interpolation and smoothing. Constr. Approx., 2:129–151, 1986. · Zbl 0596.41012 · doi:10.1007/BF01893421 |
| [20] | T. Lyche and K. Mørken.A data reduction strategy for splines with applications to the approximation of functions and data. IMA J. Numer. Anal., 8:185–208, 1988. · Zbl 0642.65008 · doi:10.1093/imanum/8.2.185 |
| [21] | T. Lyche and L. L. Schumaker.Computation of smoothing and interpolating natural splines via local bases. SIAM J. Numer. Anal., 10:1027–1038, 1973. · doi:10.1137/0710085 |
| [22] | J. C. Mason and M. G. Cox, editors.Algorithms for Approximation II. Chapman and Hall, London-New York, 1988. |
| [23] | C. A. Michelli, P. W. Smith, J. Swetits, and J. D. Ward.Constrained l p approximation. Constr. Approx., 1:93–102, 1985. · Zbl 0582.41002 · doi:10.1007/BF01890024 |
| [24] | C. H. Reinsch.Smoothing by spline functions. Numer. Math., 10:177–183, 1967. · Zbl 0161.36203 · doi:10.1007/BF02162161 |
| [25] | C. H. Reinsch.Smoothing by spline functions II. Numer. Math., 16:451–454, 1971. · Zbl 1248.65020 · doi:10.1007/BF02169154 |
| [26] | J. W. Schmidt.Beiträge zur konvexen Interpolation, Histopolation und Approximation durch Spline-Funktionen. Mitt. Math. Gesellsch. Hamburg, 12, 1991. · Zbl 0758.41016 |
| [27] | J. W. Schmidt and I. Scholz.A dual algorithm for convex-concave data smoothing by cubic C 2-splines. Numer. Math., 57:333–350, 1990. · Zbl 0702.65017 · doi:10.1007/BF01386414 |
| [28] | I. J. Schoenberg.On interpolation by spline functions and its minimal properties. In P. L. Butzer and J. Korevaar, editors,On Approximation Theory, ISNM 5, pages 109–129. Birkhäuser, Basel-Stuttgart, 1964. · Zbl 0147.32101 |
| [29] | M. von Golitschek and L. L. Schumaker.Data fitting by penalized least squares. In Mason and Cox [23], pages 210–227. · Zbl 0749.41004 |
| [30] | R. Wolke. Lineare Quadratmittelprobleme mit Monotonie- und Konvexitätsnebenbedingungen (LSIMC). Wiss. Z. Pädagog. Hochsch. Halle-Köthen, XXVIII(4):16–24, 1990. · Zbl 0743.65042 |
| [31] | L.-E. Andersson and T. Elfving.An algorithm for constrained approximation. SIAM J. Sci. Stat. Comput., 8:1012–1025, 1987. · Zbl 0632.65008 · doi:10.1137/0908082 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
