c0-2 (Numerical Recipes in C), страница 2

Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited. To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).7.17.17.27.27.37.37.37.47.47.57.57.77.87.87.87.8Computer Programs by Chapter and SectionxxiiimnewtlnsrchnewtfdjacfminbroydnNewton’s method for systems of equationssearch along a line, used by newtglobally convergent multi-dimensional Newton’s methodfinite-difference Jacobian, used by newtnorm of a vector function, used by newtsecant method for systems of equations10.110.110.210.310.410.410.510.510.510.610.610.610.710.810.810.810.810.910.910.910.910.910.910.910.9mnbrakgoldenbrentdbrentamoebaamotrypowelllinminf1dimfrprmndlinmindf1dimdfpminsimplxsimp1simp2simp3annealrevcstreversetrncsttrnsptmetropamebsaamotsabracket the minimum of a functionfind minimum of a function by golden section searchfind minimum of a function by Brent’s methodfind minimum of a function using derivative informationminimize in N -dimensions by downhill simplex methodevaluate a trial point, used by amoebaminimize in N -dimensions by Powell’s methodminimum of a function along a ray in N -dimensionsfunction used by linminminimize in N -dimensions by conjugate gradientminimum of a function along a ray using derivativesfunction used by dlinminminimize in N -dimensions by variable metric methodlinear programming maximization of a linear functionlinear programming, used by simplxlinear programming, used by simplxlinear programming, used by simplxtraveling salesman problem by simulated annealingcost of a reversal, used by annealdo a reversal, used by annealcost of a transposition, used by annealdo a transposition, used by annealMetropolis algorithm, used by annealsimulated annealing in continuous spacesevaluate a trial point, used by amebsa11.111.111.211.311.511.511.6jacobieigsrttred2tqlibalancelmheshqreigenvalues and eigenvectors of a symmetric matrixeigenvectors, sorts into order by eigenvalueHouseholder reduction of a real, symmetric matrixeigensolution of a symmetric tridiagonal matrixbalance a nonsymmetric matrixreduce a general matrix to Hessenberg formeigenvalues of a Hessenberg matrix12.212.312.312.312.312.3four1twofftrealftsinftcosft1cosft2fast Fourier transform (FFT) in one dimensionfast Fourier transform of two real functionsfast Fourier transform of a single real functionfast sine transformfast cosine transform with endpoints“staggered” fast cosine transformSample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)Copyright (C) 1988-1992 by Cambridge University Press.Programs Copyright (C) 1988-1992 by Numerical Recipes Software.Permission is granted for internet users to make one paper copy for their own personal use.

Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited. To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).9.69.79.79.79.79.7xxivComputer Programs by Chapter and Sectionfournrlft3fourfsfourewfast Fourier transform in multidimensionsFFT of real data in two or three dimensionsFFT for huge data sets on external mediarewind and permute files, used by fourfs13.113.213.413.613.613.613.713.813.813.813.913.913.1013.1013.1013.1013.10convlvcorrelspctrmmemcoffixrtspredicevlmemperiodfasperspreaddftcordftintwt1daub4pwtsetpwtwtnconvolution or deconvolution of data using FFTcorrelation or autocorrelation of data using FFTpower spectrum estimation using FFTevaluate maximum entropy (MEM) coefficientsreflect roots of a polynomial into unit circlelinear prediction using MEM coefficientspower spectral estimation from MEM coefficientspower spectrum of unevenly sampled datapower spectrum of unevenly sampled larger data setsextirpolate value into array, used by faspercompute endpoint corrections for Fourier integralshigh-accuracy Fourier integralsone-dimensional discrete wavelet transformDaubechies 4-coefficient wavelet filterinitialize coefficients for pwtpartial wavelet transformmultidimensional discrete wavelet transform14.114.214.214.214.214.214.314.314.314.314.314.414.414.514.614.614.614.614.714.714.714.714.8momentttestavevartutesttptestftestchsonechstwoksonekstwoprobkscntab1cntab2pearsnspearcrankkendl1kendl2ks2d1squadctquadvlks2d2ssavgolcalculate moments of a data setStudent’s t-test for difference of meanscalculate mean and variance of a data setStudent’s t-test for means, case of unequal variancesStudent’s t-test for means, case of paired dataF -test for difference of varianceschi-square test for difference between data and modelchi-square test for difference between two data setsKolmogorov-Smirnov test of data against modelKolmogorov-Smirnov test between two data setsKolmogorov-Smirnov probability functioncontingency table analysis using chi-squarecontingency table analysis using entropy measurePearson’s correlation between two data setsSpearman’s rank correlation between two data setsreplaces array elements by their rankcorrelation between two data sets, Kendall’s taucontingency table analysis using Kendall’s tauK–S test in two dimensions, data vs.

modelcount points by quadrants, used by ks2d1squadrant probabilities, used by ks2d1sK–S test in two dimensions, data vs. dataSavitzky-Golay smoothing coefficientsSample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)Copyright (C) 1988-1992 by Cambridge University Press.Programs Copyright (C) 1988-1992 by Numerical Recipes Software.Permission is granted for internet users to make one paper copy for their own personal use. Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited.

To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).12.412.512.612.6Computer Programs by Chapter and Sectionxxvfitfitexychixylfitcovsrtsvdfitsvdvarfpolyflegmrqminmrqcoffgaussmedfitrofuncleast-squares fit data to a straight linefit data to a straight line, errors in both x and yused by fitexy to calculate a χ2general linear least-squares fit by normal equationsrearrange covariance matrix, used by lfitlinear least-squares fit by singular value decompositionvariances from singular value decompositionfit a polynomial using lfit or svdfitfit a Legendre polynomial using lfit or svdfitnonlinear least-squares fit, Marquardt’s methodused by mrqmin to evaluate coefficientsfit a sum of Gaussians using mrqminfit data to a straight line robustly, least absolute deviationfit data robustly, used by medfit16.116.116.216.216.216.316.416.416.416.516.616.616.616.616.6rk4rkdumbrkqsrkckodeintmmidbssteppzextrrzextrstoermstiffjacobnderivssimprstifbsintegrate one step of ODEs, fourth-order Runge-Kuttaintegrate ODEs by fourth-order Runge-Kuttaintegrate one step of ODEs with accuracy monitoringCash-Karp-Runge-Kutta step used by rkqsintegrate ODEs with accuracy monitoringintegrate ODEs by modified midpoint methodintegrate ODEs, Bulirsch-Stoer steppolynomial extrapolation, used by bssteprational function extrapolation, used by bsstepintegrate conservative second-order ODEsintegrate stiff ODEs by fourth-order Rosenbrocksample Jacobian routine for stiffsample derivatives routine for stiffintegrate stiff ODEs by semi-implicit midpoint ruleintegrate stiff ODEs, Bulirsch-Stoer step17.117.217.317.317.317.317.417.417.417.4shootshootfsolvdebksubpinvsredsfroiddifeqsphootsphfptsolve two point boundary value problem by shootingditto, by shooting to a fitting pointtwo point boundary value problem, solve by relaxationbacksubstitution, used by solvdediagonalize a sub-block, used by solvdereduce columns of a matrix, used by solvdespheroidal functions by method of solvdespheroidal matrix coefficients, used by sfroidspheroidal functions by method of shootspheroidal functions by method of shootf18.118.118.218.318.3fred2fredinvoltrawwghtskermomsolve linear Fredholm equations of the second kindinterpolate solutions obtained with fred2linear Volterra equations of the second kindquadrature weights for an arbitrarily singular kernelsample routine for moments of a singular kernelSample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)Copyright (C) 1988-1992 by Cambridge University Press.Programs Copyright (C) 1988-1992 by Numerical Recipes Software.Permission is granted for internet users to make one paper copy for their own personal use.

Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited. To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).15.215.315.315.415.415.415.415.415.415.515.515.515.715.7xxviComputer Programs by Chapter and Sectionquadmxfredexsample routine for a quadrature matrixexample of solving a singular Fredholm equation19.519.619.619.619.619.619.619.619.619.619.619.619.619.619.619.619.6sormglinrstrctinterpaddintslvsmlrelaxresidcopyfill0mgfasrelax2slvsm2lopmataddmatsubanorm2elliptic PDE solved by successive overrelaxation methodlinear elliptic PDE solved by multigrid methodhalf-weighting restriction, used by mglin, mgfasbilinear prolongation, used by mglin, mgfasinterpolate and add, used by mglinsolve on coarsest grid, used by mglinGauss-Seidel relaxation, used by mglincalculate residual, used by mglinutility used by mglin, mgfasutility used by mglinnonlinear elliptic PDE solved by multigrid methodGauss-Seidel relaxation, used by mgfassolve on coarsest grid, used by mgfasapplies nonlinear operator, used by mgfasutility used by mgfasutility used by mgfasutility used by mgfas20.120.220.320.320.320.420.420.420.420.520.520.520.620.620.620.620.620.620.6macharigrayicrc1icrcdecchkhufmakhufapphufenchufdecarcmakarcodearcsummpopsmpmulmpinvmpdivmpsqrtmp2dfrmppidiagnose computer’s floating arithmeticGray code and its inversecyclic redundancy checksum, used by icrccyclic redundancy checksumdecimal check digit calculation or verificationconstruct a Huffman codeappend bits to a Huffman code, used by hufmakuse Huffman code to encode and compress a characteruse Huffman code to decode and decompress a characterconstruct an arithmetic codeencode or decode a character using arithmetic codingadd integer to byte string, used by arcodemultiple precision arithmetic, simpler operationsmultiple precision multiply, using FFT methodsmultiple precision reciprocalmultiple precision divide and remaindermultiple precision square rootmultiple precision conversion to decimal basemultiple precision example, compute many digits of πSample page from NUMERICAL RECIPES IN C: THE ART OF SCIENTIFIC COMPUTING (ISBN 0-521-43108-5)Copyright (C) 1988-1992 by Cambridge University Press.Programs Copyright (C) 1988-1992 by Numerical Recipes Software.Permission is granted for internet users to make one paper copy for their own personal use.

Further reproduction, or any copying of machinereadable files (including this one) to any servercomputer, is strictly prohibited. To order Numerical Recipes books,diskettes, or CDROMsvisit website http://www.nr.com or call 1-800-872-7423 (North America only),or send email to trade@cup.cam.ac.uk (outside North America).18.318.3.