Module COCOSP in DIERCKX

• DIERCKX Information

• Components
  • Fullsource from NETLIB
  • Source from NETLIB

COCOSP

 
Given the set of data points (x(i),y(i)) and positive weights w(i) this determines
a least-squares cubic spline approximation which satisfies local convexity and
concavity constraints. The user must provide the knot locations. (See P.
Dierckx, Computing 24 (1980) pp. 349-371.).
 
Classes  :  K1a2a . Linearly constrained linear least squares approximation
 
Type     : Fortran subroutine in DIERCKX package.
Access   : Some uses prohibited. Portable.
Precision: Single.
Note     : This module is bundled with other DIERCKX routines : CLOCUR, COCSP,
           CONCUR, CURFIT, PARCUR, PERCUR.
 
Usage    : CALL COCOSP (M, X, Y, W, N, T, E, MAXTR, MAXBIN, C, SQ, SX, BIND, WRK,
           LWRK, IWRK, KWRK, IER)
 
Details  : Fullsource Source
Sites    : (1) NETLIB
 

Implementation of COCOSP from DIERCKX on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
Note     : This module is bundled with other DIERCKX routines : CLOCUR, COCSP,
           CONCUR, CURFIT, PARCUR, PERCUR.
 
You may access components from NETLIB outside GAMS as follows.
 
   Source       : echo 'send only cocosp from dierckx' | mail netlib@ornl.gov
   Fullsource   : echo 'send cocosp from dierckx' | mail netlib@ornl.gov