About the Project

.%E5%B9%BF%E5%B7%9E%E5%B9%B4%E4%B8%96%E7%95%8C%E6%9D%AF%E7%9C%8B%E7%90%83%E9%85%92%E5%90%A7_%E3%80%8Ewn4.com_%E3%80%8F%E4%B8%96%E7%95%8C%E6%9D%AF%E6%9C%89%E5%A5%B3%E8%B6%B3%E5%90%97_w6n2c9o_2022%E5%B9%B411%E6%9C%8829%E6%97%A57%E6%97%B615%E5%88%8646%E7%A7%92_p5nl57rxz_gov_hk

AdvancedHelp

(0.018 seconds)

21—30 of 602 matching pages

21: 19.9 Inequalities
19.9.3 9 + k 2 k 2 8 < ( 8 + k 2 ) K ( k ) ln ( 4 / k ) < 9.096 .
Further inequalities for K ( k ) and E ( k ) can be found in Alzer and Qiu (2004), Anderson et al. (1992a, b, 1997), and Qiu and Vamanamurthy (1996). … Sharper inequalities for F ( ϕ , k ) are: … Inequalities for both F ( ϕ , k ) and E ( ϕ , k ) involving inverse circular or inverse hyperbolic functions are given in Carlson (1961b, §4). … Other inequalities for F ( ϕ , k ) can be obtained from inequalities for R F ( x , y , z ) given in Carlson (1966, (2.15)) and Carlson (1970) via (19.25.5).
22: 8.4 Special Values
For erf ( z ) , erfc ( z ) , and F ( z ) , see §§7.2(i), 7.2(ii). For E n ( z ) see §8.19(i). …
8.4.4 Γ ( 0 , z ) = z t 1 e t d t = E 1 ( z ) ,
8.4.13 Γ ( 1 n , z ) = z 1 n E n ( z ) ,
8.4.15 Γ ( n , z ) = ( 1 ) n n ! ( E 1 ( z ) e z k = 0 n 1 ( 1 ) k k ! z k + 1 ) = ( 1 ) n n ! ( ψ ( n + 1 ) ln z ) z n k = 0 k n ( z ) k k ! ( k n ) .
23: Software Index
24: 16.7 Relations to Other Functions
For 3 j , 6 j , 9 j symbols see Chapter 34. Further representations of special functions in terms of F q p functions are given in Luke (1969a, §§6.2–6.3), and an extensive list of F q q + 1 functions with rational numbers as parameters is given in Krupnikov and Kölbig (1997).
25: 34.8 Approximations for Large Parameters
§34.8 Approximations for Large Parameters
For large values of the parameters in the 3 j , 6 j , and 9 j symbols, different asymptotic forms are obtained depending on which parameters are large. … For approximations for the 3 j , 6 j , and 9 j symbols with error bounds see Flude (1998), Chen et al. (1999), and Watson (1999): these references also cite earlier work.
26: 24.21 Software
§24.21(ii) B n , B n ( x ) , E n , and E n ( x )
27: 19.5 Maclaurin and Related Expansions
where F 1 2 is the Gauss hypergeometric function (§§15.1 and 15.2(i)). …where F 1 ( α ; β , β ; γ ; x , y ) is an Appell function (§16.13). … Coefficients of terms up to λ 49 are given in Lee (1990), along with tables of fractional errors in K ( k ) and E ( k ) , 0.1 k 2 0.9999 , obtained by using 12 different truncations of (19.5.6) in (19.5.8) and (19.5.9). … Series expansions of F ( ϕ , k ) and E ( ϕ , k ) are surveyed and improved in Van de Vel (1969), and the case of F ( ϕ , k ) is summarized in Gautschi (1975, §1.3.2). For series expansions of Π ( ϕ , α 2 , k ) when | α 2 | < 1 see Erdélyi et al. (1953b, §13.6(9)). …
28: 3.5 Quadrature
If f C 2 m + 2 [ a , b ] , then the remainder E n ( f ) in (3.5.2) can be expanded in the form … About 2 9 = 512 function evaluations are needed. … with weight function w ( x ) , is one for which E n ( f ) = 0 whenever f is a polynomial of degree n 1 . The nodes x 1 , x 2 , , x n are prescribed, and the weights w k and error term E n ( f ) are found by integrating the product of the Lagrange interpolation polynomial of degree n 1 and w ( x ) . … where E n ( f ) = 0 if f ( ζ ) is a polynomial of degree 2 n 1 in 1 / ζ . …
29: 28.6 Expansions for Small q
Leading terms of the of the power series for m = 7 , 8 , 9 , are: … Numerical values of the radii of convergence ρ n ( j ) of the power series (28.6.1)–(28.6.14) for n = 0 , 1 , , 9 are given in Table 28.6.1. … where k is the unique root of the equation 2 E ( k ) = K ( k ) in the interval ( 0 , 1 ) , and k = 1 k 2 . For E ( k ) and K ( k ) see §19.2(ii). …
28.6.22 ce 1 ( z , q ) = cos z 1 8 q cos 3 z + 1 128 q 2 ( 2 3 cos 5 z 2 cos 3 z cos z ) 1 1024 q 3 ( 1 9 cos 7 z 8 9 cos 5 z 1 3 cos 3 z + 2 cos z ) + ,
30: 3.6 Linear Difference Equations
The Weber function 𝐄 n ( 1 ) satisfies …Thus the asymptotic behavior of the particular solution 𝐄 n ( 1 ) is intermediate to those of the complementary functions J n ( 1 ) and Y n ( 1 ) ; moreover, the conditions for Olver’s algorithm are satisfied. We apply the algorithm to compute 𝐄 n ( 1 ) to 8S for the range n = 1 , 2 , , 10 , beginning with the value 𝐄 0 ( 1 ) = 0.56865  663 obtained from the Maclaurin series expansion (§11.10(iii)). … The values of w n for n = 1 , 2 , , 10 are the wanted values of 𝐄 n ( 1 ) . (It should be observed that for n > 10 , however, the w n are progressively poorer approximations to 𝐄 n ( 1 ) : the underlined digits are in error.) …