About the Project

chain rule

AdvancedHelp

(0.001 seconds)

11—20 of 39 matching pages

11: 7.22 Methods of Computation
Additional references are Matta and Reichel (1971) for the application of the trapezoidal rule, for example, to the first of (7.7.2), and Gautschi (1970) and Cuyt et al. (2008) for continued fractions. …
12: 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). …
13: 10.74 Methods of Computation
Newton’s rule3.8(i)) or Halley’s rule3.8(v)) can be used to compute to arbitrarily high accuracy the real or complex zeros of all the functions treated in this chapter. …Newton’s rule is quadratically convergent and Halley’s rule is cubically convergent. …
14: 29.20 Methods of Computation
A second approach is to solve the continued-fraction equations typified by (29.3.10) by Newton’s rule or other iterative methods; see §3.8. …
15: Bibliography R
  • W. P. Reinhardt (2018) Universality properties of Gaussian quadrature, the derivative rule, and a novel approach to Stieltjes inversion.
  • W. P. Reinhardt (2021a) Erratum to:Relationships between the zeros, weights, and weight functions of orthogonal polynomials: Derivative rule approach to Stieltjes and spectral imaging. Computing in Science and Engineering 23 (4), pp. 91.
  • W. P. Reinhardt (2021b) Relationships between the zeros, weights, and weight functions of orthogonal polynomials: Derivative rule approach to Stieltjes and spectral imaging. Computing in Science and Engineering 23 (3), pp. 56–64.
  • K. Rottbrand (2000) Finite-sum rules for Macdonald’s functions and Hankel’s symbols. Integral Transform. Spec. Funct. 10 (2), pp. 115–124.
  • 16: 34.7 Basic Properties: 9 j Symbol
    This equation is the sum rule. It constitutes an addition theorem for the 9 j symbol. …
    17: 1.11 Zeros of Polynomials
    Descartes’ Rule of Signs
    18: 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.
  • 19: 3.7 Ordinary Differential Equations
    The method consists of a set of rules each of which is equivalent to a truncated Taylor-series expansion, but the rules avoid the need for analytic differentiations of the differential equation. … For w = f ( z , w ) the standard fourth-order rule reads … For w ′′ = f ( z , w , w ) the standard fourth-order rule reads …
    20: 6.18 Methods of Computation
    Zeros of Ci ( x ) and si ( x ) can be computed to high precision by Newton’s rule3.8(ii)), using values supplied by the asymptotic expansion (6.13.2) as initial approximations. …