About the Project
NIST

error term

AdvancedHelp

(0.002 seconds)

1—10 of 72 matching pages

1: 3.5 Quadrature
In particular, when k = the error term is an exponentially-small function of 1 / h , and in these circumstances the composite trapezoidal rule is exceptionally efficient. … Simpson’s rule can be regarded as a combination of two trapezoidal rules, one with step size h and one with step size h / 2 to refine the error term. … As in Simpson’s rule, by combining the rule for h with that for h / 2 , the first error term c 1 h 2 in (3.5.9) can be eliminated. … An interpolatory quadrature ruleEquation (3.5.36), without the error term, becomes …
2: 8.27 Approximations
  • Luke (1975, §4.3) gives Padé approximation methods, combined with a detailed analysis of the error terms, valid for real and complex variables except on the negative real z -axis. See also Temme (1994b, §3).

  • 3: 5.19 Mathematical Applications
    By translating the contour parallel to itself and summing the residues of the integrand, asymptotic expansions of f ( z ) for large | z | , or small | z | , can be obtained complete with an integral representation of the error term. …
    4: 9.7 Asymptotic Expansions
    In (9.7.5) and (9.7.6) the n th error term, that is, the error on truncating the expansion at n terms, is bounded in magnitude by the first neglected term and has the same sign, provided that the following term is of opposite sign, that is, if n 0 for (9.7.5) and n 1 for (9.7.6). In (9.7.7) and (9.7.8) the n th error term is bounded in magnitude by the first neglected term multiplied by χ ( n + σ ) + 1 where σ = 1 6 for (9.7.7) and σ = 0 for (9.7.8), provided that n 0 in the first case and n 1 in the second case. In (9.7.9)–(9.7.12) the n th error term in each infinite series is bounded in magnitude by the first neglected term and has the same sign, provided that the following term in the series is of opposite sign. … The n th error term in (9.7.5) and (9.7.6) is bounded in magnitude by the first neglected term multiplied by …
    5: Bibliography W
  • R. Wong and Y.-Q. Zhao (2003) Estimates for the error term in a uniform asymptotic expansion of the Jacobi polynomials. Anal. Appl. (Singap.) 1 (2), pp. 213–241.
  • R. Wong (1979) Explicit error terms for asymptotic expansions of Mellin convolutions. J. Math. Anal. Appl. 72 (2), pp. 740–756.
  • 6: 12.9 Asymptotic Expansions for Large Variable
    Bounds and re-expansions for the error term in (12.9.1) can be obtained by use of (12.7.14) and §§13.7(ii), 13.7(iii). …
    7: 25.10 Zeros
    The error term R ( t ) can be expressed as an asymptotic series that begins …
    8: 27.11 Asymptotic Formulas: Partial Sums
    Dirichlet’s divisor problem (unsolved in 2009) is to determine the least number θ 0 such that the error term in (27.11.2) is O ( x θ ) for all θ > θ 0 . … The error terms given here are not necessarily the best known. …
    9: 2.3 Integrals of a Real Variable
    2.3.3 σ n = sup ( 0 , ) ( t - 1 ln | q ( n ) ( t ) / q ( n ) ( 0 ) | )
    is finite and bounded for n = 0 , 1 , 2 , , then the n th error term (that is, the difference between the integral and n th partial sum in (2.3.2)) is bounded in absolute value by | q ( n ) ( 0 ) / ( x n ( x - σ n ) ) | when x exceeds both 0 and σ n . … In both cases the n th error term is bounded in absolute value by x - n 𝒱 a , b ( q ( n - 1 ) ( t ) ) , where the variational operator 𝒱 a , b is defined by … For other estimates of the error term see Lyness (1971). …
    10: 3.3 Interpolation
    With an error term the Lagrange interpolation formula for f is given by …