asymptotic approximations and expansions
(0.004 seconds)
11—20 of 94 matching pages
11: 35.10 Methods of Computation
…
►For small values of the zonal polynomial expansion given by (35.8.1) can be summed numerically.
For large the asymptotic approximations referred to in §35.7(iv) are available.
…
►Koev and Edelman (2006) utilizes combinatorial identities for the zonal polynomials to develop computational algorithms for approximating the series expansion (35.8.1).
…
12: 2.11 Remainder Terms; Stokes Phenomenon
…
►
§2.11(i) Numerical Use of Asymptotic Expansions
… ► … ►§2.11(iii) Exponentially-Improved Expansions
… ►For another approach see Paris (2001a, b). ►§2.11(vi) Direct Numerical Transformations
…13: 2.4 Contour Integrals
…
►
§2.4(i) Watson’s Lemma
… ►For examples and extensions (including uniformity and loop integrals) see Olver (1997b, Chapter 4), Wong (1989, Chapter 1), and Temme (1985). … ►Furthermore, as , has the expansion (2.3.7). … ►For examples see Olver (1997b, pp. 315–320). ►§2.4(iii) Laplace’s Method
…14: 7.20 Mathematical Applications
…
►
§7.20(i) Asymptotics
►For applications of the complementary error function in uniform asymptotic approximations of integrals—saddle point coalescing with a pole or saddle point coalescing with an endpoint—see Wong (1989, Chapter 7), Olver (1997b, Chapter 9), and van der Waerden (1951). ►The complementary error function also plays a ubiquitous role in constructing exponentially-improved asymptotic expansions and providing a smooth interpretation of the Stokes phenomenon; see §§2.11(iii) and 2.11(iv). … ►For applications in statistics and probability theory, also for the role of the normal distribution functions (the error functions and probability integrals) in the asymptotics of arbitrary probability density functions, see Johnson et al. (1994, Chapter 13) and Patel and Read (1982, Chapters 2 and 3).15: 2.10 Sums and Sequences
…
►