Module 501 in TOMS

• TOMS Information

• Components
  • Fullsource from NETLIB

501

 
APPROX/EXCH: subprograms for computing the best polynomial approximation to a
discrete one-dimensional data set in the Chebyshev (minimax) sense. (See J.C.
Simpson, ACM TOMS 2 (1976) pp. 95-97.).
 
Classes  :  K2 . Minimax (L-infinity) approximation
 
Type     : Fortran software in TOMS collection.
Access   : Some uses prohibited. Portable.
Precision: Single.
 
Details  : Fullsource
Sites    : (1) NETLIB
 

Implementation of 501 from TOMS on NETLIB

 
NETLIB:    Public access repository, The University of Tennessee at
           Knoxville and Bell Laboratories
 
Precision: Single.
 
You may access components from NETLIB outside GAMS as follows.
 
   Fullsource   : echo "send 501 from toms" | mail netlib@ornl.gov