L?H�pital rule

SearchAdvancedHelp

(0.025 seconds)

1—10 of 36 matching pages

1: 37.20 Mathematical Applications

… ►A minimal cubature rule is a numerical integration rule that uses the smallest number of nodes among cubature rules of the same degree. The nodes of these cubature rules are closely related to common zeros of OPs and they are often good points for polynomial interpolation. Although Gaussian cubature rules rarely exist and they do not exist for centrally symmetric domains, minimal or near minimal cubature rules on the unit square are known and provide efficient numerical integration rules. …

2: 3.5 Quadrature

… ►

§3.5(i) Trapezoidal Rules

… ►The composite trapezoidal rule is … ►

§3.5(ii) Simpson’s Rule

… ►

§3.5(iv) Interpolatory Quadrature Rules

… ► …

3: 3.8 Nonlinear Equations

… ►

§3.8(ii) Newton’s Rule

… ► … ►Newton’s rule is given by … ►Another iterative method is Halley’s rule: …The rule converges locally and is cubically convergent. …

4: 8.25 Methods of Computation

… ►See Allasia and Besenghi (1987b) for the numerical computation of $\mathrm{\Gamma }(a,z)$ from (8.6.4) by means of the trapezoidal rule. … ►A numerical inversion procedure is also given for calculating the value of $x$ (with 10S accuracy), when $a$ and $P(a,x)$ are specified, based on Newton’s rule (§3.8(ii)). …

5: 9.17 Methods of Computation

… ►The trapezoidal rule (§3.5(i)) is then applied. … ►Zeros of the Airy functions, and their derivatives, can be computed to high precision via Newton’s rule (§3.8(ii)) or Halley’s rule (§3.8(v)), using values supplied by the asymptotic expansions of §9.9(iv) as initial approximations. …

6: About MathML

… ►As a general rule, using the latest available version of your chosen browser, plugins and an updated operating system is helpful. …

7: 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. …

8: 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 … ►

►►

Figure 18.40.2: Derivative Rule inversions for $w^{\mathrm{RCP}}(x)$ carried out via Lagrange and PWCF interpolations. …For the derivative rule Lagrange interpolation (red points) gives $\sim 15$ digits in the central region, while PWCF interpolation (blue points) gives $\sim 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\in [-1,1]$ and $(-\mathrm{\infty },\mathrm{\infty })$ respectively, Reinhardt (2018), and Reinhardt (2021b), Reinhardt (2021a). …

9: 10.74 Methods of Computation

… ►Newton’s rule (§3.8(i)) or Halley’s rule (§3.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. …

10: 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. …