Interpolation by a local taut cubic piecewise polynomial (Q1086973): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: J. M. Dowden / rank
Normal rank
 
Property / author
 
Property / author: J. M. Dowden / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: pchip / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical guide to splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Piecewise Cubic Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Order of Monotone Piecewise Cubic Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shape Preserving Quadratic Spline Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation by Convex Quadratic Splines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Computing a Shape-Preserving Osculatory Quadratic Spline / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method of Interpolation and Smooth Curve Fitting Based on Local Procedures / rank
 
Normal rank

Revision as of 18:18, 17 June 2024

scientific article
Language Label Description Also known as
English
Interpolation by a local taut cubic piecewise polynomial
scientific article

    Statements

    Interpolation by a local taut cubic piecewise polynomial (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    local taut cubic piecewise polynomial
    0 references
    ratio slope
    0 references
    monotonicity
    0 references
    convexity
    0 references
    turning points
    0 references