About the Project

maximum modulus

AdvancedHelp

(0.002 seconds)

11—20 of 47 matching pages

11: Bibliography K
  • K. S. Kölbig (1981) A Program for Computing the Conical Functions of the First Kind P 1 / 2 + i τ m ( x ) for m = 0 and m = 1 . Comput. Phys. Comm. 23 (1), pp. 51–61.
  • 12: 19.38 Approximations
    Minimax polynomial approximations (§3.11(i)) for K ( k ) and E ( k ) in terms of m = k 2 with 0 m < 1 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 K ( k ) and E ( k ) for 0 < k 1 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 π / 2 with the improvements made in the 1970 reference. …
    13: 22.3 Graphics
    §22.3(iv) Complex k
    See accompanying text
    Figure 22.3.24: sn ( x + i y , k ) for 4 x 4 , 0 y 8 , k = 1 + 1 2 i . … Magnify 3D Help
    See accompanying text
    Figure 22.3.25: sn ( 5 , k ) as a function of complex k 2 , 1 ( k 2 ) 3.5 , 1 ( k 2 ) 1 . … Magnify 3D Help
    See accompanying text
    Figure 22.3.26: Density plot of | sn ( 5 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . … Magnify
    See accompanying text
    Figure 22.3.27: Density plot of | sn ( 10 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . … Magnify
    14: Bibliography D
  • Delft Numerical Analysis Group (1973) On the computation of Mathieu functions. J. Engrg. Math. 7, pp. 39–61.
  • G. Delic (1979a) Chebyshev expansion of the associated Legendre polynomial P L M ( x ) . Comput. Phys. Comm. 18 (1), pp. 63–71.
  • A. R. DiDonato and A. H. Morris (1987) Algorithm 654: Fortran subroutines for computing the incomplete gamma function ratios and their inverses. ACM Trans. Math. Software 13 (3), pp. 318–319.
  • A. R. DiDonato and A. H. Morris (1992) Algorithm 708: Significant digit computation of the incomplete beta function ratios. ACM Trans. Math. Software 18 (3), pp. 360–373.
  • E. Dorrer (1968) Algorithm 322. F-distribution. Comm. ACM 11 (2), pp. 116–117.
  • 15: Bibliography H
  • J. R. Herndon (1961a) Algorithm 55: Complete elliptic integral of the first kind. Comm. ACM 4 (4), pp. 180.
  • J. R. Herndon (1961b) Algorithm 56: Complete elliptic integral of the second kind. Comm. ACM 4 (4), pp. 180–181.
  • G. W. Hill (1970) Algorithm 395: Student’s t-distribution. Comm. ACM 13 (10), pp. 617–619.
  • G. W. Hill (1981) Algorithm 571: Statistics for von Mises’ and Fisher’s distributions of directions: I 1 ( x ) / I 0 ( x ) , I 1.5 ( x ) / I 0.5 ( x ) and their inverses [S14]. ACM Trans. Math. Software 7 (2), pp. 233–238.
  • I. D. Hill (1973) Algorithm AS66: The normal integral. Appl. Statist. 22 (3), pp. 424–427.
  • 16: 36.11 Leading-Order Asymptotics
    36.11.2 Ψ K ( 𝐱 ) = 2 π j = 1 j max ( 𝐱 ) exp ( i ( Φ K ( t j ( 𝐱 ) ; 𝐱 ) + 1 4 π ( 1 ) j + K + 1 ) ) | 2 Φ K ( t j ( 𝐱 ) ; 𝐱 ) t 2 | 1 / 2 ( 1 + o ( 1 ) ) .
    17: 36.7 Zeros
    Inside the cusp, that is, for x 2 < 8 | y | 3 / 27 , the zeros form pairs lying in curved rows. … Just outside the cusp, that is, for x 2 > 8 | y | 3 / 27 , there is a single row of zeros on each side. … Near z = z n , and for small x and y , the modulus | Ψ ( E ) ( 𝐱 ) | has the symmetry of a lattice with a rhombohedral unit cell that has a mirror plane and an inverse threefold axis whose z and x repeat distances are given by …The rings are almost circular (radii close to ( Δ x ) / 9 and varying by less than 1%), and almost flat (deviating from the planes z n by at most ( Δ z ) / 36 ). …There are also three sets of zero lines in the plane z = 0 related by 2 π / 3 rotation; these are zeros of (36.2.20), whose asymptotic form in polar coordinates ( x = r cos θ , y = r sin θ ) is given by …
    18: 1.2 Elementary Algebra
    1.2.23 lim r M ( r ) = max ( a 1 , a 2 , , a n ) ,
    For p j = 1 / n , j = 1 , 2 , , n , …
    1.2.48 𝐯 = max ( | v 1 | , | v 2 | , , | v n | ) .
    A vector of l 2 norm unity is normalized and every non-zero vector 𝐯 can be normalized via 𝐯 𝐯 / 𝐯 . …
    1.2.67 𝐀 = max 𝐱 𝐄 n { 𝟎 } 𝐀 𝐱 𝐱 = max 𝐱 = 1 𝐀 𝐱 .
    19: 16.8 Differential Equations
    Similar definitions apply in the case z 0 = : we transform into the origin by replacing z in (16.8.1) by 1 / z ; again compare §2.7(i). … Equation (16.8.3) is of order max ( p , q + 1 ) . … More generally if z 0 ( ) is an arbitrary constant, | z z 0 | > max ( | z 0 | , | z 0 1 | ) , and | ph ( z 0 z ) | < π , then
    16.8.9 ( k = 1 q + 1 Γ ( a k ) / k = 1 q Γ ( b k ) ) F q q + 1 ( a 1 , , a q + 1 b 1 , , b q ; z ) = j = 1 q + 1 ( z 0 z ) a j n = 0 Γ ( a j + n ) n ! ( k = 1 k j q + 1 Γ ( a k a j n ) / k = 1 q Γ ( b k a j n ) ) F q q + 1 ( a 1 a j n , , a q + 1 a j n b 1 a j n , , b q a j n ; z 0 ) ( z z 0 ) n .
    20: 3.1 Arithmetics and Error Measures
    Let E min E E max with E min < 0 and E max > 0 . …The integers p , E min , and E max are characteristics of the machine. … In the case of the normalized binary interchange formats, the representation of data for binary32 (previously single precision) ( N = 32 , p = 24 , E min = 126 , E max = 127 ), binary64 (previously double precision) ( N = 64 , p = 53 , E min = 1022 , E max = 1023 ) and binary128 (previously quad precision) ( N = 128 , p = 113 , E min = 16382 , E max = 16383 ) are as in Figure 3.1.1. … N min x N max , and …Then rounding by chopping or rounding down of x gives x , with maximum relative error ϵ M . …