Computer Programs
by Chapter and Section 1.0flmoon calculate phas of the moon by date
1.1julday Julian Day number from calendar date世界最好工作
1.1badluk Friday the13th when the moon is full
1.1caldat calendar date from Julian day number
2.1gaussj Gauss-Jordan matrix inversion and linear equation
solution
2.3ludcmp linear equation solution,LU decomposition
2.3lubksb linear equation solution,backsubstitution
2.4tridag solution of tridiagonal systems
2.4banmul multiply vector by band diagonal matrix
2.4bandec band diagonal systems,decomposition
2.4banbks band diagonal systems,backsubstitution
2.5mprove linear equation solution,iterative improvement 2.6svbksb singular value backsubstitution
2.6svdcmp singular value decomposition of a matrix
2.6pythag calculate(a2+b2)1/2without overflow
2.7cyclic solution of cyclic tridiagonal systems
2.7sprsin convert matrix to spar format
2.7sprsax product of spar matrix and vector
2.7sprstx product of transpo spar matrix and vector
2.7sprstp transpo of spar matrix
2.7sprspm pattern multiply two spar matrices
2.7sprstm threshold multiply two spar matrices
2.7linbcg biconjugate gradient solution of spar systems 2.7snrm ud by linbcg for vector norm
2.7atimes ud by linbcg for spar multiplication
2.7asolve ud by linbcg for preconditioner
2.8vander solve Vandermonde systems
2.8toeplz solve Toeplitz systems
2.9choldc Cholesky decomposition
莲藕的英文2.9cholsl Cholesky backsubstitution
2.10qrdcmp QR decomposition
2.10qrsolv QR backsubstitution
2.10rsolv right triangular backsubstitution
2.10qrupdt update a QR decomposition
2.10rotate Jacobi rotation ud by qrupdt
3.1polint polynomial interpolation
3.2ratint rational function interpolation
3.3spline construct a cubic spline
3.3splint cubic spline interpolation
3.4locate arch an ordered table by biction
xix 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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes books, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).takemedicine
xx Computer Programs by Chapter and Section
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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes books, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).
3.4hunt arch a table when calls are correlated 3.5polcoe polynomial coefficients from table of values 3.5polcof polynomial coefficients from table of values 3.6polin2two-dimensional polynomial interpolation 3.6bcucof construct two-dimensional bicubic 3.6bcuint two-dimensional bicubic interpolation 3.6splie2construct two-dimensional spline 3.6splin2two-dimensional spline interpolation
4.2trapzd trapezoidal rule
4.2qtrap integrate using trapezoidal rule 4.2qsimp integrate using Simpson’s rule
4.3qromb integrate using Romberg adaptive method 4.4midpnt extended midpoint rule
4.4qromo integrate using open Romberg adaptive method 4.4midinf integrate a function on a mi-infinite interval
4.4midsql integrate a function with lower square-root singularity 4.4midsqu integrate a function with upper square-root singularity 4.4midexp integrate a function that decreas exponentially 4.5qgaus integrate a function by Gaussian quadratures 4.5gauleg Gauss-Legendre weights and abscissas 4.5gaulag Gauss-Laguerre weights and abscissas 4.5gauher Gauss-Hermite weights and abscissas 4.5gaujac Gauss-Jacobi weights and abscissas
4.5gaucof quadrature weights from orthogonal polynomials 4.5orthog construct nonclassical orthogonal polynomials 4.6quad3d integrate a function over a three-dimensional space
5.1eulsum sum a ries by Euler–van Wijngaarden algorithm 5.3ddpoly evaluate a polynomial and its derivatives 5.3poldiv divide one polynomial by another 5.3ratval evaluate a rational function
5.7dfridr numerical derivative by Ridders’method 5.8chebft fit a Chebyshev polynomial to a function 5.8chebev Chebyshev polynomial evaluation
5.9chder derivative of a function already Chebyshev fitted 5.9chint integrate a function already Cheb
yshev fitted 5.10chebpc polynomial coefficients from a Chebyshev fit 5.10pcshft polynomial coefficients of a shifted polynomial 5.11pccheb inver of chebpc ;u to economize power ries 5.12pade Pad´e approximant from power ries coefficients 5.13ratlsq rational fit by least-squares method
6.1gammln logarithm of gamma function 6.1factrl factorial function
6.1bico binomial coefficients function 6.1
factln
logarithm of factorial function
Computer Programs by Chapter and Section xxi
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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes bo
oks, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).
6.1beta beta function
6.2gammp incomplete gamma function
6.2gammq complement of incomplete gamma function 6.2gr ries ud by gammp and gammq
6.2gcf continued fraction ud by gammp and gammq 6.2erff error function
6.2erffc complementary error function
6.2erfcc complementary error function,conci routine 6.3expint exponential integral E n 6.3ei exponential integral Ei 6.4betai incomplete beta function
6.4betacf continued fraction ud by betai 6.5bessj0Besl function J 06.5bessy0Besl function Y 06.5bessj1Besl function J 16.5bessy1Besl function Y 1
6.5bessy Besl function Y of general integer order 6.5bessj Besl function J of general integer ord
er 6.6bessi0modified Besl function I 06.6bessk0modified Besl function K 06.6bessi1modified Besl function I 16.6bessk1modified Besl function K 1
6.6bessk modified Besl function K of integer order 6.6bessi modified Besl function I of integer order 6.7bessjy Besl functions of fractional order 6.7beschb Chebyshev expansion ud by bessjy
6.7bessik modified Besl functions of fractional order 6.7airy Airy functions
earth day6.7sphbes spherical Besl functions j n and y n
6.8plgndr Legendre polynomials,associated (spherical harmonics)6.9frenel Fresnel integrals S (x )and C (x )6.9cisi cosine and sine integrals Ci and Si 6.10dawson Dawson’s integral
6.11rf Carlson’s elliptic integral of the first kind 6.11rd Carlson’s elliptic integral of the cond kind 6.11rj Carlson’s elliptic integral of the third kind 6.11rc Carlson’s degenerate elliptic integral 6.11ellf Legendre elliptic integral of the first kind 6.11elle Legendre elliptic integral of the cond kind 6.11ellpi Legendre elliptic integral of the third kind 6.11sncndn Jacobian elliptic functions
6.12hypgeo complex hypergeometric function
6.12hypr complex hypergeometric function,ries evaluation 6.12hypdrv complex hypergeometric function,derivative of
7.1ran0random deviate by Park and Miller minimal standard 7.1
ran1
高中英语教学计划
random deviate,minimal standard plus shuffledrink的过去式和过去分词
xxii Computer Programs by Chapter and Section
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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes books, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).
7.1ran2random deviate by L’Ecuyer long period plus shuffle 7.1ran3random deviate by Knuth subtra
ctive method 7.2expdev exponential random deviates
7.2gasdev normally distributed random deviates 7.3gamdev gamma-law distribution random deviates 7.3poidev Poisson distributed random deviates 7.3bnldev binomial distributed random deviates 7.4irbit1random bit quence 7.4irbit2random bit quence
7.5psdes “pudo-DES”hashing of 64bits
7.5ran4random deviates from DES-like hashing 7.7sobq Sobol’s quasi-random quence
7.8vegas adaptive multidimensional Monte Carlo integration 7.8rebin sample rebinning ud by vegas
7.8mir recursive multidimensional Monte Carlo integration 7.8ranpt get random point,ud by mir
8.1piksrt sort an array by straight inrtion 8.1piksr2sort two arrays by straight inrtion 8.1shell sort an array by Shell’s method 8.2sort sort an array by quicksort method 8.2sort2sort two arrays by quicksort method 8.3hpsort sort an array by heapsort method 8.4indexx construct an index for an array
8.4sort3sort,u an index to sort 3or more arrays 8.4rank construct a rank table for an array 8.5lect find the N th largest in an array
8.5lip find the N th largest,without altering an array 8.5hpl find M largest values,without altering an array 8.6eclass determine equivalence class from list
8.6eclazz determine equivalence class from procedure
9.0scrsho graph a function to arch for roots 9.1zbrac outward arch for brackets on roots 9.1zbrak inward arch for brackets on roots 9.1rtbis find root of a function by biction 9.2rtflsp find root of a function by fal-position 9.2rtc find root of a function by cant method 9.2zriddr find root of a function by Ridders’method 9.3zbrent find root of a function by Brent’s method 9.4rtnewt find root of a function by Newton-Raphson
9.4rtsafe find root of a function by Newton-Raphson and biction 9.5laguer find a root of a polynomial by Laguerre’s method 9.5zroots roots of a polynomial by Laguerre’s method with deflation
9.5zrhqr roots of a polynomial by eigenvalue methods 9.5
qroot
complex or double root of a polynomial,Bairstow
Computer Programs by Chapter and Section xxiii
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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes books, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).
9.6mnewt Newton’s method for systems of equations 9.7lnsrch arch along a line,ud by newt
9.7newt globally convergent multi-dimensional Newton’s method 9.7fdjac finite-difference Jacobian,ud by newt 9.7fmin norm of a vector function,ud by newt 9.7broydn cant method for systems of equations
10.1mnbrak bracket the minimum of a function
10.1golden find minimum of a function by golden ction arch 10.2brent find minimum of a function by Brent’s methodbay
10.3dbrent find minimum of a function using derivative information 10.4amoeba minimize in N -dimensions by downhill simplex method 10.4amotry evaluate a trial point,ud by amoeba
10.5powell minimize in N -dimensions by Powell’s method 10.5linmin minimum of a function along a ray in N -dimensions 10.5f1dim function ud by linmin
10.6frprmn minimize in N -dimensions by conjugate gradient 10.6dlinmin minimum of a function along a ray using derivatives 10.6df1dim function ud by dlinmin
10.7dfpmin minimize in N -dimensions by variable metric method 10.8simplx linear programming maximization of a linear function 10.8simp1linear programming,ud by simplx 10.8simp2linear programming,ud by simplx 10.8simp3linear programming,ud by simplx
10.9anneal traveling salesman problem by simulated annealing 10.9revcst cost of a reversal,ud by anneal 10.9rever do a reversal,ud by anneal
10.9trncst cost of a transposition,ud by anneal 10.9trnspt do a transposition,ud by anneal 10.9metrop Metropolis algorithm,ud by anneal 10.9amebsa simulated annealing in continuous spaces 10.9amotsa evaluate a trial point,ud by amebsa
11.1jacobi eigenvalues and eigenvectors of a symmetric matrix 11.1eigsrt eigenvectors,sorts into order by eigenvalue
11.2tred2Houholder reduction of a real,symmetric matrix 11.3tqli eigensolution of a symmetric tridiagonal matrix 11.5balanc balance a nonsymmetric matrix
11.5elmhes reduce a general matrix to Hesnberg form 11.6hqr eigenvalues of a Hesnberg matrix
12.2four1fast Fourier transform (FFT)in one dimension 12.3twofft fast Fourier transform of two real functions 12.3realft fast Fourier transform of a single real function 12.3sinft fast sine transform
12.3cosft1fast cosine transform with endpoints 12.3
cosft2高考英语作文常用句型
四级总分“staggered”fast cosine transform
xxiv Computer Programs by Chapter and Section
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. P rograms Copyright (C) 1988-1992 by Numerical Recipes Software. Permission is granted for internet urs to make one paper copy for their own personal u. Further reproduction, or any copying of machine-readable files (including this one) to any rver c omputer, is strictly prohibited. To order Numerical Recipes books, d iskettes, or CDROMs visit website or call 1-800-872-7423 (North America only), o r nd email to trade@cup.cam.ac.uk (outside North America).
12.4fourn fast Fourier transform in multidimensions 12.5rlft3FFT of real data in two or three dimensions 12.6fourfs FFT for huge data ts on external media 12.6fourew rewind and permute files,ud by fourfs
13.1convlv convolution or deconvolution of data using FFT 13.2correl correlation or autocorrelation of data using FFT 13.4spctrm power spectrum estimation using FFT
13.6memcof evaluate maximum entropy (MEM)coefficients 13.6fixrts reflect roots of a polynomial into unit circle 13.6predic linear prediction using MEM coefficients
九年级上册英语第一单元
13.7evlmem power spectral estimation from MEM coefficients 13.8period power spectrum of unevenly sampled data
13.8fasper power spectrum of unevenly sampled larger data ts 13.8spread extirpolate value into array,ud by fasper
13.9dftcor compute endpoint corrections for Fourier integrals 13.9dftint high-accuracy Fourier integrals
13.10wt1one-dimensional discrete wavelet transform 13.10daub4Daubechies 4-coefficient wavelet filter 13.10pwtt initialize coefficients for pwt 13.10pwt partial wavelet transform
13.10wtn multidimensional discrete wavelet transform 14.1moment calculate moments of a data t
14.2ttest Student’s t -test for difference of means 14.2avevar calculate mean and variance of a data t
14.2tutest Student’s t -test for means,ca of unequal variances 14.2tptest Student’s t -test for means,ca of paired data 14.2ftest F -test for difference of variances
14.3chsone chi-square test for difference between data and model 14.3chstwo chi-square test for difference between two data ts 14.3ksone Kolmogorov-Smirnov test of data against model 14.3kstwo Kolmogorov-Smirnov test between two data ts 14.3probks Kolmogorov-Smirnov probability function 14.4cntab1contingency table analysis using chi-square
14.4cntab2contingency table analysis using entropy measure 14.5pearsn Pearson’s correlation between two data ts
14.6spear Spearman’s rank correlation between two data ts 14.6crank replaces array elements by their rank
14.6kendl1correlation between two data ts,Kendall’s tau 14.6kendl2contingency table analysis using Kendall’s tau 14.7ks2d1s K–S test in two dimensions,del 14.7quadct count points by quadrants,ud by ks2d1s 14.7quadvl quadrant probabilities,ud by ks2d1s 14.7ks2d2s K–S test in two dimensions,data vs.data 14.8
savgol
Savitzky-Golay smoothing coefficients
