About the Project

positive%20definite

AdvancedHelp

(0.002 seconds)

11—20 of 349 matching pages

11: Bibliography W
  • R. S. Ward (1987) The Nahm equations, finite-gap potentials and Lamé functions. J. Phys. A 20 (10), pp. 2679–2683.
  • R. Wong and T. Lang (1991) On the points of inflection of Bessel functions of positive order. II. Canad. J. Math. 43 (3), pp. 628–651.
  • R. Wong (1973b) On uniform asymptotic expansion of definite integrals. J. Approximation Theory 7 (1), pp. 76–86.
  • 12: 35.6 Confluent Hypergeometric Functions of Matrix Argument
    35.6.2 Ψ ( a ; b ; 𝐓 ) = 1 Γ m ( a ) 𝛀 etr ( 𝐓 𝐗 ) | 𝐗 | a 1 2 ( m + 1 ) | 𝐈 + 𝐗 | b a 1 2 ( m + 1 ) d 𝐗 , ( a ) > 1 2 ( m 1 ) , 𝐓 𝛀 .
    35.6.8 𝛀 | 𝐓 | c 1 2 ( m + 1 ) Ψ ( a ; b ; 𝐓 ) d 𝐓 = Γ m ( c ) Γ m ( a c ) Γ m ( c b + 1 2 ( m + 1 ) ) Γ m ( a ) Γ m ( a b + 1 2 ( m + 1 ) ) , ( a ) > ( c ) + 1 2 ( m 1 ) > m 1 , ( c b ) > 1 .
    13: 20 Theta Functions
    Chapter 20 Theta Functions
    14: 35.2 Laplace Transform
    15: 19.31 Probability Distributions
    More generally, let 𝐀 ( = [ a r , s ] ) and 𝐁 ( = [ b r , s ] ) be real positive-definite matrices with n rows and n columns, and let λ 1 , , λ n be the eigenvalues of 𝐀 𝐁 1 . …
    16: 26.2 Basic Definitions
    If the set consists of the integers 1 through n , a permutation σ can be thought of as a rearrangement of these integers where the integer in position j is σ ( j ) . … A partition of a nonnegative integer n is an unordered collection of positive integers whose sum is n . …
    Table 26.2.1: Partitions p ( n ) .
    n p ( n ) n p ( n ) n p ( n )
    3 3 20 627 37 21637
    17: 18.40 Methods of Computation
    In what follows we consider only the simple, illustrative, case that μ ( x ) is continuously differentiable so that d μ ( x ) = w ( x ) d x , with w ( x ) real, positive, and continuous on a real interval [ a , b ] . The strategy will be to: 1) use the moments to determine the recursion coefficients α n , β n of equations (18.2.11_5) and (18.2.11_8); then, 2) to construct the quadrature abscissas x i and weights (or Christoffel numbers) w i from the J-matrix of §3.5(vi), equations (3.5.31) and(3.5.32). … A simple set of choices is spelled out in Gordon (1968) which gives a numerically stable algorithm for direct computation of the recursion coefficients in terms of the moments, followed by construction of the J-matrix and quadrature weights and abscissas, and we will follow this approach: Let N be a positive integer and define …
    18.40.2 a 1 = μ 0 , a n = P 1 , n + 1 P 1 , n P 1 , n 1 , n = 2 , , 2 N + 3 ,
    18.40.3 α 0 = a 2 , α n = a 2 n + 1 + a 2 n + 2 , β n = a 2 n a 2 n + 1 , n = 1 , , N .
    Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . …
    18: 9.11 Products
    §9.11(iii) Integral Representations
    For z n w 1 w 2 d z , z n w 1 w 2 d z , z n w 1 w 2 d z , where n is any positive integer, see Albright (1977). …
    §9.11(v) Definite Integrals
    9.11.19 0 d t Ai 2 ( t ) + Bi 2 ( t ) = 0 t d t Ai 2 ( t ) + Bi 2 ( t ) = π 2 6 .
    For further definite integrals see Prudnikov et al. (1990, §1.8.2), Laurenzi (1993), Reid (1995, 1997a, 1997b), and Vallée and Soares (2010, Chapters 3, 4).
    19: Guide to Searching the DLMF
    Table 1: Query Examples
    Query Matching records contain
    int_$^$ sin any definite integral of sin
  • proximity operator:

    adj, prec/n, and near/n, where n is any positive natural number.

  • Table 2: Wildcard Examples
    Query What it stands for
    int_$^$ sin any definite integral of sin.
    20: 27.6 Divisor Sums
    27.6.1 d | n λ ( d ) = { 1 , n  is a square , 0 , otherwise .
    27.6.2 d | n μ ( d ) f ( d ) = p | n ( 1 f ( p ) ) , n > 1 .
    27.6.6 d | n ϕ k ( d ) ( n d ) k = 1 k + 2 k + + n k ,
    27.6.7 d | n μ ( d ) ( n d ) k = J k ( n ) ,
    27.6.8 d | n J k ( d ) = n k .