Numerical Recipes in FORTRAN 77: Volume 1, Volume 1 of Fortran Numerical Recipes: The Art of Scientific Computing, Volume 2This is the greatly revised and greatly expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique collaboration among four leading scientists in academic research and industry Numerical Recipes is a complete text and reference book on scientific computing. In a selfcontained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, this new edition remains the most practical, comprehensive handbook of scientific computing available today. Highlights of the new material include: A new chapter on integral equations and inverse methods Multigrid and other methods for solving partial differential equations Improved random number routines  Wavelet transforms The statistical bootstrap method A new chapter on "lessnumerical" algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easytoread style that made the first edition so popular, while introducing some more advanced topics. It is an ideal textbook for scientists and engineers and an indispensable reference for anyone who works in scientific computing. The Second Edition is availabe in FORTRAN, the traditional language for numerical calculations and in the increasingly popular C language. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

LibraryThing Review
User Review  Lyndatrue  LibraryThingThis book save my life so many times during my professional life that I long ago lost count. This is the original book, and all the examples are in FORTRAN, with the PASCAL translations as an appendix ... Read full review
Review: Numerical Recipes in C: The Art of Scientific Computing, Second Edition
User Review  GoodreadsThe book includes many algorithms. I like the texts for background introduction, but not the codes. The code part reads obsolete. It takes a long time for me to get used reading the code. Read full review
Contents
Preliminaries  1 
Solution of Linear Algebraic Equations  22 
Interpolation and Extrapolation  99 
Copyright  
19 other sections not shown
Common terms and phrases
accuracy algorithm Applied approximation array Bessel functions bits boundary conditions bracketing calculation Chapter Chebyshev CITED REFERENCES coefficients column complex components compute continued fraction convergence data points data set decomposition defined derivative deviation diagonal differential equations dimensions discrete Fourier transform distribution DOUBLE PRECISION eigenvalues eigenvectors elements enddo 12 endif enddo estimate evaluated example extrapolation factor Figure filter formula FORTRAN Fourier transform frequency function value FURTHER READING Gaussian Gaussian quadrature give given goto gradient grid implementation input INTEGER interpolation interval inverse iteration loop LU decomposition Mathematical matrix maximum minimization minimum multiply Newton's method nonlinear nonzero normal Numerical Analysis output parameters pivot polynomial problem quadrature random rational function REAL recurrence recurrence relation REFERENCES AND FURTHER return END righthand side root roundoff error routine sampling sequence singular solution solve statistic step stepsize SUBROUTINE tridiagonal variables vector wavelet York zero