About the Project

%E5%8D%9A%E5%BD%A9%E6%8E%A8%E5%B9%BF%E8%AF%9D%E6%9C%AF,%E5%8D%9A%E5%BD%A9%E6%8E%A8%E5%B9%BF%E6%B8%A0%E9%81%93,%E5%8D%9A%E5%BD%A9%E5%BC%95%E6%B5%81%E6%96%B9%E5%BC%8F,%E3%80%90%E6%89%93%E5%BC%80%E7%BD%91%E5%9D%80%E2%88%B633kk88.com%E3%80%91%E5%8D%9A%E5%BD%A9%E6%8E%A8%E5%B9%BF%E6%8A%80%E5%B7%A7,%E5%8D%9A%E5%BD%A9seo%E6%8E%A8%E5%B9%BF%E6%B8%A0%E9%81%93,%E5%8D%9A%E5%BD%A9%E5%BC%95%E6%B5%81%E6%8A%80%E5%B7%A7,%E5%8D%9A%E5%BD%A9%E5%85%AC%E5%8F%B8%E6%8E%A8%E5%B9%BF%E6%96%B9%E6%B3%95,%E5%8D%9A%E5%BD%A9%E5%AE%A2%E6%88%B7%E8%AF%9D%E6%9C%AF,%E3%80%90%E5%8D%9A%E5%BD%A9%E5%9C%B0%E5%9D%80%E2%88%B633kk88.com%E3%80%91

AdvancedHelp

(0.045 seconds)

21—30 of 603 matching pages

21: 19.36 Methods of Computation
If (19.36.1) is used instead of its first five terms, then the factor ( 3 r ) 1 / 6 in Carlson (1995, (2.2)) is changed to ( 3 r ) 1 / 8 . For both R D and R J the factor ( r / 4 ) 1 / 6 in Carlson (1995, (2.18)) is changed to ( r / 5 ) 1 / 8 when the following polynomial of degree 7 (the same for both) is used instead of its first seven terms: … Accurate values of F ( ϕ , k ) E ( ϕ , k ) for k 2 near 0 can be obtained from R D by (19.2.6) and (19.25.13). … E ( ϕ , k ) can be evaluated by using (19.25.7), and R D by using (19.21.10), but cancellations may become significant. … Near these points there will be loss of significant figures in the computation of R J or R D . …
22: 1.18 Linear Second Order Differential Operators and Eigenfunction Expansions
Assume that 𝒟 ( T ) is dense in V , i. … u λ 𝒟 ( T ) , corresponding to distinct eigenvalues, are orthogonal: i. … This insures the vanishing of the boundary terms in (1.18.26), and also is a choice which indicates that 𝒟 ( T ) = 𝒟 ( T ) , as f ( x ) and g ( x ) satisfy the same boundary conditions and thus define the same domains. … More generally, continuous spectra may occur in sets of disjoint finite intervals [ λ a , λ b ] ( 0 , ) , often called bands, when q ( x ) is periodic, see Ashcroft and Mermin (1976, Ch 8) and Kittel (1996, Ch 7). … , 𝒟 ( T ) 𝒟 ( T ) and T v = T v for v 𝒟 ( T ) . …
23: 3.2 Linear Algebra
Assume that 𝐀 can be factored as in (3.2.5), but without partial pivoting. … where ρ ( 𝐀 𝐀 T ) is the largest of the absolute values of the eigenvalues of the matrix 𝐀 𝐀 T ; see §3.2(iv). … is called the characteristic polynomial of 𝐀 and its zeros are the eigenvalues of 𝐀 . … has the same eigenvalues as 𝐀 . … Many methods are available for computing eigenvalues; see Golub and Van Loan (1996, Chapters 7, 8), Trefethen and Bau (1997, Chapter 5), and Wilkinson (1988, Chapters 8, 9).
24: Bibliography H
  • E. Hairer, S. P. Nørsett, and G. Wanner (1993) Solving Ordinary Differential Equations. I. Nonstiff Problems. 2nd edition, Springer Series in Computational Mathematics, Vol. 8, Springer-Verlag, Berlin.
  • B. A. Hargrave and B. D. Sleeman (1977) Lamé polynomials of large order. SIAM J. Math. Anal. 8 (5), pp. 800–842.
  • H. W. Hethcote (1970) Error bounds for asymptotic approximations of zeros of Hankel functions occurring in diffraction problems. J. Mathematical Phys. 11 (8), pp. 2501–2504.
  • L. E. Hoisington and G. Breit (1938) Calculation of Coulomb wave functions for high energies. Phys. Rev. 54 (8), pp. 627–628.
  • K. Horata (1991) On congruences involving Bernoulli numbers and irregular primes. II. Rep. Fac. Sci. Technol. Meijo Univ. 31, pp. 1–8.
  • 25: 26.3 Lattice Paths: Binomial Coefficients
    Table 26.3.1: Binomial coefficients ( m n ) .
    m n
    0 1 2 3 4 5 6 7 8 9 10
    8 1 8 28 56 70 56 28 8 1
    Table 26.3.2: Binomial coefficients ( m + n m ) for lattice paths.
    m n
    0 1 2 3 4 5 6 7 8
    1 1 2 3 4 5 6 7 8 9
    8 1 9 45 165 495 1287 3003 6435 12870
    26: 31.2 Differential Equations
    31.2.3 d 2 W d z 2 = ( A z + B z 1 + C z a + D z 2 + E ( z 1 ) 2 + F ( z a ) 2 ) W , A + B + C = 0 ,
    F -Homotopic Transformations
    By composing these three steps, there result 2 3 = 8 possible transformations of the dependent variable (including the identity transformation) that preserve the form of (31.2.1). … There are 4 ! = 24 homographies z ~ ( z ) = ( A z + B ) / ( C z + D ) that take 0 , 1 , a , to some permutation of 0 , 1 , a , , where a may differ from a . … There are 8 24 = 192 automorphisms of equation (31.2.1) by compositions of F -homotopic and homographic transformations. …
    27: 3.5 Quadrature
    About 2 9 = 512 function evaluations are needed. … For further information, see Mason and Handscomb (2003, Chapter 8), Davis and Rabinowitz (1984, pp. 74–92), and Clenshaw and Curtis (1960). …
    Table 3.5.3: Nodes and weights for the 20-point Gauss–Legendre formula.
    ± x k w k
    0.07652 65211 33497 33375 5 0.15275 33871 30725 85069 8
    Table 3.5.20: Composite trapezoidal rule for the integral (3.5.45) with λ = 10 .
    h erfc λ n
    0.15 0.20884 87588 72946 ×10⁻⁴⁴ 8
    Table 3.5.21 supplies cubature rules, including weights w j , for the disk D , given by x 2 + y 2 h 2 : …
    28: 10.75 Tables
  • British Association for the Advancement of Science (1937) tabulates J 0 ( x ) , J 1 ( x ) , x = 0 ( .001 ) 16 ( .01 ) 25 , 10D; Y 0 ( x ) , Y 1 ( x ) , x = 0.01 ( .01 ) 25 , 8–9S or 8D. Also included are auxiliary functions to facilitate interpolation of the tables of Y 0 ( x ) , Y 1 ( x ) for small values of x , as well as auxiliary functions to compute all four functions for large values of x .

  • Achenbach (1986) tabulates J 0 ( x ) , J 1 ( x ) , Y 0 ( x ) , Y 1 ( x ) , x = 0 ( .1 ) 8 , 20D or 18–20S.

  • Abramowitz and Stegun (1964, Chapter 9) tabulates j n , m , J n ( j n , m ) , j n , m , J n ( j n , m ) , n = 0 ( 1 ) 8 , m = 1 ( 1 ) 20 , 5D (10D for n = 0 ), y n , m , Y n ( y n , m ) , y n , m , Y n ( y n , m ) , n = 0 ( 1 ) 8 , m = 1 ( 1 ) 20 , 5D (8D for n = 0 ), J 0 ( j 0 , m x ) , m = 1 ( 1 ) 5 , x = 0 ( .02 ) 1 , 5D. Also included are the first 5 zeros of the functions x J 1 ( x ) λ J 0 ( x ) , J 1 ( x ) λ x J 0 ( x ) , J 0 ( x ) Y 0 ( λ x ) Y 0 ( x ) J 0 ( λ x ) , J 1 ( x ) Y 1 ( λ x ) Y 1 ( x ) J 1 ( λ x ) , J 1 ( x ) Y 0 ( λ x ) Y 1 ( x ) J 0 ( λ x ) for various values of λ and λ 1 in the interval [ 0 , 1 ] , 4–8D.

  • Makinouchi (1966) tabulates all values of j ν , m and y ν , m in the interval ( 0 , 100 ) , with at least 29S. These are for ν = 0 ( 1 ) 5 , 10, 20; ν = 3 2 , 5 2 ; ν = m / n with m = 1 ( 1 ) n 1 and n = 3 ( 1 ) 8 , except for ν = 1 2 .

  • Achenbach (1986) tabulates I 0 ( x ) , I 1 ( x ) , K 0 ( x ) , K 1 ( x ) , x = 0 ( .1 ) 8 , 19D or 19–21S.

  • 29: Software Index
    30: 1.12 Continued Fractions
    C n is called the n th approximant or convergent to C . A n and B n are called the n th (canonical) numerator and denominator respectively. … Define … A contraction of a continued fraction C is a continued fraction C whose convergents { C n } form a subsequence of the convergents { C n } of C . Conversely, C is called an extension of C . …