About the Project
NIST

interval

AdvancedHelp

(0.001 seconds)

1—10 of 232 matching pages

1: 26.13 Permutations: Cycle Notation
is ( 1 , 3 , 2 , 5 , 7 ) ( 4 ) ( 6 , 8 ) in cycle notation. …In consequence, (26.13.2) can also be written as ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) . … For the example (26.13.2), this decomposition is given by ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) = ( 1 , 3 ) ( 2 , 3 ) ( 2 , 5 ) ( 5 , 7 ) ( 6 , 8 ) . If j < k , then ( j , k ) is a product of 2 k - 2 j - 1 adjacent transpositions: …Again, for the example (26.13.2) a minimal decomposition into adjacent transpositions is given by ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) = ( 2 , 3 ) ( 1 , 2 ) ( 4 , 5 ) ( 3 , 4 ) ( 2 , 3 ) ( 3 , 4 ) ( 4 , 5 ) ( 6 , 7 ) ( 5 , 6 ) ( 7 , 8 ) ( 6 , 7 ) : inv ( ( 1 , 3 , 2 , 5 , 7 ) ( 6 , 8 ) ) = 11 .
2: 7.23 Tables
  • Abramowitz and Stegun (1964, Chapter 7) includes erf x , ( 2 / π ) e - x 2 , x [ 0 , 2 ] , 10D; ( 2 / π ) e - x 2 , x [ 2 , 10 ] , 8S; x e x 2 erfc x , x - 2 [ 0 , 0.25 ] , 7D; 2 n Γ ( 1 2 n + 1 ) i n erfc ( x ) , n = 1 ( 1 ) 6 , 10 , 11 , x [ 0 , 5 ] , 6S; F ( x ) , x [ 0 , 2 ] , 10D; x F ( x ) , x - 2 [ 0 , 0.25 ] , 9D; C ( x ) , S ( x ) , x [ 0 , 5 ] , 7D; f ( x ) , g ( x ) , x [ 0 , 1 ] , x - 1 [ 0 , 1 ] , 15D.

  • Finn and Mugglestone (1965) includes the Voigt function H ( a , u ) , u [ 0 , 22 ] , a [ 0 , 1 ] , 6S.

  • Zhang and Jin (1996, pp. 638, 640–641) includes the real and imaginary parts of erf z , x [ 0 , 5 ] , y = 0.5 ( .5 ) 3 , 7D and 8D, respectively; the real and imaginary parts of x e ± i t 2 d t , ( 1 / π ) e i ( x 2 + ( π / 4 ) ) x e ± i t 2 d t , x = 0 ( .5 ) 20 ( 1 ) 25 , 8D, together with the corresponding modulus and phase to 8D and 6D (degrees), respectively.

  • 3: 14.27 Zeros
    P ν μ ( x ± i 0 ) (either side of the cut) has exactly one zero in the interval ( - , - 1 ) if either of the following sets of conditions holds: …For all other values of the parameters P ν μ ( x ± i 0 ) has no zeros in the interval ( - , - 1 ) . …
    4: 26.15 Permutations: Matrix Notation
    If ( j , k ) B , then σ ( j ) k . The number of derangements of n is the number of permutations with forbidden positions B = { ( 1 , 1 ) , ( 2 , 2 ) , , ( n , n ) } . … For ( j , k ) B , B [ j , k ] denotes B after removal of all elements of the form ( j , t ) or ( t , k ) , t = 1 , 2 , , n . B ( j , k ) denotes B with the element ( j , k ) removed. … Let B = { ( j , j ) , ( j , j + 1 ) |  1 j < n } { ( n , n ) , ( n , 1 ) } . …
    5: 14.16 Zeros
    §14.16(ii) Interval - 1 < x < 1
    The zeros of Q ν μ ( x ) in the interval ( - 1 , 1 ) interlace those of P ν μ ( x ) . …
    §14.16(iii) Interval 1 < x <
    P ν μ ( x ) has exactly one zero in the interval ( 1 , ) if either of the following sets of conditions holds: … Q ν μ ( x ) has no zeros in the interval ( 1 , ) when ν > - 1 , and at most one zero in the interval ( 1 , ) when ν < - 1 .
    6: 3.7 Ordinary Differential Equations
    where A ( τ , z ) is the matrix
    3.7.6 A ( τ , z ) = [ A 11 ( τ , z ) A 12 ( τ , z ) A 21 ( τ , z ) A 22 ( τ , z ) ] ,
    and b ( τ , z ) is the vector … Let ( a , b ) be a finite or infinite interval and q ( x ) be a real-valued continuous (or piecewise continuous) function on the closure of ( a , b ) . … If q ( x ) is C on the closure of ( a , b ) , then the discretized form (3.7.13) of the differential equation can be used. …
    7: 22.17 Moduli Outside the Interval [0,1]
    §22.17 Moduli Outside the Interval [0,1]
    Jacobian elliptic functions with real moduli in the intervals ( - , 0 ) and ( 1 , ) , or with purely imaginary moduli are related to functions with moduli in the interval [ 0 , 1 ] by the following formulas. … For proofs of these results and further information see Walker (2003).
    8: 1.4 Calculus of One Variable
    Suppose f ( x ) is defined on [ a , b ] . … A function f ( x ) is convex on ( a , b ) if …for any c , d ( a , b ) , and t [ 0 , 1 ] . …A similar definition applies to closed intervals [ a , b ] . …
    9: 32.4 Isomonodromy Problems
    32.4.4 A ( z , λ ) = ( 4 λ 4 + 2 w 2 + z ) [ 1 0 0 - 1 ] - i ( 4 λ 2 w + 2 w 2 + z ) [ 0 - i i 0 ] - ( 2 λ w + 1 2 λ ) [ 0 1 1 0 ] ,
    32.4.5 B ( z , λ ) = ( λ + w λ ) [ 1 0 0 - 1 ] - i w λ [ 0 - i i 0 ] .
    32.4.6 A ( z , λ ) = - i ( 4 λ 2 + 2 w 2 + z ) [ 1 0 0 - 1 ] - 2 w [ 0 - i i 0 ] + ( 4 λ w - α λ ) [ 0 1 1 0 ] ,
    32.4.7 B ( z , λ ) = [ - i λ w w i λ ] .
    32.4.8 A ( z , λ ) = [ 1 4 z 0 0 - 1 4 z ] + [ - 1 2 θ u 0 u 1 1 2 θ ] 1 λ + [ v 0 - 1 4 z - v 1 v 0 ( v 0 - 1 2 z ) / v 1 1 4 z - v 0 ] 1 λ 2 ,
    10: 26.6 Other Lattice Path Numbers
    D ( m , n ) is the number of paths from ( 0 , 0 ) to ( m , n ) that are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . … M ( n ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x and are composed of directed line segments of the form ( 2 , 0 ) , ( 0 , 2 ) , or ( 1 , 1 ) . … N ( n , k ) is the number of lattice paths from ( 0 , 0 ) to ( n , n ) that stay on or above the line y = x , are composed of directed line segments of the form ( 1 , 0 ) or ( 0 , 1 ) , and for which there are exactly k occurrences at which a segment of the form ( 0 , 1 ) is followed by a segment of the form ( 1 , 0 ) . … r ( n ) is the number of paths from ( 0 , 0 ) to ( n , n ) that stay on or above the diagonal y = x and are composed of directed line segments of the form ( 1 , 0 ) , ( 0 , 1 ) , or ( 1 , 1 ) . …