About the Project

strictly%20decreasing

AdvancedHelp

(0.001 seconds)

11—20 of 124 matching pages

11: 21.1 Special Notation
g , h positive integers.
𝛀 g × g complex, symmetric matrix with 𝛀 strictly positive definite, i.e., a Riemann matrix.
12: 10.37 Inequalities; Monotonicity
If ν ( 0 ) is fixed, then throughout the interval 0 < x < , I ν ( x ) is positive and increasing, and K ν ( x ) is positive and decreasing. If x ( > 0 ) is fixed, then throughout the interval 0 < ν < , I ν ( x ) is decreasing, and K ν ( x ) is increasing. …
13: 23.20 Mathematical Applications
The boundary of the rectangle R , with vertices 0 , ω 1 , ω 1 + ω 3 , ω 3 , is mapped strictly monotonically by onto the real line with 0 , ω 1 e 1 , ω 1 + ω 3 e 2 , ω 3 e 3 , 0 . … The two pairs of edges [ 0 , ω 1 ] [ ω 1 , 2 ω 3 ] and [ 2 ω 3 , 2 ω 3 ω 1 ] [ 2 ω 3 ω 1 , 0 ] of R are each mapped strictly monotonically by onto the real line, with 0 , ω 1 e 1 , 2 ω 3 ; similarly for the other pair of edges. …
14: 8 Incomplete Gamma and Related
Functions
15: 28 Mathieu Functions and Hill’s Equation
16: Bibliography G
  • B. Gabutti and B. Minetti (1981) A new application of the discrete Laguerre polynomials in the numerical evaluation of the Hankel transform of a strongly decreasing even function. J. Comput. Phys. 42 (2), pp. 277–287.
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2014) Algorithm 939: computation of the Marcum Q-function. ACM Trans. Math. Softw. 40 (3), pp. 20:1–20:21.
  • Ya. I. Granovskiĭ, I. M. Lutzenko, and A. S. Zhedanov (1992) Mutual integrability, quadratic algebras, and dynamical symmetry. Ann. Phys. 217 (1), pp. 1–20.
  • 17: 18.40 Methods of Computation
    Given the power moments, μ n = a b x n d μ ( x ) , n = 0 , 1 , 2 , , can these be used to find a unique μ ( x ) , a non-decreasing, real, function of x , in the case that the moment problem is determined? Should a unique solution not exist the moment problem is then indeterminant. … Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . …
    18: 8.26 Tables
  • Khamis (1965) tabulates P ( a , x ) for a = 0.05 ( .05 ) 10 ( .1 ) 20 ( .25 ) 70 , 0.0001 x 250 to 10D.

  • Abramowitz and Stegun (1964, pp. 245–248) tabulates E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x = 0 ( .01 ) 2 to 7D; also ( x + n ) e x E n ( x ) for n = 2 , 3 , 4 , 10 , 20 , x 1 = 0 ( .01 ) 0.1 ( .05 ) 0.5 to 6S.

  • Pagurova (1961) tabulates E n ( x ) for n = 0 ( 1 ) 20 , x = 0 ( .01 ) 2 ( .1 ) 10 to 4-9S; e x E n ( x ) for n = 2 ( 1 ) 10 , x = 10 ( .1 ) 20 to 7D; e x E p ( x ) for p = 0 ( .1 ) 1 , x = 0.01 ( .01 ) 7 ( .05 ) 12 ( .1 ) 20 to 7S or 7D.

  • Zhang and Jin (1996, Table 19.1) tabulates E n ( x ) for n = 1 , 2 , 3 , 5 , 10 , 15 , 20 , x = 0 ( .1 ) 1 , 1.5 , 2 , 3 , 5 , 10 , 20 , 30 , 50 , 100 to 7D or 8S.

  • 19: 23 Weierstrass Elliptic and Modular
    Functions
    20: 36 Integrals with Coalescing Saddles