Interpolation by a local taut cubic piecewise polynomial
From MaRDI portal
(Redirected from Publication:1086973)
The interpolation of a discrete set of data, on the interval [a,b], representing the function g(x) is obtained using a local piecewise polynomial of order 3. This piecewise cubic interpolant has the following properties: monotonicity and/or convexity or turning points that are present in the data are preserved and no extraneous turning points are created. This approximation method is also presented in the form of FORTRAN 77 subroutine.
Recommendations
Cites work
- A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
- A practical guide to splines
- An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
- Interpolation by Convex Quadratic Splines
- Monotone Piecewise Cubic Interpolation
- On Shape Preserving Quadratic Spline Interpolation
- The Order of Monotone Piecewise Cubic Interpolation
Cited in
(5)- Solution of a problem in the theory of laser medicine by the method of lines
- scientific article; zbMATH DE number 3895579 (Why is no real title available?)
- Technical note: piecewise continuous quadratic interpolation
- Piecewise Cubic Curve Fitting Algorithm
- An explicit method of C^ 2 interpolation using splines
This page was built for publication: Interpolation by a local taut cubic piecewise polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086973)