About the Project

.2018年世界杯决赛裁判_『wn4.com_』1998年世界杯怎么了_w6n2c9o_2022年11月29日5时2分36秒_6ogsggucg_cc

AdvancedHelp

(0.005 seconds)

41—50 of 789 matching pages

41: 3.7 Ordinary Differential Equations
The path is partitioned at P + 1 points labeled successively z 0 , z 1 , , z P , with z 0 = a , z P = b . … Write τ j = z j + 1 z j , j = 0 , 1 , , P , expand w ( z ) and w ( z ) in Taylor series (§1.10(i)) centered at z = z j , and apply (3.7.2). … If, for example, β 0 = β 1 = 0 , then on moving the contributions of w ( z 0 ) and w ( z P ) to the right-hand side of (3.7.13) the resulting system of equations is not tridiagonal, but can readily be made tridiagonal by annihilating the elements of 𝐀 P that lie below the main diagonal and its two adjacent diagonals. … The values λ k are the eigenvalues and the corresponding solutions w k of the differential equation are the eigenfunctions. … where h = z n + 1 z n and …
42: 3.6 Linear Difference Equations
Given numerical values of w 0 and w 1 , the solution w n of the equation …These errors have the effect of perturbing the solution by unwanted small multiples of w n and of an independent solution g n , say. … The unwanted multiples of g n now decay in comparison with w n , hence are of little consequence. … The latter method is usually superior when the true value of w 0 is zero or pathologically small. … beginning with e 0 = w 0 . …
43: 18.8 Differential Equations
Table 18.8.1: Classical OP’s: differential equations A ( x ) f ′′ ( x ) + B ( x ) f ( x ) + C ( x ) f ( x ) + λ n f ( x ) = 0 .
# f ( x ) A ( x ) B ( x ) C ( x ) λ n
11 e n 1 x x + 1 L n 1 ( 2 + 1 ) ( 2 n 1 x ) 1 0 2 x ( + 1 ) x 2 1 n 2
12 H n ( x ) 1 2 x 0 2 n
14 𝐻𝑒 n ( x ) 1 x 0 n
Item 11 of Table 18.8.1 yields (18.39.36) for Z = 1 .
44: 3.2 Linear Algebra
where u j = c j , j = 1 , 2 , , n 1 , d 1 = b 1 , and …Forward elimination for solving 𝐀 𝐱 = 𝐟 then becomes y 1 = f 1 , …and back substitution is x n = y n / d n , followed by … Define the Lanczos vectors 𝐯 j and coefficients α j and β j by 𝐯 0 = 𝟎 , a normalized vector 𝐯 1 (perhaps chosen randomly), α 1 = 𝐯 1 T 𝐀 𝐯 1 , β 1 = 0 , and for j = 1 , 2 , , n 1 by the recursive scheme … Start with 𝐯 0 = 𝟎 , vector 𝐯 1 such that 𝐯 1 T 𝐒 𝐯 1 = 1 , α 1 = 𝐯 1 T 𝐀 𝐯 1 , β 1 = 0 . …
45: 24.19 Methods of Computation
Equations (24.5.3) and (24.5.4) enable B n and E n to be computed by recurrence. …For example, the tangent numbers T n can be generated by simple recurrence relations obtained from (24.15.3), then (24.15.4) is applied. … For other information see Chellali (1988) and Zhang and Jin (1996, pp. 1–11). For algorithms for computing B n , E n , B n ( x ) , and E n ( x ) see Spanier and Oldham (1987, pp. 37, 41, 171, and 179–180).
§24.19(ii) Values of B n Modulo p
46: Bibliography O
  • K. Okamoto (1986) Studies on the Painlevé equations. III. Second and fourth Painlevé equations, P II and P IV . Math. Ann. 275 (2), pp. 221–255.
  • A. B. Olde Daalhuis (1998a) Hyperasymptotic solutions of higher order linear differential equations with a singularity of rank one. Proc. Roy. Soc. London Ser. A 454, pp. 1–29.
  • F. W. J. Olver (1974) Error bounds for stationary phase approximations. SIAM J. Math. Anal. 5 (1), pp. 19–29.
  • S. Olver (2011) Numerical solution of Riemann-Hilbert problems: Painlevé II. Found. Comput. Math. 11 (2), pp. 153–179.
  • H. Oser (1960) Algorithm 22: Riccati-Bessel functions of first and second kind. Comm. ACM 3 (11), pp. 600–601.
  • 47: 17.5 ϕ 0 0 , ϕ 0 1 , ϕ 1 1 Functions
    §17.5 ϕ 0 0 , ϕ 0 1 , ϕ 1 1 Functions
    17.5.1 ϕ 0 0 ( ; ; q , z ) = n = 0 ( 1 ) n q ( n 2 ) z n ( q ; q ) n = ( z ; q ) ;
    48: 20.7 Identities
    20.7.6 θ 4 2 ( 0 , q ) θ 1 ( w + z , q ) θ 1 ( w z , q ) = θ 3 2 ( w , q ) θ 2 2 ( z , q ) θ 2 2 ( w , q ) θ 3 2 ( z , q ) ,
    20.7.7 θ 4 2 ( 0 , q ) θ 2 ( w + z , q ) θ 2 ( w z , q ) = θ 4 2 ( w , q ) θ 2 2 ( z , q ) θ 1 2 ( w , q ) θ 3 2 ( z , q ) ,
    20.7.8 θ 4 2 ( 0 , q ) θ 3 ( w + z , q ) θ 3 ( w z , q ) = θ 4 2 ( w , q ) θ 3 2 ( z , q ) θ 1 2 ( w , q ) θ 2 2 ( z , q ) ,
    20.7.10 θ 1 ( 2 z , q ) = 2 θ 1 ( z , q ) θ 2 ( z , q ) θ 3 ( z , q ) θ 4 ( z , q ) θ 2 ( 0 , q ) θ 3 ( 0 , q ) θ 4 ( 0 , q ) .
    20.7.34 θ 1 ( z , q 2 ) θ 3 ( z , q 2 ) θ 1 ( z , i q ) = θ 2 ( z , q 2 ) θ 4 ( z , q 2 ) θ 2 ( z , i q ) = i 1 / 4 θ 2 ( 0 , q 2 ) θ 4 ( 0 , q 2 ) 2 .
    49: 11.14 Tables
  • Abramowitz and Stegun (1964, Chapter 12) tabulates 𝐇 n ( x ) , 𝐇 n ( x ) Y n ( x ) , and I n ( x ) 𝐋 n ( x ) for n = 0 , 1 and x = 0 ( .1 ) 5 , x 1 = 0 ( .01 ) 0.2 to 6D or 7D.

  • Agrest et al. (1982) tabulates 𝐇 n ( x ) and e x 𝐋 n ( x ) for n = 0 , 1 and x = 0 ( .001 ) 5 ( .005 ) 15 ( .01 ) 100 to 11D.

  • Abramowitz and Stegun (1964, Chapter 12) tabulates 0 x ( I 0 ( t ) 𝐋 0 ( t ) ) d t and ( 2 / π ) x t 1 𝐇 0 ( t ) d t for x = 0 ( .1 ) 5 to 5D or 7D; 0 x ( 𝐇 0 ( t ) Y 0 ( t ) ) d t ( 2 / π ) ln x , 0 x ( I 0 ( t ) 𝐋 0 ( t ) ) d t ( 2 / π ) ln x , and x t 1 ( 𝐇 0 ( t ) Y 0 ( t ) ) d t for x 1 = 0 ( .01 ) 0.2 to 6D.

  • Agrest et al. (1982) tabulates 0 x 𝐇 0 ( t ) d t and e x 0 x 𝐋 0 ( t ) d t for x = 0 ( .001 ) 5 ( .005 ) 15 ( .01 ) 100 to 11D.

  • Agrest and Maksimov (1971, Chapter 11) defines incomplete Struve, Anger, and Weber functions and includes tables of an incomplete Struve function 𝐇 n ( x , α ) for n = 0 , 1 , x = 0 ( .2 ) 10 , and α = 0 ( .2 ) 1.4 , 1 2 π , together with surface plots.

  • 50: 3.11 Approximation Techniques
    Beginning with u n + 1 = 0 , u n = c n , we apply … With b 0 = 1 , the last q equations give b 1 , , b q as the solution of a system of linear equations. … (3.11.29) is a system of n + 1 linear equations for the coefficients a 0 , a 1 , , a n . … With this choice of a k and f j = f ( x j ) , the corresponding sum (3.11.32) vanishes. … Two are endpoints: ( x 0 , y 0 ) and ( x 3 , y 3 ) ; the other points ( x 1 , y 1 ) and ( x 2 , y 2 ) are control points. …