Some results of convergence acceleration for a general \(\Theta\)-type algorithm (Q678889)

The author proposes a general \(\Theta\)-type algorithm for accelerating the convergence of sequences. He applies the \(\Theta\)-procedure to the rules of a general convergence acceleration algorithm. The new algorithm called the \(\widehat{\Theta}\)-algorithm depends on an auxiliary double sequence \((x_{k}^{n})\). From different choices of \((x_{k}^{n})\), the author obtains some known sequence transformations such as the \(\Theta\)-algorithm, the iterated \(\Theta_2\), the iterated \(\Delta^2\), the \(T\)-algorithm, the iterated first step \(U_1\) and some other transformations. For example in the iterated \(\Delta^2\) process \(x_{k}^{n}=1\). By studying the kernel of one step of the \(\widehat{\Theta}\)-algorithm, the author derives some \(\widehat{\Theta}\)-algorithm for accelerating the convergence of some classes of sequences. Some results of practical importance in applications are obtained. Theoretical results are illustrated by numerical examples.