Introduction to the Thukral-Determinantal Formula for Accelerating Convergence of Sequence
##plugins.themes.bootstrap3.article.main##
There are two objectives for this paper. Firstly, we shall introduce the Thukral-determinantal formula, and secondly, we shall demonstrate the similarities between the well-established algorithms, namely the Aitkin Δ2 algorithm and the Durbin sequence transformation. In fact, we have found that the solution of the Thukral-determinantal formula is equivalent to the Thukral-sequence transformation formula.
Introduction
In almost all areas of numerical mathematics, there are convergence problems. In such cases, either the convergence is slow or even divergence is observed and accordingly many techniques for accelerating convergence have been devised. For example; Aitkin algorithm, -algorithm, -algorithm, Lubkin transformation, Levin-type transformation, and many others may be found in [1], [2]. Whereas Durbin’s sequence transformation and Brezinski-Durbin-Redivo-Zaglia’s sequence transformation may be found in [3], [4]. It is well-established that the Durbin sequence transformation cannot be expressed as a ratio of two determinants [5], [6], and it has been a long quest to find this representation. Hence, the prime motive for the introduction of the Thukral-determinantal formula was to establish that the Durbin sequence transformation can be represented as a ratio of two determinants. Furthermore, we shall verify that the Thukral-determinantal formula produces an equivalent equation to the Thukral-sequence transformation, and there is a particular connection between the Brezinski-Durbin-Redivo-Zaglia’s sequence transformation.
The structure of this paper is as follows: In Section 2, we state the essential definitions relevant to the present work. In Section 3, we shall define the Thukral-determinantal formula, and in process we will demonstrate the similarities between the Aitkin algorithm, the Durbin sequence transformation, and the Thukral-sequence transformation. In order to construct the new determinantal formula, the following proposition is essential.
Preliminaries
In order to construct an iterative scheme, the following assumptions are essential and are given in [1], [2].
Let us assume that is a slowly convergent or divergent sequence, whose elements are the partial sum of an infinite series, give as
The basic assumption of all sequence transformation is that a sequence element can be for all indices to be partitioned into a limit a truncation error according to
The conventional approach of evaluating an infinite series consists of adding up so many terms that the error ultimately becomes zero. Unfortunately, this is not always possible because of obvious practical limitations. Moreover, adding up further terms does not work in the case of a divergent series. Therefore, the development of new techniques plays an important role.
Furthermore, let us assume the two sequences and both converge to the same limit Another condition of the sequence converges more rapidly than then
Construction of the Thukral-Determinant Formula
In this section, we shall define the Thukral-determinantal formula for accelerating the convergence of sequences. In the process, we shall demonstrate that the Thukral-determinantal formula is in fact equivalent to the Thukral-sequence transformation formula and show a connection with the Brezinski-Durbin-Redivo-Zaglia [3], [4]. Hence, we shall show the similarities for the first five cases and then define the Thukral-determinantal formula as a general form. We begin with the Brezinski-Durbin-Redivo-Zaglia formula, where operates, now and in sequel, on the variable n. For example,
In order to obtain the identical results between the Thukral-determinantal formula and the Thukral-sequence transformation we will modify the Brezinski-Durbin-Redivo-Zaglia formula, and define a new version, namely Thukral-sequence transformation as
We shall demonstrate the similarities between the Thukral-determinantal formula and Thukral-sequence transformation for several values of
For case
By cancelling common factors and simplifying (7), we get
Using the Thukral-sequence transformation Formula (6) for case we obtain
Expanding and simplifying (9), we obtain
The Aitkin algorithm is a well-known technique for accelerating the convergence of sequences and in fact, there are many versions of the algorithm [1]–[3], [7], the Eq. (10) is one of many versions of the Aitkin algorithm. Therefore, it is apparent that (8) and (10) are equivalent and is one of the versions of the Aitken process.
We progress to
Expanding the numerator and denominator of (11), we get
Again, we cancel the common factors and simplify (12), which yields
The second scheme of the Thukral-sequence transformation Formula (6) is given as
The Eq. (14) is simplified as
Here also we find that the expressions (13) and (15) are identical.
For the purpose and motivation of this paper, we shall demonstrate similarities between the Thukral-determinantal formula and the Durbin sequence transformation for the next case.
When , the Thukral-determinantal formula is given as
Evaluating the above equation, we get
As before, we cancel the common factors of (17) and obtain
We expand (18) and show the similarities between the Thukral-determinantal formula and the Durbin sequence transformation, thus becomes
By cancelling similar terms and simplifying (19), we get
Which is identical to the Durbin sequence transformation [1], [3], [5]. Moreover, from the Thukral-sequence transformation Formula (6), for , yields
Expanding and simplifying (22), we obtain
Consequently, for we have demonstrated that the Thukral-determinantal formula, the Durbin sequence transformation and the Thukral-sequence transformation formula produce identical results.
The Thukral-determinantal formula for
Expanding (24), we obtain
Eliminating the common factors and simplifying (25), we get
The Thukral-sequence transformation Formula (6), for is given as
It is apparent that (26) and (28) are identical and hence the Thukral-determinantal formula and the Thukral-sequence transformation formula produce identical results.
The Thukral-determinantal formula for
Similarly, we expand (29) and obtain where the common factors of the numerator and the dominator of (30) are denoted as
By cancelling these factors and simplifying (31), we get
Expanding the Thukral-sequence transformation Formula (6) for ,
We observe that the equations of the Thukral-determinantal formula and the Thukral-sequence transformation formula given by (32) and (34) respectively are identical.
In general, we define the Thukral-determinantal formula as where , provided the denominator of (35) is a nonzero and is given by (2).
Mathematically we have demonstrated that the Thukral-determinantal Formula (35) produces identical results when compared to the Thukral-sequence transformation Formula (6), whereas only the odd values of are identical to the formula of Brezinski-Durbin-Redivo-Zaglia sequence transformation, given by (5). Therefore, we postulate that the relationship between the two new Thukral’s formulae is given as and we conjecture that the connection between the Thukral-determinantal formula and the Brezinski-Durbin-Redivo-Zaglia’s sequence transformation is
Remarks and Conclusion
In this study, we have introduced the Thukral-determinantal formula and the Thukral-sequence transformation formula for accelerating the convergence of a sequence. It is well established that the Durbin sequence transformation has not been presented in a ratio of two determinants [4]–[6]. Hence, it was of great interest to find a formula. In the process, we have demonstrated the similarities between the Thukral-determinantal formula for the Aitkin algorithm and the Durbin sequence transformation for case and , respectively. Furthermore, we have found that the Thukral-determinantal formula produces mathematically equivalent results to the new Thukral-sequence transformation formula, and only odd values of k results are similar to Brezinski-Durbin-Redivo-Zaglia’s sequence transformation. Finally, further work is in progress to obtain the variants of the Thukral-determinantal formula and establish an efficient convergence accelerator.
References
-
Sidi A. Practical Extrapolation Methods. Cambridge, England: Cambridge university Press; 2003.
Google Scholar
1
-
Weniger EJ. Nonlinear sequence transformations for the acceleration of convergence and the summation of divergent series. Comput Phys Rep. 1989;10:189–371, Los Alamos Preprint math-ph/0306302. Available from: http://arXiv.org.
Google Scholar
2
-
Brezinski C, Redivo-Zaglia M. Generalizations of Aitken’s process for accelerating the convergence of sequences. Comput Appl Maths. 2007;26:171–89.
Google Scholar
3
-
Durbin F. Private communication with Brezinski C, Redivo-Zaglia M. 2003.
Google Scholar
4
-
Chang XK, He Y, Hu XB, Li SH. A new integrable convergence acceleration algorithm for computing Brezinski-Durbin-Redivo-Zaglia’s sequence transformation via pfaffians. Numer Algor. 2018;78:87–106. doi: 10.1007/s11075-017-0368-z.
Google Scholar
5
-
Thukral R. Private communication with Brezinski C. 2024.
Google Scholar
6
-
Aitken AC. On Bernoulli’s numerical solution of algebraic equations. Proc Roy Soc Edinburgh. 1926;46:289–305.
Google Scholar
7