Search results
Results From The WOW.Com Content Network
The Maclaurin series of the logarithm function (+) is conditionally convergent for x = 1. The Riemann series theorem states that if a series converges conditionally, it is possible to rearrange the terms of the series in such a way that the series converges to any value, or even diverges.
For functions defined on a topological space, one can define (as above) local uniform convergence and compact (uniform) convergence in terms of the partial sums of the series. If, in addition, the functions take values in a normed linear space, then local normal convergence (local, uniform, absolute convergence) and compact normal convergence ...
If a series is convergent but not absolutely convergent, it is called conditionally convergent. An example of a conditionally convergent series is the alternating harmonic series. Many standard tests for divergence and convergence, most notably including the ratio test and the root test, demonstrate absolute convergence.
A sequence of functions () converges uniformly to when for arbitrary small there is an index such that the graph of is in the -tube around f whenever . The limit of a sequence of continuous functions does not have to be continuous: the sequence of functions () = (marked in green and blue) converges pointwise over the entire domain, but the limit function is discontinuous (marked in red).
An asymptotic series cannot necessarily be made to produce an answer as exactly as desired away from the asymptotic limit, the way that an ordinary convergent series of functions can. In fact, a typical asymptotic series reaches its best practical approximation away from the asymptotic limit after a finite number of terms; if more terms are ...
Agnew's theorem describes rearrangements that preserve convergence for all convergent series. The Lévy–Steinitz theorem identifies the set of values to which a series of terms in R n can converge. A typical conditionally convergent integral is that on the non-negative real axis of (see Fresnel integral).
An infinite series of any rational function of can be reduced to a finite series of polygamma functions, by use of partial fraction decomposition, [8] as explained here. This fact can also be applied to finite series of rational functions, allowing the result to be computed in constant time even when the series contains a large number of terms.
When dealing with uniformly convergent series of functions, the same phenomenon occurs: the series can potentially be reordered into a non-uniformly convergent series, or a series which does not even converge pointwise. This is impossible for series of nonnegative functions, so the notion of uniform absolute-convergence can be used to rule out ...