About the Project

in k,k′

AdvancedHelp

(0.053 seconds)

1—10 of 428 matching pages

1: 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⁻¹⁸. …
2: 22.10 Maclaurin Series
22.10.1 sn ( z , k ) = z ( 1 + k 2 ) z 3 3 ! + ( 1 + 14 k 2 + k 4 ) z 5 5 ! ( 1 + 135 k 2 + 135 k 4 + k 6 ) z 7 7 ! + O ( z 9 ) ,
22.10.2 cn ( z , k ) = 1 z 2 2 ! + ( 1 + 4 k 2 ) z 4 4 ! ( 1 + 44 k 2 + 16 k 4 ) z 6 6 ! + O ( z 8 ) ,
§22.10(ii) Maclaurin Series in k and k
The radius of convergence is the distance to the origin from the nearest pole in the complex k -plane in the case of (22.10.4)–(22.10.6), or complex k -plane in the case of (22.10.7)–(22.10.9); see §22.17.
3: 4.14 Definitions and Periodicity
In the zeros of sin z are z = k π , k ; the zeros of cos z are z = ( k + 1 2 ) π , k . … For k
4: 22.17 Moduli Outside the Interval [0,1]
In terms of the coefficients of the power series of §22.10(i), the above equations are polynomial identities in k . … In consequence, the formulas in this chapter remain valid when k is complex. In particular, the Landen transformations in §§22.7(i) and 22.7(ii) are valid for all complex values of k , irrespective of which values of k and k = 1 k 2 are chosen—as long as they are used consistently. …
5: 26.12 Plane Partitions
An equivalent definition is that a plane partition is a finite subset of × × with the property that if ( r , s , t ) π and ( 1 , 1 , 1 ) ( h , j , k ) ( r , s , t ) , then ( h , j , k ) must be an element of π . …It is useful to be able to visualize a plane partition as a pile of blocks, one block at each lattice point ( h , j , k ) π . …
26.12.4 ( h , j , k ) B ( r , s , t ) h + j + k 1 h + j + k 2 = h = 1 r j = 1 s h + j + t 1 h + j 1 .
A plane partition is symmetric if ( h , j , k ) π implies that ( j , h , k ) π . … A plane partition is cyclically symmetric if ( h , j , k ) π implies ( j , k , h ) π . …
6: 24.17 Mathematical Applications
24.17.1 j = a n 1 ( 1 ) j f ( j + h ) = 1 2 k = 0 m 1 E k ( h ) k ! ( ( 1 ) n 1 f ( k ) ( n ) + ( 1 ) a f ( k ) ( a ) ) + R m ( n ) ,
Let 𝒮 n denote the class of functions that have n 1 continuous derivatives on and are polynomials of degree at most n in each interval ( k , k + 1 ) , k . …
24.17.4 S n ( k ) = ( 1 ) k , k .
24.17.6 M n ( k ) = 0 , k .
7: 21.6 Products
that is, 𝒦 is the set of all g × h matrices that are obtained by premultiplying 𝐓 by any g × h matrix with integer elements; two such matrices in 𝒦 are considered equivalent if their difference is a matrix with integer elements. …
21.6.3 j = 1 h θ ( k = 1 h T j k 𝐳 k | 𝛀 ) = 1 𝒟 g 𝐀 𝒦 𝐁 𝒦 e 2 π i tr [ 1 2 𝐀 T 𝛀 𝐀 + 𝐀 T [ 𝐙 + 𝐁 ] ] j = 1 h θ ( 𝐳 j + 𝛀 𝐚 j + 𝐛 j | 𝛀 ) ,
21.6.4 j = 1 h θ [ k = 1 h T j k 𝐜 k k = 1 h T j k 𝐝 k ] ( k = 1 h T j k 𝐳 k | 𝛀 ) = 1 𝒟 g 𝐀 𝒦 𝐁 𝒦 e 2 π i j = 1 h 𝐛 j 𝐜 j j = 1 h θ [ 𝐚 j + 𝐜 j 𝐛 j + 𝐝 j ] ( 𝐳 j | 𝛀 ) ,
8: 22.1 Special Notation
x , y real variables.
k modulus. Except in §§22.3(iv), 22.17, and 22.19, 0 k 1 .
k complementary modulus, k 2 + k 2 = 1 . If k [ 0 , 1 ] , then k [ 0 , 1 ] .
The functions treated in this chapter are the three principal Jacobian elliptic functions sn ( z , k ) , cn ( z , k ) , dn ( z , k ) ; the nine subsidiary Jacobian elliptic functions cd ( z , k ) , sd ( z , k ) , nd ( z , k ) , dc ( z , k ) , nc ( z , k ) , sc ( z , k ) , ns ( z , k ) , ds ( z , k ) , cs ( z , k ) ; the amplitude function am ( x , k ) ; Jacobi’s epsilon and zeta functions ( x , k ) and Z ( x | k ) . …
9: 19.39 Software
In this section we provide links to the research literature describing the implementation of algorithms in software for the evaluation of functions described in this chapter. …References to research software that is available in other ways is listed separately. … Unless otherwise stated, the functions are K ( k ) and E ( k ) , with 0 k 2 ( = m ) 1 . For research software see Bulirsch (1969b, function cel ), Herndon (1961a, b), Merner (1962), Morita (1978, complex modulus k ), and Thacher Jr. (1963). … For research software see Bulirsch (1965b, function el2 ), Bulirsch (1969b, function el3 ), Jefferson (1961), and Neuman (1969a, functions E ( ϕ , k ) and Π ( ϕ , k 2 , k ) ). …
10: 4.8 Identities
where the integer k is chosen so that ( i z ln a ) + 2 k π [ π , π ] . …