Numerical recipes in C: the art of scientific computing
Open accessAbstract
From the Publisher: This is the 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 (now well over 300 in all), plus upgraded versions of many of the original routines, this book is more than ever the most practical, comprehensive handbook of scientific computing available today. The book retains the informal, easy-to-read style that made the first edition so popular, with many new topics presented at the same accessible level. In addition, some sections of more advanced material have been introduced, set off in small type from the main body of the text. Numerical Recipes is an ideal textbook for scientists and engineers and an indispensable reference for anyone who works in scientific computing. Highlights of the new material include a new chapter on integral equations and inverse methods; multigrid 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; band diagonal linear systems; linear…
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The incomplete gamma function is based on an approximation formula whose origin is described in the Handbook of Applied Mathematical Functions [1] and in the Numerical Recipes in C book [6].
“The incomplete gamma function is based on an approximation formula whose origin is described in the Handbook of Applied Mathematical Functions [1] and in the Numerical Recipes in C book [6].”
From A statistical test suite for random and pseudorandom number generators for cryptographic applications (2010) · cites this paper as [6]
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 4 · Cited by 17,933
- Authors
- Press, W. H., Flannery, B. P., Teukolsky, S. A., & Vetterling, W. T.
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 1993-06-01
- Volume
- 30
- Issue
- 10
- Pages
- 30-5638-30-5638
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W2432517183
- Cited by
- 17,933
- References
- 4
- Citations by year
- 2026: 1 · 2025: 52 · 2024: 90 · 2023: 103 · 2022: 120 · 2021: 211 · 2020: 231 · 2019: 260 · 2018: 322 · 2017: 281 · 2016: 383 · 2015: 507 · 2014: 657 · 2013: 727 · 2012: 778
- Type
- book review
- Language
- en
- Open access
- green
- infoscience.epfl.ch
- Licence
- cc-by-nc-nd
- Locations
- Choice Reviews Online (publishedVersion)
- Virtual Defense Library (Ministerio de Defensa) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
- Topics
- Physical Sciences › Mathematics › Modeling and Simulation › Mathematical and Computational Methods
- Physical Sciences › Mathematics › Applied Mathematics › Mathematical functions and polynomials
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Keywords
- numerical analysis, scientific computing, C programming, numerical algorithms, integral equations, inverse method, multigrid methods, partial differential equations, random number generation, wavelet transform, bootstrapping, sparse matrices, linear algebra, Cholesky decomposition, QR decomposition, numerical differentiation, Padé approximants, rational Chebyshev approximation, special functions, Monte Carlo integration, nonlinear solvers, fast Fourier transform, spectral analysis, Savitzky-Golay filter, Kolmogorov-Smirnov test, arbitrary-precision arithmetic
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review