example
(0.001 seconds)
31—40 of 179 matching pages
31: 25.18 Methods of Computation
32: 26.17 The Twelvefold Way
33: 27.16 Cryptography
…
►For example, a code maker chooses two large primes and of about 400 decimal digits each.
…
34: 27.21 Tables
…
►8 gives examples of primitive roots of all primes ; Table 24.
…
35: 28.19 Expansions in Series of Functions
…
►
Example
…36: 29.20 Methods of Computation
…
►Initial approximations to the eigenvalues can be found, for example, from the asymptotic expansions supplied in §29.7(i).
…
37: 34.8 Approximations for Large Parameters
…
►For example,
…
38: 3.8 Nonlinear Equations
…
►
Example
… ►Example
… ►Example
… ►Example. Wilkinson’s Polynomial
… ►Consider, for example, (3.8.9). …39: 15.19 Methods of Computation
…
►Large values of or , for example, delay convergence of the Gauss series, and may also lead to severe cancellation.
…
►For example, in the half-plane we can use (15.12.2) or (15.12.3) to compute and , where is a large positive integer, and then apply (15.5.18) in the backward direction.
…
40: 21.1 Special Notation
…
►
►
…
►The function is also commonly used; see, for example, Belokolos et al. (1994, §2.5), Dubrovin (1981), and Fay (1973, Chapter 1).
positive integers. | |
… | |
set of all elements of , modulo elements of . Thus two elements of are equivalent if they are both in and their difference is in . (For an example see §20.12(ii).) | |
… |