About the Project

summation by parts

AdvancedHelp

(0.002 seconds)

11—17 of 17 matching pages

11: 2.11 Remainder Terms; Stokes Phenomenon
By integration by parts2.3(i)) … However, regardless whether we can bound the remainder, the accuracy achievable by direct numerical summation of a divergent asymptotic series is always limited. … when p > 0 and | ph z | < 1 2 π , and by analytic continuation for other values of p and z . …
12: Bibliography M
  • J. M. McNamee (2007) Numerical Methods for Roots of Polynomials. Part I. Studies in Computational Mathematics, Vol. 14, Elsevier, Amsterdam.
  • A. R. Miller (1997) A class of generalized hypergeometric summations. J. Comput. Appl. Math. 87 (1), pp. 79–85.
  • S. C. Milne (1985a) A q -analog of the F 4 5 ( 1 ) summation theorem for hypergeometric series well-poised in 𝑆𝑈 ( n ) . Adv. in Math. 57 (1), pp. 14–33.
  • S. C. Milne (1988) A q -analog of the Gauss summation theorem for hypergeometric series in U ( n ) . Adv. in Math. 72 (1), pp. 59–131.
  • S. C. Milne (1997) Balanced Θ 2 3 summation theorems for U ( n ) basic hypergeometric series. Adv. Math. 131 (1), pp. 93–187.
  • 13: Errata
  • §20.10(i)

    The general constraint s > 2 has been extended to s > 1 for (20.10.1), (20.10.2) and to s > 0 for (20.10.3).

  • Equation (25.11.9)

    The constraint which originally read “ s > 1 , 0 < a 1 ” has been extended to be “ s > 0 if 0 < a < 1 ; s > 1 if a = 1 ”.

    Reported by Gergő Nemes on 2021-08-23

  • Equation (25.13.3)

    The constraint which originally read “ 0 < x < 1 , s > 0 ” has been extended to be “ s > 0 if 0 < x < 1 ; s > 1 if x = 1 ”.

    Reported by Gergő Nemes on 2021-09-14

  • Equation (23.18.7)
    23.18.7 s ( d , c ) = r = 1 c 1 r c ( d r c d r c 1 2 ) , c > 0

    Originally the sum r = 1 c 1 was written with an additional condition on the summation, that ( r , c ) = 1 . This additional condition was incorrect and has been removed.

    Reported 2015-10-05 by Howard Cohl and Tanay Wakhare.

  • Equation (26.7.6)
    26.7.6 B ( n + 1 ) = k = 0 n ( n k ) B ( k )

    Originally this equation appeared with B ( n ) in the summation, instead of B ( k ) .

    Reported 2010-11-07 by Layne Watson.

  • 14: 3.11 Approximation Techniques
    When n > 0 and 0 j n , 0 k n , … Here the single prime on the summation symbol means that the first term is to be halved. …
    Summation of Chebyshev Series: Clenshaw’s Algorithm
    Now suppose that X k = 0 when k , that is, the functions ϕ k ( x ) are orthogonal with respect to weighted summation on the discrete set x 1 , x 2 , , x J . … …
    15: 1.17 Integral and Series Representations of the Dirac Delta
    1.17.13 δ ( x a ) = x 0 t J ν ( x t ) J ν ( a t ) d t , ν > 1 , x > 0 , a > 0 ,
    Formal interchange of the order of summation and integration in the Fourier summation formula ((1.8.3) and (1.8.4)): …
    16: Bibliography W
  • J. V. Wehausen and E. V. Laitone (1960) Surface Waves. In Handbuch der Physik, Vol. 9, Part 3, pp. 446–778.
  • E. J. Weniger (1989) Nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series. Computer Physics Reports 10 (5-6), pp. 189–371.
  • 17: 18.20 Hahn Class: Explicit Representations
    Here we use as convention for (16.2.1) with b q = N , a 1 = n , and n = 0 , 1 , , N that the summation on the right-hand side ends at k = n . …