Numerical Recipes in C++: The Art of Scientific Computing (2nd edn)1 Numerical Recipes Example Book (C++) (2nd edn)2 Numerical Recipes Multi-Language Code CD ROM with LINUX or UNIX Single-Screen…

By W. Press, Saul A. Teukolsky, W. T. Vettering, B. Flannery. 2003

1,798 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/f7f2eb5ae3cac743a109bc707a04f27520310ad6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. P. Hopkins
2. E. Petigura
3. B. Fulton
4. Jo Bovy
5. D. Charbonneau
6. J. Owen
7. Timothy Morton
8. A. Helmi

Citations in the corpus

• A general class of zero-or-one inflated beta regression models (2011, background): “For more details on nonlinear optimization, see Press et al. (1992).”
• A new reconstruction of multivariate normal orthant probabilities (2007, methodology): “As described in detail in section 13.9 of Press et al. (1993), we may increase the accuracy of the calculation of a Fourier integral for a fixed grid spacing by using Filon’s (1928) method for Fourier integrals of continuous functions.”
• Coupling Poisson–Nernst–Planck and density functional theory to calculate ion flux (2002, methodology): “We solve the system of discretized equations using Newton’s method [33] because of its square-convergenceproperties, because it is possible to analytically evaluate the Jacobian (derivative) matrix of the discretized equations, and, most importantly, because iterative methods that did not update all”
• Lucas-Kanade 20 Years On: A Unifying Framework (2004, unknown): “In Section 4 we describe the various gradient descent approximations that can be used in each iteration, Gauss-Newton, Newton, diagonal Hessian, LevenbergMarquardt, and steepest-descent (Press et al., 1992).”
• Privacy-Preserving Analysis of Vertically Partitioned Data Using Secure Matrix Products (2009, unknown): “See Golub and Van Loan (1996) and Press et al. (1992) for details on properties of and algorithms for the QR-decomposition.”
• The California-Kepler Survey. IV. Metal-rich Stars Host a Greater Diversity of Planets (2017, methodology): “Around 20 sub-Saturns have well-measured masses from either RVs or TTVs (see Petigura et al. 2017b for a recent compilation). For sub-Saturns, we observe an order of magnitude scatter in the observed masses at a given size, indicating a diversity in core and envelope masses. While some sub-Saturns h”
• The global modal parameterization for non‐linear model‐order reduction in flexible multibody dynamics (2007, background): “This drawback can be overcome using the family of Lagrange polynomials [40, 41], which have two interesting properties: (i) the interpolation is exact at the data points, (ii) continuity is obtained at every boundary between boxes with matching grid points.”
• Relativistic simulations of rotational core collapse - II. Collapse dynamics and gravitational radiation (2002, methodology): “(1) Here Ω, I, Epot, RS, and R are the (constant) angular velocity, the moment of inertia about the center of mass, the gravitational potential energy, the Schwarzschild radius, and the radius of the star, respectively. The positive constant k depends on the density distribution of the star. Axisymm”
• Spacetime faces: high resolution capture for modeling and animation (2004, methodology): “(9) using the conjugate gradient method [Press et al. 1993] over the whole video is not practical; a 10-second video of 640×480 resolution at 60Hz comprises nearly 180 millions depth variables! To apply global spacetime stereo matching over a long video, we divide the video into a 3D (X,Y,T) array o”
• ATMOSPHERIC ESCAPE FROM HOT JUPITERS (2008, methodology): “This is the same choice adopted by Press et al. (1992).”
• Annual and interannual (ENSO) variability of spatial scaling properties of a vegetation index (NDVI) in Amazonia (2004, methodology): “D Fast Fourier Transform (FFT) algorithms (Press et al., 1992).”
• Implementing digital terrain data in knowledge-aided space-time adaptive processing (2006, methodology): “In order to find solutions for x, y, and z, an iterative Newton-Raphson method [16] was used until the method converged to a solution.”