Interpolation by a local taut cubic piecewise polynomial
type: Item
instance of: scholarly article
title: Interpolation by a local taut cubic piecewise polynomial
zbMATH Open document ID: 0609.65007
DOI: 10.1007/BF02278708
author: Michael Davis
author: John Michael Dowden
published in: Computing
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D05
Mathematics Subject Classification ID: 41A10
Mathematics Subject Classification ID: 41-04
zbMATH DE Number: 3986513
zbMATH Keywords: local taut cubic piecewise polynomial
zbMATH Keywords: ratio slope
zbMATH Keywords: monotonicity
zbMATH Keywords: convexity
zbMATH Keywords: turning points
describes a project that uses: pchip
MaRDI profile type: Publication
cites work: A practical guide to splines
cites work: Monotone Piecewise Cubic Interpolation
cites work: The Order of Monotone Piecewise Cubic Interpolation
cites work: On Shape Preserving Quadratic Spline Interpolation
cites work: Interpolation by Convex Quadratic Splines
cites work: An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline
cites work: A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures
full work available at URL: https://doi.org/10.1007/bf02278708
OpenAlex ID: W108718623
description: scientific article; zbMATH DE number 3986513