2,035 research outputs found
Mathematical Properties of a New Levin-Type Sequence Transformation Introduced by \v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la. I. Algebraic Theory
\v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la [J. Math. Phys. \textbf{44}, 962
- 968 (2003)] introduced in connection with the summation of the divergent
perturbation expansion of the hydrogen atom in an external magnetic field a new
sequence transformation which uses as input data not only the elements of a
sequence of partial sums, but also explicit estimates
for the truncation errors. The explicit
incorporation of the information contained in the truncation error estimates
makes this and related transformations potentially much more powerful than for
instance Pad\'{e} approximants. Special cases of the new transformation are
sequence transformations introduced by Levin [Int. J. Comput. Math. B
\textbf{3}, 371 - 388 (1973)] and Weniger [Comput. Phys. Rep. \textbf{10}, 189
- 371 (1989), Sections 7 -9; Numer. Algor. \textbf{3}, 477 - 486 (1992)] and
also a variant of Richardson extrapolation [Phil. Trans. Roy. Soc. London A
\textbf{226}, 299 - 349 (1927)]. The algebraic theory of these transformations
- explicit expressions, recurrence formulas, explicit expressions in the case
of special remainder estimates, and asymptotic order estimates satisfied by
rational approximants to power series - is formulated in terms of hitherto
unknown mathematical properties of the new transformation introduced by
\v{C}\'{\i}\v{z}ek, Zamastil, and Sk\'{a}la. This leads to a considerable
formal simplification and unification.Comment: 41 + ii pages, LaTeX2e, 0 figures. Submitted to Journal of
Mathematical Physic
Prediction Properties of Aitken's Iterated Delta^2 Process, of Wynn's Epsilon Algorithm, and of Brezinski's Iterated Theta Algorithm
The prediction properties of Aitken's iterated Delta^2 process, Wynn's
epsilon algorithm, and Brezinski's iterated theta algorithm for (formal) power
series are analyzed. As a first step, the defining recursive schemes of these
transformations are suitably rearranged in order to permit the derivation of
accuracy-through-order relationships. On the basis of these relationships, the
rational approximants can be rewritten as a partial sum plus an appropriate
transformation term. A Taylor expansion of such a transformation term, which is
a rational function and which can be computed recursively, produces the
predictions for those coefficients of the (formal) power series which were not
used for the computation of the corresponding rational approximant.Comment: 34 pages, LaTe
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A ``hybrid method'', dedicated to asymptotic coefficient extraction in
combinatorial generating functions, is presented, which combines Darboux's
method and singularity analysis theory. This hybrid method applies to functions
that remain of moderate growth near the unit circle and satisfy suitable
smoothness assumptions--this, even in the case when the unit circle is a
natural boundary. A prime application is to coefficients of several types of
infinite product generating functions, for which full asymptotic expansions
(involving periodic fluctuations at higher orders) can be derived. Examples
relative to permutations, trees, and polynomials over finite fields are treated
in this way.Comment: 31 page
- …