maximum modulus
(0.002 seconds)
11—20 of 47 matching pages
11: Bibliography K
…
►
A Program for Computing the Conical Functions of the First Kind for and
.
Comput. Phys. Comm. 23 (1), pp. 51–61.
…
12: 19.38 Approximations
…
►Minimax polynomial approximations (§3.11(i)) for and in terms of with can be found in Abramowitz and Stegun (1964, §17.3) with maximum absolute errors ranging from 4×10⁻⁵ to 2×10⁻⁸.
Approximations of the same type for and for are given in Cody (1965a) with maximum absolute errors ranging from 4×10⁻⁵ to 4×10⁻¹⁸.
Cody (1965b) gives Chebyshev-series expansions (§3.11(ii)) with maximum precision 25D.
…
►The accuracy is controlled by the number of terms retained in the approximation; for real variables the number of significant figures appears to be roughly twice the number of terms retained, perhaps even for near with the improvements made in the 1970 reference.
…
13: 22.3 Graphics
14: Bibliography D
…
►
On the computation of Mathieu functions.
J. Engrg. Math. 7, pp. 39–61.
►
Chebyshev expansion of the associated Legendre polynomial
.
Comput. Phys. Comm. 18 (1), pp. 63–71.
…
►
Algorithm 654: Fortran subroutines for computing the incomplete gamma function ratios and their inverses.
ACM Trans. Math. Software 13 (3), pp. 318–319.
►
Algorithm 708: Significant digit computation of the incomplete beta function ratios.
ACM Trans. Math. Software 18 (3), pp. 360–373.
…
►
Algorithm 322. F-distribution.
Comm. ACM 11 (2), pp. 116–117.
…
15: Bibliography H
…
►
Algorithm 55: Complete elliptic integral of the first kind.
Comm. ACM 4 (4), pp. 180.
►
Algorithm 56: Complete elliptic integral of the second kind.
Comm. ACM 4 (4), pp. 180–181.
…
►
Algorithm 395: Student’s t-distribution.
Comm. ACM 13 (10), pp. 617–619.
►
Algorithm 571: Statistics for von Mises’ and Fisher’s distributions of directions: , and their inverses [S14].
ACM Trans. Math. Software 7 (2), pp. 233–238.
►
Algorithm AS66: The normal integral.
Appl. Statist. 22 (3), pp. 424–427.
…
16: 36.11 Leading-Order Asymptotics
…
►
36.11.2
…
17: 36.7 Zeros
…
►Inside the cusp, that is, for , the zeros form pairs lying in curved rows.
…
►Just outside the cusp, that is, for , there is a single row of zeros on each side.
…
►Near , and for small and , the modulus
has the symmetry of a lattice with a rhombohedral unit cell that has a mirror plane and an inverse threefold axis whose and repeat distances are given by
…The rings are almost circular (radii close to and varying by less than 1%), and almost flat (deviating from the planes by at most ).
…There are also three sets of zero lines in the plane related by rotation; these are zeros of (36.2.20), whose asymptotic form in polar coordinates is given by
…
18: 1.2 Elementary Algebra
…
►
1.2.23
…
►For , ,
…
►
1.2.48
…
►A vector of norm unity is normalized and every non-zero vector can be normalized via .
…
►
1.2.67
…
19: 16.8 Differential Equations
…
►Similar definitions apply in the case : we transform into the origin by replacing in (16.8.1) by ; again compare §2.7(i).
…
►Equation (16.8.3) is of order .
…
►
16.8.8
.
►More generally if () is an arbitrary constant, , and , then
►
16.8.9
…
20: 3.1 Arithmetics and Error Measures
…
►Let with and .
…The integers , , and are characteristics of the machine.
…
►In the case of the normalized binary interchange formats, the representation of data for binary32 (previously single precision) (, , , ), binary64 (previously double precision) (, , , ) and binary128 (previously quad precision) (, , , ) are as in Figure 3.1.1.
…
►
, and
…Then rounding by chopping or rounding down of gives , with maximum relative error .
…