FORTRAN 《数值计算的艺术，Numerical Recipes in FORTRAN 77》全套源代码

# Numerical Recipes in Fortran 77 ## Computer Programs by Chapter and Section | sect | program | description | | ----- | -------- | ------------------------------------ | | 1.0 | [`flmoon`](flmoon.f) | calculate phases of the moon by date | | 1.1 | [`julday`](julday.f) | Julian Day number from calendar date | | 1.1 | [`badluk`](badluk.f) | Friday the 13th when the moon is full | | 1.1 | [`caldat`](caldat.f) | calendar date from Julian day number | | 2.1 | [`gaussj`](gaussj.f) | Gauss-Jordan matrix inversion and linear equation solution | | 2.3 | [`ludcmp`](ludcmp.f) | linear equation solution, LU decomposition | | 2.3 | [`lubksb`](lubksb.f) | linear equation solution, backsubstitution | | 2.4 | [`tridag`](tridag.f) | solution of tridiagonal systems | | 2.5 | [`mprove`](mprove.f) | linear equation solution, iterative improvement | | 2.6 | [`svbksb`](svbksb.f) | singular value backsubstitution | | 2.6 | [`svdcmp`](svdcmp.f) | singular value decomposition of a matrix | | 2.8 | [`vander`](vander.f) | solve Vandermonde systems | | 2.8 | [`toeplz`](toeplz.f) | solve Toeplitz systems | | 3.1 | [`polint`](polint.f) | polynomial interpolation | | 3.2 | [`ratint`](ratint.f) | rational function interpolation | | 3.3 | [`spline`](spline.f) | construct a cubic spline | | 3.3 | [`splint`](splint.f) | cubic spline interpolation | | 3.4 | [`locate`](locate.f) | search an ordered table by bisection | | 3.4 | [`hunt `](hunt.f) | search a table when calls are correlated | | 3.5 | [`polcoe`](polcoe.f) | polynomial coefficients from table of values | | 3.5 | [`polcof`](polcof.f) | polynomial coefficients from table of values | | 3.6 | [`polin2`](polin2.f) | two-dimensional polynomial interpolation | | 3.6 | [`bcucof`](bcucof.f) | construct two-dimensional bicubic | | 3.6 | [`bcuint`](bcuint.f) | two-dimensional bicubic interpolation | | 3.6 | [`splie2`](splie2.f) | construct two-dimensional spline | | 3.6 | [`splin2`](splin2.f) | two-dimensional spline interpolation | | 4.2 | [`trapzd`](trapzd.f) | trapezoidal rule | | 4.2 | [`qtrap `](qtrap.f) | integrate using trapezoidal rule | | 4.2 | [`qsimp `](qsimp.f) | integrate using Simpson’s rule | | 4.3 | [`qromb `](qromb.f) | integrate using Romberg adaptive method | | 4.4 | [`midpnt`](midpnt.f) | extended midpoint rule | | 4.4 | [`qromo `](qromo.f) | integrate using open Romberg adaptive method | | 4.4 | [`midinf`](midinf.f) | integrate a function on a semi-infinite interval | | 4.5 | [`qgaus `](qgaus.f) | integrate a function by Gaussian quadratures | | 4.5 | [`gauleg`](gauleg.f) | Gauss-Legendre weights and abscissas | | 4.6 | [`quad3d`](quad3d.f) | integrate a function over a three-dimensional space | | 5.1 | [`eulsum`](eulsum.f) | sum a series by Eulervan Wijngaarden algorithm | | 5.3 | [`ddpoly`](ddpoly.f) | evaluate a polynomial and its derivatives | | 5.3 | [`poldiv`](poldiv.f) | divide one polynomial by another | | 5.8 | [`chebft`](chebft.f) | fit a Chebyshev polynomial to a function | | 5.8 | [`chebev`](chebev.f) | Chebyshev polynomial evaluation | | 5.9 | [`chder `](chder.f) | derivative of a function already Chebyshev fitted | | 5.9 | [`chint `](chint.f) | integrate a function already Chebyshev fitted | | 5.10 | [`chebpc`](chebpc.f) | polynomial coefficients from a Chebyshev fit | | 5.10 | [`pcshft`](pcshft.f) | polynomial coefficients of a shifted polynomial | | 6.1 | [`gammln`](gammln.f) | logarithm of gamma function | | 6.1 | [`factrl`](factrl.f) | factorial function | | 6.1 | [`bico `](bico.f) | binomial coefficients function | | 6.1 | [`factln`](factln.f) | logarithm of factorial function | | 6.1 | [`beta `](beta.f) | beta function | | 6.2 | [`gammp `](gammp.f) | incomplete gamma function | | 6.2 | [`gammq `](gammq.f) | complement of incomplete gamma function | | 6.2 | [`gser `](gser.f) | series used by gammp and gammq | | 6.2 | [`gcf `](gcf.f) | continued fraction used by gammp and gammq | | 6.2 | [`erf `](erf.f) | error function | | 6.2 | [`erfc `](erfc.f) | complementary error function | | 6.2 | [`erfcc `](erfcc.f) | complementary error function, concise routine | | 6.4 | [`betai `](betai.f) | incomplete beta function | | 6.4 | [`betacf`](betacf.f) | continued fraction used by betai | | 6.5 | [`bessj0`](bessj0.f) | Bessel function J0 | | 6.5 | [`bessy0`](bessy0.f) | Bessel function Y0 | | 6.5 | [`bessj1`](bessj1.f) | Bessel function J1 | | 6.5 | [`bessy1`](bessy1.f) | Bessel function Y1 | | 6.5 | [`bessy `](bessy.f) | Bessel function Y of general integer order | | 6.5 | [`bessj `](bessj.f) | Bessel function J of general integer order | | 6.6 | [`bessi0`](bessi0.f) | modified Bessel function I0 | | 6.6 | [`bessk0`](bessk0.f) | modified Bessel function K0 | | 6.6 | [`bessi1`](bessi1.f) | modified Bessel function I1 | | 6.6 | [`bessk1`](bessk1.f) | modified Bessel function K1 | | 6.6 | [`bessk `](bessk.f) | modified Bessel function K of integer order | | 6.6 | [`bessi `](bessi.f) | modified Bessel function I of integer order | | 6.8 | [`plgndr`](plgndr.f) | Legendre polynomials, associated (spherical harmonics) | | 6.11 | [`sncndn`](sncndn.f) | Jacobian elliptic functions | | 7.1 | [`ran0 `](ran0.f) | random deviate by Park and Miller minimal standard | | 7.1 | [`ran1 `](ran1.f) | random deviate, minimal standard plus shuffle | | 7.1 | [`ran2 `](ran2.f) | random deviate by L’Ecuyer long period plus shuffle | | 7.1 | [`ran3 `](ran3.f) | random deviate by Knuth subtractive method | | 7.2 | [`expdev`](expdev.f) | exponential random deviates | | 7.2 | [`gasdev`](gasdev.f) | normally distributed random deviates | | 7.3 | [`gamdev`](gamdev.f) | gamma-law distribution random deviates | | 7.3 | [`poidev`](poidev.f) | Poisson distributed random deviates | | 7.3 | [`bnldev`](bnldev.f) | binomial distributed random deviates | | 7.4 | [`irbit1`](irbit1.f) | random bit sequence | | 7.4 | [`irbit2`](irbit2.f) | random bit sequence | | 7.5 | [`ran4 `](ran4.f) | random deviates from DES-like hashing | | 8.1 | [`piksrt`](piksrt.f) | sort an array by straight insertion | | 8.1 | [`piksr2`](piksr2.f) | sort two arrays by straight insertion | | 8.1 | [`shell `](shell.f) | sort an array by Shell’s method | | 8.2 | [`sort `](sort.f) | sort an array by quicksort method | | 8.2 | [`sort2 `](sort2.f) | sort two arrays by quicksort method | | 8.4 | [`indexx`](indexx.f) | construct an index for an array | | 8.4 | [`sort3 `](sort3.f) | sort, use an index to sort 3 or more arrays | | 8.4 | [`rank `](rank.f) | construct a rank table for an array | | 8.6 | [`eclass`](eclass.f) | determine equivalence classes from list | | 8.6 | [`eclazz`](eclazz.f) | determine equivalence classes from procedure | | 9.0 | [`scrsho`](scrsho.f) | graph a function to search for roots | | 9.1 | [`zbrac `](zbrac.f) | outward search for brackets on roots | | 9.1 | [`zbrak `](zbrak.f) | inward search for brackets on roots | | 9.1 | [`rtbis `](rtbis.f) | find root of a function by bisection | | 9.2 | [`rtflsp`](rtflsp.f) | find root of a function by false-position | | 9.2 | [`rtsec `](rtsec.f) | find root of a function by secant method | | 9.3 | [`zbrent`](zbrent.f) | find root of a function by Brent’s method | | 9.4 | [`rtnewt`](rtnewt.f) | find root of a function by Newton-Raphson | | 9.4 | [`rtsafe`](rtsafe.f) | find root of a function by Newton-Raphson and bisection | | 9.5 | [`laguer`](laguer.f) | find a root of a polynomial by Laguerre’s method | | 9.5 | [`zroots`](zroots.f) | roots of a polynomial by Laguerre’s method with deflation | | 9.5 | [`qroot `](qroot.f) | complex or double root of a polynomial, Bairstow | | 9.6 | [`mnewt `](mnewt.f) | Newton’s method for systems of equations | | 10.1 | [`mnbrak`](mnbrak.f) | bracket the minimu