Numerical Recipes 3rd Edition: The Art of Scientific Computing
By W. Press, Saul A. Teukolsky, W. Vetterling, B. Flannery. 2007
4,975 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- P. Hopkins
- Rachel Mandelbaum
- Joss Bland-Hawthorn
- Yoshua Bengio
- Jo Bovy
- Hans-Walter Rix
- M. Cappellari
- Simon D. M. White
Citations in the corpus
- Machine learning of accurate energy-conserving molecular force fields (2016, methodology): “This was achieved by subsampling f̂− F on a regular grid and numerically projecting it onto the closest conservative vector field by solving Poisson’s equation [26].”
- Inverse Reinforcement Learning in Swarm Systems (2016, methodology): “As a measure of (in)dependence, we used the so-called uncertainty coefficient [24], a normalized version of the mutual information shared between two agents, which tells us the fraction of bits we can predict about one agent’s orientation by observing that of the other.”
- Exploring discriminative pose sub-patterns for effective action classification (2013, methodology): “In this work, we use golden section search [25].”
- NEUTRAL INTERSTELLAR HELIUM PARAMETERS BASED ON IBEX-Lo OBSERVATIONS AND TEST PARTICLE CALCULATIONS (2012, methodology): “We decided to adapt the quasi-Newton method suggested by Press et al. (2007).”
- The Hyper Suprime-Cam Software Pipeline (2017, background): “Linear Predictive Codes (LPC, e.g. Press et al. 2007) are a special case of Gaussian Processes that estimate the value of a signal, in our case an image, based on other data points and a knowledge of the signal’s statistical properties.”
- Flexible Orthogonal Neighborhood Preserving Embedding (2017, methodology): “F and setting it to zero, we have: F = PT B (11) where, B = βX[(I−W)T (I−W) + βI]−1 (12) Then, bringing (11) back to (8), we have: min PT P=I tr(PT QP) (13) where, Q =[B(I−W)T (I−W)BT + β(XXT − XBT − BXT + BBT )] (14) According to Ky Fan′s Theorem [H, 2007], given the value of d which denotes the di”
- Lattice-based Minimum Error Rate Training for Statistical Machine Translation (2008, methodology): “As suggested in (Och, 2003), an alternative method for the optimization of the unsmoothed error count is Powell’s algorithm combined with a grid-based line optimization (Press et al., 2007, p. 509).”
- Demand‐based optimal design of oscillator with parallel‐layout viscous inerter damper (2018, methodology): “Here, to calculate the integrals in the expressions of γU and γFd , a well‐known numerical integration approach called adaptive quadrature([34]) was used by invoking the function quad in the Python numerical package SciPy.”
- Optimal execution with non-linear transient market impact (2014, methodology): “2) (7)We have used different discretization methods to approximate the integral equation, including the product Nystrom method [44] used by Dang.”
- Understanding the Lomb–Scargle Periodogram (2017, background): “A few typical approaches include using the mean of the sampling intervals (e.g. Scargle 1982; Horne & Baliunas 1986; Press et al. 2007), the harmonic mean of the sampling intervals (e.g. Debosscher et al. 2007), the median of the sampling intervals (e.g. Graham et al. 2013b), or the minimum sample…”
- MAM: Masked Acoustic Modeling for End-to-End Speech-to-Text Translation (2020, unknown): “Given a raw audio, we first process the audio with Gaussian low-pass filter (Savitzky and Golay, 1964; Press et al., 2007), and set a threshold upon a normalized, smoothed signal to locate the silence areas.”
- Blind deconvolution in scientific imaging & computational photography (2011, methodology): “The update rules can be computed very efficiently using the Fast Fourier Transform (Press et al., 2007) due to the convolution theorem Fx ≡ f ∗ x = F−1 {F(f) · F(x)} and F x ≡ f ? x = F−1 {F(f)∗ · F(x)} , where F denotes the discrete Fourier transform and ? the n-way correlation between f and x.”
- First order reliability method for time-variant problems using series expansions (2015, methodology): “There are many ways to evaluate the integral in (14), such as the adaptive Simpson’s rule, the adaptive Gaussian quadrature, and other adaptive integration methods (Press 2007).”
- PCG : A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation (2014, background): “In contrast, adding an MCGmultiplication (alone) to an LCG or MCGmakes very little difference to the quality of the output (because two multiplications are identical to one combinedmultiplication), inspiring a rule of thumb that it is better to combine different approaches rather than addmore of the”
- RETIRED A STARS AND THEIR COMPANIONS. III. COMPARING THE MASS–PERIOD DISTRIBUTIONS OF PLANETS AROUND A-TYPE STARS AND SUN-LIKE STARS (2009, background): “These values represent approximate upper and lower one-sigma limits for 12 Similar to, but not to be confused with, Gibbs sampling (Geman & Geman 1984; Press et al. 2007).”