computation by quadrature
(0.002 seconds)
11—20 of 31 matching pages
11: 5.21 Methods of Computation
§5.21 Methods of Computation
►An effective way of computing in the right half-plane is backward recurrence, beginning with a value generated from the asymptotic expansion (5.11.3). …For the left half-plane we can continue the backward recurrence or make use of the reflection formula (5.5.3). … ►Another approach is to apply numerical quadrature (§3.5) to the integral (5.9.2), using paths of steepest descent for the contour. … ►For the computation of the -gamma and -beta functions see Gabutti and Allasia (2008).12: 8.25 Methods of Computation
§8.25 Methods of Computation
… ►§8.25(ii) Quadrature
►See Allasia and Besenghi (1987b) for the numerical computation of from (8.6.4) by means of the trapezoidal rule. … ►The computation of and by means of continued fractions is described in Jones and Thron (1985) and Gautschi (1979b, §§4.3, 5). … ►Stable recursive schemes for the computation of are described in Miller (1960) for and integer . …13: 18.39 Applications in the Physical Sciences
…
►For many applications the natural weight functions are non-classical, and thus the OP’s and the determination of the Gaussian quadrature points and weights represent a computational challenge.
…
14: 15.19 Methods of Computation
§15.19 Methods of Computation
… ►For fast computation of with and complex, and with application to Pöschl–Teller–Ginocchio potential wave functions, see Michel and Stoitsov (2008). … ►The representation (15.6.1) can be used to compute the hypergeometric function in the sector . Gauss quadrature approximations are discussed in Gautschi (2002b). … ►The relations in §15.5(ii) can be used to compute , provided that care is taken to apply these relations in a stable manner; see §3.6(ii). …15: 35.10 Methods of Computation
§35.10 Methods of Computation
… ►Other methods include numerical quadrature applied to double and multiple integral representations. See Yan (1992) for the and functions of matrix argument in the case , and Bingham et al. (1992) for Monte Carlo simulation on applied to a generalization of the integral (35.5.8). ►Koev and Edelman (2006) utilizes combinatorial identities for the zonal polynomials to develop computational algorithms for approximating the series expansion (35.8.1). …16: Bibliography S
…
►
A Gaussian quadrature for the calculation of generalized Fermi-Dirac integrals.
Comput. Phys. Comm. 66 (2-3), pp. 271–275.
…
17: Bibliography X
…
►
Prolate spheroidal wavefunctions, quadrature and interpolation.
Inverse Problems 17 (4), pp. 805–838.
►
Variable precision computation of elementary functions.
J. Numer. Methods Comput. Appl. 15 (3), pp. 161–171 (Chinese).
18: 19.36 Methods of Computation
§19.36 Methods of Computation
… ►The computation is slowest for complete cases. … ►Numerical quadrature is slower than most methods for the standard integrals but can be useful for elliptic integrals that have complicated representations in terms of standard integrals. … ►These special theorems are also useful for checking computer codes. … ►19: 3.11 Approximation Techniques
…
►If we have a sufficiently close approximation
…to , then the coefficients can be computed iteratively.
…
►