Introduction to numerical analysis: 2nd edition

By B. Hildebrand. 1987

How researchers see this paper

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

1. Guilin Sun
2. Richard I. Hartley
3. Francis R. Bach
4. Christopher W. Trueman
5. Yoshua Bengio
6. Julien Mairal
7. Dacheng Tao
8. Arthur Gretton

Citations in the corpus

• On the Equivalence between Kernel Quadrature Rules and Random Feature Expansions (2015, background): “Gaussian quadrature is another class of methods for one-dimensional integrals: it is based on a basis of orthogonal polynomials for L 2 ( dρ ) where dρ is a probability measure supported in an interval, and their zeros (Hildebrand, 1987, Chap.”
• Approximate Crank-Nicolson schemes for the 2-D finite-difference time-domain method for TE/sub z/ waves (2004, methodology): “The CN scheme is a well-known implicit algorithm in numerical computation [7], [8].”
• Lines and Points in Three Views and the Trifocal Tensor (1997, methodology): “We may solve these equations using linear least-squares methods (Press et al., 1988; Atkinson, 1989) to find M ′ = [aij ] and M ′′ = [bij ].”