About the Project

sum rules

AdvancedHelp

(0.001 seconds)

11—19 of 19 matching pages

11: 1.11 Zeros of Polynomials
Descartes’ Rule of Signs
1 j < k n z j z k = a n 2 / a n ,
The sum and product of the roots are respectively b / a and c / a . …
12: 13.29 Methods of Computation
In Allasia and Besenghi (1991) and Allasia and Besenghi (1987a) the high accuracy of the trapezoidal rule for the computation of Kummer functions is described. …
13.29.3 e 1 2 z = s = 0 ( 2 μ ) s ( 1 2 + μ κ ) s ( 2 μ ) 2 s s ! ( z ) s y ( s ) ,
13.29.7 z a = s = 0 ( a b + 1 ) s s ! w ( s ) ,
13: 18.40 Methods of Computation
Derivative Rule Approach
An alternate, and highly efficient, approach follows from the derivative rule conjecture, see Yamani and Reinhardt (1975), and references therein, namely that …
See accompanying text
Figure 18.40.2: Derivative Rule inversions for w RCP ( x ) carried out via Lagrange and PWCF interpolations. …For the derivative rule Lagrange interpolation (red points) gives 15 digits in the central region, while PWCF interpolation (blue points) gives 25 . Magnify
Further, exponential convergence in N , via the Derivative Rule, rather than the power-law convergence of the histogram methods, is found for the inversion of Gegenbauer, Attractive, as well as Repulsive, Coulomb–Pollaczek, and Hermite weights and zeros to approximate w ( x ) for these OP systems on x [ 1 , 1 ] and ( , ) respectively, Reinhardt (2018), and Reinhardt (2021b), Reinhardt (2021a). …
14: 3.10 Continued Fractions
can be converted into a continued fraction C of type (3.10.1), and with the property that the n th convergent C n = A n / B n to C is equal to the n th partial sum of the series in (3.10.3), that is, … We continue by means of the rhombus rule
3.10.14 C = k = 0 t k ,
The n th partial sum t 0 + t 1 + + t n 1 equals the n th convergent of (3.10.13), n = 1 , 2 , 3 , . …
15: Bibliography G
  • M. J. Gander and A. H. Karp (2001) Stable computation of high order Gauss quadrature rules using discretization for measures in radiation transfer. J. Quant. Spectrosc. Radiat. Transfer 68 (2), pp. 213–223.
  • W. Gautschi (1994) Algorithm 726: ORTHPOL — a package of routines for generating orthogonal polynomials and Gauss-type quadrature rules. ACM Trans. Math. Software 20 (1), pp. 21–62.
  • A. Gil, J. Segura, and N. M. Temme (2003b) Computing special functions by using quadrature rules. Numer. Algorithms 33 (1-4), pp. 265–275.
  • G. H. Golub and J. H. Welsch (1969) Calculation of Gauss quadrature rules. Math. Comp. 23 (106), pp. 221–230.
  • E. Grosswald (1985) Representations of Integers as Sums of Squares. Springer-Verlag, New York.
  • 16: 4.45 Methods of Computation
    Another method, when x is large, is to sumFor x [ 1 / e , ) the principal branch Wp ( x ) can be computed by solving the defining equation W e W = x numerically, for example, by Newton’s rule3.8(ii)). …
    17: 3.11 Approximation Techniques
    as well as an orthogonal property with respect to sums, as follows. … Then the sum of the truncated expansion equals 1 2 ( u 0 u 2 ) . … The Padé approximants can be computed by Wynn’s cross rule. Any five approximants arranged in the Padé table as … With this choice of a k and f j = f ( x j ) , the corresponding sum (3.11.32) vanishes. …
    18: 3.2 Linear Algebra
    Because of rounding errors, the residual vector 𝐫 = 𝐛 𝐀 𝐱 is nonzero as a rule. …
    𝐱 p = ( j = 1 n | x j | p ) 1 / p , p = 1 , 2 , ,
    𝐀 1 = max 1 k n j = 1 n | a j k | ,
    𝐀 = max 1 j n k = 1 n | a j k | ,
    19: 3.4 Differentiation
    3.4.7 h f t = k = 1 2 B k 3 f k + h R 3 , t , 1 < t < 2 ,
    3.4.11 h f t = k = 2 3 B k 5 f k + h R 5 , t , 2 < t < 3 ,
    3.4.15 h f t = k = 3 4 B k 7 f k + h R 7 , t , 3 < t < 4 ,
    The integral on the right-hand side can be approximated by the composite trapezoidal rule (3.5.2). … As explained in §§3.5(i) and 3.5(ix) the composite trapezoidal rule can be very efficient for computing integrals with analytic periodic integrands. …