Numerical Recipes in FORTRAN 77: Volume 1, Volume 1 of Fortran Numerical Recipes: The Art of Scientific ComputingThis 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 self-contained 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 "less-numerical" algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easy-to-read 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. |
From inside the book
Results 1-5 of 78
Page 19
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 24
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 47
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 100
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 117
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
Preliminaries | 1 |
Solution of Linear Algebraic Equations | 22 |
Interpolation and Extrapolation | 99 |
Integration of Functions | 123 |
Evaluation of Functions | 159 |
Special Functions | 205 |
Random Numbers | 266 |
Sorting | 320 |
Modeling of Data | 650 |
Integration of Ordinary Differential Equations | 701 |
Two Point Boundary Value Problems | 745 |
Integral Equations and Inverse Theory | 779 |
Partial Differential Equations | 818 |
LessNumerical Algorithms | 881 |
References for Volume 1 | 916 |
C1 Listing of Utility Modules nrtype and nrutil 1361 | 920 |
Root Finding and Nonlinear Sets of Equations | 340 |
Minimization or Maximization of Functions | 387 |
Eigensystems | 449 |
Fast Fourier Transform | 490 |
Fourier and Spectral Applications | 530 |
Statistical Description of Data | 603 |
Other editions - View all
Common terms and phrases
accuracy algorithm approximation array Bessel functions boundary conditions calculation Chapter CITED REFERENCES coefficients column complex components compute continued fraction convergence convolution data points data set decomposition defined derivative deviation diagonal differential equations dimensions discrete Fourier transform distribution DOUBLE PRECISION eigenvalues eigenvectors elements enddo 11 endif enddo estimate evaluated example extrapolation factor Figure filter formula FORTRAN Fourier transform fraction frequency func function value FURTHER READING Gaussian quadrature given goto grid implementation initial input INTEGER interpolation interval inverse iteration linear loop LU decomposition Mathematical matrix maximum minimization multiply Newton's method NMAX nonlinear nonzero normal Numerical Analysis optimal output parameters polynomial problem quadrature random rational function REAL recurrence REFERENCES AND FURTHER return END right-hand side root roundoff error routine sampling sequence signal singular solution solve step stepsize SUBROUTINE theorem tridiagonal variables vector wavelet York zero