Best Constrained Approximation in Hilbert Space and Interpolation by Cubic Splines Subject to Obstacles
Authors:
- Lars-Erik AnderssonLALars-Erik Andersson
- Tommy ElfvingTETommy Elfving
- 1 September 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 16 (5) , 1209-1232
Abstract
We review a Lagrangian parameter approach to problems of best constrained approximation in Hilbert space. The variable is confined to a closed convex subset of the Hilbert space and is also assumed to satisfy linear equalities. The technique is applied to the problem of interpolation of data in a plane by a cubic spline function which is subject to obstacles. The obstacles may be piecewise cubic polynomials over the original knot set. A characterization result is obtained which is used to develop a Newton-type algorithm for the numerical solution.Keywords
This publication has 20 references indexed in Scilit:
- A general framework of compactly supported splines and waveletsJournal of Approximation Theory, 1992
- Partially finite convex programming, Part II: Explicit lattice modelsMathematical Programming, 1992
- Spectral Estimation Via Convex Programming1992
- Interpolation and approximation by monotone cubic splinesJournal of Approximation Theory, 1991
- A local algorithm for constructing non-negative cubic splinesJournal of Approximation Theory, 1991
- Constrained best approximation in Hilbert spaceConstructive Approximation, 1990
- An Analysis of Two Algorithms for Shape-Preserving Cubic Spline InterpolationIMA Journal of Numerical Analysis, 1989
- An Algorithm for Constrained InterpolationSIAM Journal on Scientific and Statistical Computing, 1987
- Constrained interpolants with minimal Wk,p-normJournal of Approximation Theory, 1987
- Nonlinear Approximation Theory1986