About the Project

truncated

AdvancedHelp

(0.000 seconds)

1—10 of 17 matching pages

1: 2.11 Remainder Terms; Stokes Phenomenon
When a rigorous bound or reliable estimate for the remainder term is unavailable, it is unsafe to judge the accuracy of an asymptotic expansion merely from the numerical rate of decrease of the terms at the point of truncation. … If the results agree within S significant figures, then it is likely—but not certain—that the truncated asymptotic series will yield at least S correct significant figures for larger values of x . … Truncation after 5 terms yields 0. … The process just used is equivalent to re-expanding the remainder term of the original asymptotic series (2.11.24) in powers of 1 / ( x + 5 ) and truncating the new series optimally. … Optimum truncation occurs just prior to the numerically smallest term, that is, at s 4 . …
2: 8.11 Asymptotic Approximations and Expansions
This reference also contains explicit formulas for the coefficients in terms of Stirling numbers. …
3: 2.5 Mellin Transform Methods
First, we introduce the truncated functions f 1 ( t ) and f 2 ( t ) defined by
2.5.21 f 1 ( t ) = { f ( t ) , 0 < t 1 , 0 , 1 < t < ,
2.5.22 f 2 ( t ) = f ( t ) f 1 ( t ) .
2.5.26 f ( z ) = f 1 ( z ) + f 2 ( z )
2.5.30 I j k ( x ) = 0 f j ( t ) h k ( x t ) d t .
4: 3.11 Approximation Techniques
Because the series (3.11.12) converges rapidly we obtain a very good first approximation to the minimax polynomial p n ( x ) for [ a , b ] if we truncate (3.11.12) at its ( n + 1 ) th term. … Since L 0 = 1 , L n is a monotonically increasing function of n , and (for example) L 1000 = 4.07 , this means that in practice the gain in replacing a truncated Chebyshev-series expansion by the corresponding minimax polynomial approximation is hardly worthwhile. … Let c n T n ( x ) be the last term retained in the truncated series. …Then the sum of the truncated expansion equals 1 2 ( u 0 u 2 ) . …
5: 12.11 Zeros
6: 22.3 Graphics
See accompanying text
Figure 22.3.26: Density plot of | sn ( 5 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . Grayscale, running from 0 (black) to 10 (white), with | ( sn ( 5 , k ) ) | > 10 truncated to 10. … Magnify
See accompanying text
Figure 22.3.27: Density plot of | sn ( 10 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . Grayscale, running from 0 (black) to 10 (white), with | sn ( 10 , k ) | > 10 truncated to 10. … Magnify
See accompanying text
Figure 22.3.28: Density plot of | sn ( 20 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . Grayscale, running from 0 (black) to 10 (white), with | sn ( 20 , k ) | > 10 truncated to 10. … Magnify
See accompanying text
Figure 22.3.29: Density plot of | sn ( 30 , k ) | as a function of complex k 2 , 10 ( k 2 ) 20 , 10 ( k 2 ) 10 . Grayscale, running from 0 (black) to 10 (white), with | sn ( 30 , k ) | > 10 truncated to 10. … Magnify
7: Bibliography W
  • E. J. Weniger (2007) Asymptotic Approximations to Truncation Errors of Series Representations for Special Functions. In Algorithms for Approximation, A. Iske and J. Levesley (Eds.), pp. 331–348.
  • 8: 11.6 Asymptotic Expansions
    If the series on the right-hand side of (11.6.1) is truncated after m ( 0 ) terms, then the remainder term R m ( z ) is O ( z ν 2 m 1 ) . …
    9: 19.5 Maclaurin and Related Expansions
    Coefficients of terms up to λ 49 are given in Lee (1990), along with tables of fractional errors in K ( k ) and E ( k ) , 0.1 k 2 0.9999 , obtained by using 12 different truncations of (19.5.6) in (19.5.8) and (19.5.9). …
    10: DLMF Project News
    error generating summary