Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Acceleration of Convergence of Some Infinite Sequences $\boldsymbol{\{A_n\}}$ Whose Asymptotic Expansions Involve Fractional Powers of $\boldsymbol{n}$ via the $\tilde{d}^{(m)}$ transformation (1703.06495v2)

Published 19 Mar 2017 in math.NA and cs.NA

Abstract: In this paper, we discuss the application of the author's $\tilde{d}{(m)}$ transformation to accelerate the convergence of infinite series $\sum\infty_{n=1}a_n$ when the terms $a_n$ have asymptotic expansions that can be expressed in the form $$ a_n\sim(n!){s/m}\exp\left[\sum{m}{i=0}q_in{i/m}\right]\sum\infty{i=0}w_i n{\gamma-i/m}\quad\text{as $n\to\infty$},\quad s\ \text{integer.}$$ We discuss the implementation of the $\tilde{d}{(m)}$ transformation via the recursive W-algorithm of the author. We show how to apply this transformation and how to assess in a reliable way the accuracies of the approximations it produces, whether the series converge or they diverge. We classify the different cases that exhibit unique numerical stability issues in floating-point arithmetic. We show that the $\tilde{d}{(m)}$ transformation can also be used efficiently to accelerate the convergence of infinite products $\prod\infty_{n=1}(1+v_n)$, where $v_n\sim \sum\infty_{i=0}e_in{-t/m-i/m}$ as $n\to\infty$,\ $t\geq m+1$ an integer. Finally, we give several numerical examples that attest the high efficiency of the $\tilde{d}{(m)}$ transformation for the different cases.

Summary

We haven't generated a summary for this paper yet.