An Algorithm for Constrained Interpolation
Authors:
- Lars-Erik AnderssonLALars-Erik Andersson
- Tommy ElfvingTETommy Elfving
- 1 November 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 8 (6) , 1012-1025
Abstract
A Newton type algorithm is proposed for the solution of the following problem: Find a function of one variable which interpolates given points and whose kth derivative is greater than or equal to a given number $\delta$ and has minimal $L^p $-norm.
Keywords
This publication has 12 references indexed in Scilit:
- Constrained interpolants with minimal Wk,p-normJournal of Approximation Theory, 1987
- Constrained interpolation and smoothingConstructive Approximation, 1986
- ConstrainedL p approximationConstructive Approximation, 1985
- Shape Preserving Piecewise Rational InterpolationSIAM Journal on Scientific and Statistical Computing, 1985
- Convex spline interpolants with minimal curvatureComputing, 1985
- Convex interpolation with minimalL ?-norm of the second derivativeMathematische Zeitschrift, 1984
- Interpolation by smooth functions under restrictions on the derivativesJournal of Approximation Theory, 1980
- Uniform approximation by some Hermite interpolating splinesJournal of Computational and Applied Mathematics, 1978
- Interpolation by convex quadratic splinesMathematics of Computation, 1978
- A Practical Guide to Splines1978