1nrinfo.doc

Delphi Pascal 数据挖掘领域算法包 数值算法大全

{APPENDIX A: References}{727}

{APPENDIX B: Table of Program Dependencies}{732}

{Index}{737}


{Computer Programs by Chapter and Section}

 1.0      FLMOON  phases of the moon, calculated by date
 1.1      JULDAY  Julian day number, calculated by date
 1.1      BADLUK  Friday the 13th when the moon is full
 1.1      CALDAT  calendar date, calculated from Julian day number

 2.1      GAUSSJ  matrix inversion and linear equation solution, Gauss-Jordan
 2.3      LUDCMP  linear equation solution, $LU$ decomposition
 2.3      LUBKSB  linear equation solution, backsubstitution
 2.6      TRIDAG  linear equation solution, tridiagonal equations
 2.7      MPROVE  linear equation solution, iterative improvement
 2.8      VANDER  linear equation solution, Vandermonde matrices
 2.8      TOEPLZ  linear equation solution, Toeplitz matrices
 2.9      SVDCMP  singular value decomposition of a matrix
 2.9      SVBKSB  singular value backsubstitution
 2.10     SPARSE  linear equation solution, sparse matrix, conjugate-gradient
                  method

 3.1      POLINT  interpolation, polynomial
 3.2      RATINT  interpolation, rational function
 3.3      SPLINE  interpolation, construct a cubic spline
 3.3      SPLINT  interpolation, evaluate a cubic spline
 3.4      LOCATE  search an ordered table, bisection
 3.4      HUNT  search an ordered table, correlated calls
 3.5      POLCOE  polynomial coefficients from a table of values
 3.5      POLCOF  polynomial coefficients from a table of values
 3.6      POLIN2  interpolation, two-dimensional polynomial
 3.6      BCUCOF  interpolation, two-dimensional, construct bicubic
 3.6      BCUINT  interpolation, two-dimensional, evaluate bicubic
 3.6      SPLIE2  interpolation, two-dimensional, construct two-dimensional
                  spline
 3.6      SPLIN2  interpolation, two-dimensional, evaluate two-dimensional
                  spline

 4.2      TRAPZD  integrate a function by trapezoidal rule
 4.2      QTRAP  integrate a function to desired accuracy, trapezoidal rule
 4.2      QSIMP  integrate a function to desired accuracy, Simpson's rule
 4.3      QROMB  integrate a function to desired accuracy, Romberg adaptive 
                 method
 4.4      MIDPNT  integrate a function by extended midpoint rule
 4.4      QROMO  integrate a function to desired accuracy, open Romberg
 4.4      MIDINF  integrate a function on a semi-infinite interval
 4.4      MIDSQL  integrate a function with a square-root singularity
 4.4      MIDSQU  integrate a function with an inverse square-root singularity
 4.4      MIDEXP  integrate a function which decreases exponentially
 4.5      QGAUS  integrate a function by Gaussian quadratures
 4.5      GAULEG  compute Gauss-Legendre weights and abscissas
 4.6      QUAD3D  integrate a function over a three-dimensional space

 5.1      EULSUM  sum a series, Euler--van Wijngaarden algorithm
 5.3      DDPOLY  polynomial, fast evaluation of specified derivatives
 5.3      POLDIV  polynomials, divide one by another
 5.6      CHEBFT  fit a Chebyshev polynomial to a function
 5.6      CHEBEV  Chebyshev polynomial evaluation
 5.7      CHINT  integrate a function already Chebyshev fitted
 5.7      CHDER  derivative of a function already Chebyshev fitted
 5.8      CHEBPC  polynomial coefficients from a Chebyshev fit
 5.8      PCSHFT  polynomial coefficients of a shifted polynomial

 6.1      GAMMLN  logarithm of gamma function
 6.1      FACTRL  factorial function
 6.1      BICO  binomial coefficients function
 6.1      FACTLN  factorial function, logarithm
 6.1      BETA  beta function
 6.2      GAMMP  gamma function, incomplete
 6.2      GAMMQ  gamma function, incomplete, complementary
 6.2      GSER  gamma function, incomplete, series evaluation
 6.2      GCF  gamma function, incomplete, continued fraction evaluation
 6.2      ERF  error function
 6.2      ERFC  error function, complementary
 6.2      ERFCC  error function, complementary, concise routine
 6.3      BETAI  beta function, incomplete
 6.3      BETACF  beta function, incomplete, continued fraction evaluation
 6.4      BESSJ0  Bessel function $J_0$
 6.4      BESSY0  Bessel function $Y_0$
 6.4      BESSJ1  Bessel function $J_1$
 6.4      BESSY1  Bessel function $Y_1$
 6.4      BESSJ  Bessel function $J$ of integer order
 6.4      BESSY  Bessel function $Y$ of integer order
 6.5      BESSI0  Modified Bessel function $I_0$
 6.5      BESSK0  Modified Bessel function $K_0$
 6.5      BESSI1  Modified Bessel function $I_1$
 6.5      BESSK1  Modified Bessel function $K_1$
 6.5      BESSI  Modified Bessel function $I$ of integer order
 6.5      BESSK  Modified Bessel function $K$ of integer order
 6.6      PLGNDR  Legendre polynomials, associated (spherical harmonics)
 6.7      EL2  Elliptic integral of the first and second kinds
 6.7      CEL  Elliptic integrals, complete, all three kinds
 6.7      SNCNDN  Jacobian elliptic functions

 7.1      RAN0  random deviates, improve an existing generator
 7.1      RAN1  random deviates, uniform
 7.1      RAN2  random deviates, uniform
 7.1      RAN3  random deviates, uniform, subtractive method
 7.2      EXPDEV  random deviates, exponential
 7.2      GASDEV  random deviates, normally distributed (Box-Muller)
 7.3      GAMDEV  random deviates, gamma-law distribution
 7.3      POIDEV  random deviates, Poisson distributed
 7.3      BNLDEV  random deviates, binomial distributed
 7.4      IRBIT1  random bit sequence, generate
 7.4      IRBIT2  random bit sequence, generate
 7.5      RAN4  random deviates, uniform, using Data Encryption Standard
 7.5      DES  encryption, using the Data Encryption Standard

 8.1      PIKSRT  sort an array by straight insertion
 8.1      PIKSR2  sort two arrays by straight insertion
 8.1      SHELL  sort an array by Shell's method
 8.2      SORT  sort an array by heapsort method
 8.2      SORT2  sort two arrays by heapsort method
 8.3      INDEXX  sort, construct an index for an array
 8.3      SORT3  sort, use an index to sort 3 or more arrays
 8.3      RANK  sort, construct a rank table for an array
 8.4      QCKSRT  sort an array by quicksort method
 8.5      ECLASS  determine equivalence classes
 8.5      ECLAZZ  determine equivalence classes

 9.0      SCRSHO  graph a function to search for roots
 9.1      ZBRAC  roots of a function, search for brackets on
 9.1      ZBRAK  roots of a function, search for brackets on
 9.1      RTBIS  root of a function, find by bisection
 9.2      RTFLSP  root of a function, find by false-position
 9.2      RTSEC  root of a function, find by secant method
 9.3      ZBRENT  root of a function, find by Brent's method
 9.4      RTNEWT  root of a function, find by Newton-Raphson
 9.4      RTSAFE  root of a function, find by Newton-Raphson and bisection
 9.5      LAGUER  root of a polynomial, Laguerre's method
 9.5      ZROOTS  roots of a polynomial, Laguerre's method with deflation
 9.5      QROOT  root of a polynomial, complex or double, Bairstow
 9.6      MNEWT  nonlinear systems of equations, Newton-Raphson
10.1      MNBRAK  minimum of a function, bracket
10.1      GOLDEN  minimum of a function, find by golden section search
10.2      BRENT  minimum of a function, find by Brent's method
10.3      DBRENT  minimum of a function, find using derivative information
10.4      AMOEBA  minimum of a function, multidimensions, downhill-simplex
10.5      POWELL  minimum of a function, multidimensions, Powell's method
10.5      LINMIN  minimum of a function, along a ray in multidimensions
10.5      F1DIM  minimum of a function, used by {LINMIN}
10.6      FRPRMN  minimum of a function, multidimensions, conjugate-gradient
10.6      DF1DIM  minimum of a function, used by {LINMIN}
10.7      DFPMIN  minimum of a function, multidimensions, variable metric
10.8      SIMPLX  linear programming maximization of a linear function
10.9      ANNEAL  minimize by simulated annealing (traveling salesman problem)

11.1      JACOBI  eigenvalues and eigenvectors of a symmetric matrix
11.1      EIGSRT  eigenvectors, sorts into order by eigenvalue
11.2      TRED2  Householder reduction of a real, symmetric matrix
11.3      TQLI  eigenvalues and eigenvectors of a symmetric tridiagonal matrix
11.5      BALANC  balance a nonsymmetric matrix
11.5      ELMHES  Hessenberg form, reduce a general matrix to
11.6      HQR  eigenvalues of a Hessenberg matrix

12.2      FOUR1  Fourier transform (FFT) in one dimension
12.3      TWOFFT  Fourier transform of two real functions
12.3      REALFT  Fourier transform of a single real function
12.3      SINFT  sine transform using FFT
12.3      COSFT  cosine transform using FFT
12.4      CONVLV  convolution or deconvolution of data using FFT
12.5      CORREL  correlation or autocorrelation of data using FFT
12.7      SPCTRM  power spectrum estimation using FFT
12.8      MEMCOF  power spectrum estimation, evaluate maximum entropy
                  coefficients
12.8      EVLMEM  power spectrum estimation using maximum entropy coefficients
12.10     FIXRTS  roots of a polynomial, reflects inside unit circle
12.10     PREDIC  linear prediction using MEM coefficients
12.11     FOURN  Fourier transform (FFT) in multidimensions

13.1      MOMENT  moments of a data set, calculate
13.2      MDIAN1  median of a data set, calculate by sorting
13.2      MDIAN2  median of a data set, calculate iteratively
13.4      TTEST  Student's t-test for difference of means
13.4      AVEVAR  mean and variance of a data set, calculate
13.4      TUTEST  Student's t-test for means, with unequal variances
13.4      TPTEST  Student's t-test for means, with paired data
13.4      FTEST  F-test for difference of variances
13.5      CHSONE  chi-square test for difference between data and model
13.5      CHSTWO  chi-square test for difference between two data sets
13.5      KSONE  Kolmogorov-Smirnov test of data against model
13.5      KSTWO  Kolmogorov-Smirnov test between two data sets
13.5      PROBKS  Kolmogorov-Smirnov probability function
13.6      CNTAB1  contingency table analysis using chi-square
13.6      CNTAB2  contingency table analysis using entropy measure
13.7      PEARSN  correlation between two data sets, Pearson's
13.8      SPEAR  correlation between two data sets, Spearman's rank
13.8      KENDL1  correlation between two data sets, Kendall's tau
13.8      KENDL2  contingency table analysis using Kendall's tau
13.9      SMOOFT  smooth data using FFT

14.2      FIT  fit data to a straight line, least squares
14.3      LFIT  linear least squares fit, general, normal equations
14.3      COVSRT  covariance matrix, sort, used by {LFIT}
14.3      SVDFIT  linear least squares fit, general, singular value
                  decomposition
14.3      SVDVAR  variances from singular value decomposition
14.3      FPOLY  fit a polynomial, using {LFIT} or {SVDFIT}
14.3      FLEG  fit a Legendre polynomial, using {LFIT} or {SVDFIT}
14.4      MRQMIN  nonlinear least squares fit, Marquardt's method
14.4      FGAUSS  fit a sum of Gaussians, using {MRQMIN}
14.6      MEDFIT  fit data to a straight line robustly, least absolute
                  deviation

15.1      RK4  integrate one step of ODEs, 4th order Runge-Kutta
15.1      RKDUMB  integrate ODEs by 4th order Runge-Kutta
15.2      RKQC  integrate one step of ODEs with accuracy monitoring
15.2      ODEINT  integrate ODEs with accuracy monitoring
15.3      MMID  integrate ODEs by modified midpoint method
15.4      BSSTEP  integrate ODEs, Bulirsch-Stoer step
15.4      RZEXTR  rational function extrapolation, used by {BSSTEP}
15.4      PZEXTR  polynomial extrapolation, used by {BSSTEP}

16.1      SHOOT  two-point boundary value problem, solve by shooting
16.2      SHOOTF  two-point boundary value problem, shooting to a fitting point
16.3      SOLVDE  two-point boundary value problem, solve by relaxation
16.4      SFROID  spheroidal functions, obtain using {SOLVDE}

17.5      SOR  elliptic PDE solved by simultaneous overrelaxation method
17.6      ADI  elliptic PDE solved by alternating direction implicit method