Smoothing and Interpolation in a Convex Subset of a Hilbert Space
Authors:
- Charles A. MicchelliCMCharles A. Micchelli
- Florencio I. UtrerasFUFlorencio I. Utreras
- 1 July 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 9 (4) , 728-746
Abstract
Interpolation and smoothing subject to convex constraints is considered. We clarify instances in a Hilbert space when the problem of finding the least norm solution to these problems can be separated into first finding the orthogonal projection onto the constraint set and then fitting the interpolation or smoothing requirements by solving a finite dimensional dual extremal problem. We report on some numerical experiments with this approach for a problem in EXAFS spectroscopy and also relate our results to special cases studied by others.Keywords
This publication has 13 references indexed in Scilit:
- Two-phase regularisation method in Hilbert spaces: description and application to EXAFS problemsInverse Problems, 1988
- Constrained interpolation and smoothingConstructive Approximation, 1986
- A simple constraint qualification in infinite dimensional programmingMathematical Programming, 1986
- Monotonicity Preserving Surface InterpolationSIAM Journal on Numerical Analysis, 1985
- Monotone Piecewise Bicubic InterpolationSIAM Journal on Numerical Analysis, 1985
- Piecewise Rational Quadratic Interpolation to Monotonic DataIMA Journal of Numerical Analysis, 1982
- A New Interpretation of EXAFS Spectra in Real Space: II. A Comparison of the Regularization Technique with the Fourier Transformation MethodPhysica Status Solidi (b), 1981
- Monotone Piecewise Cubic InterpolationSIAM Journal on Numerical Analysis, 1980
- Monotone Spline-Interpolation1978
- Splines minimizing rotation-invariant semi-norms in Sobolev spaces1977