AbstractQuasi-linear functions generate sequence transformation methods whose conditioning depends upon the nature of the sequence to be accelerated. These methods are often well conditioned when they are applied to alternating sequences; however, they are relatively ill-conditioned in case of monotonic convergence. The condition numbers of the Shanks transformation ek(sn) are given in order to prove that the closely related ε-algorithm to a such transformation is ill-conditioned when performed on the set of totally monotonic sequences. In the same way, we show that this algorithm is well conditioned on the set of totally oscillating sequences
When a sequence or an iterative process is slowly converging, a convergence acceleration process has...
AbstractMany numerical methods produce sequences of vectors converging to the solution of a problem....
Many numerical methods produce sequences of vectors converging to the solution of a problem. When th...
AbstractQuasi-linear functions generate sequence transformation methods whose conditioning depends u...
Shanks' transformation is a well know sequence transformation for accelerating the convergence of sc...
AbstractConvergence acceleration processes are known to be well conditioned for alternating sequence...
When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, un...
In this paper, we trace back the genesis of Aitken\u2019s \u3942 process and Shanks\u2019 sequence t...
In this paper, we show how to construct various extensions of Shanks transformation for functions in...
In this paper, we construct several sequence transformations whose kernels contain sequences of the ...
Sequence transformations, used for accelerating the convergence, are related to biorthogonal polynom...
This paper presents a general framework for Shanks transformations of sequences of elements in a vec...
Abstract: We determine the values of the integer m for which the parametric transformation T+m due ...
AbstractShanks developed a method for accelerating the convergence of sequences. When applied to cla...
AbstractSequence transformations are important tools for the convergence acceleration of slowly conv...
When a sequence or an iterative process is slowly converging, a convergence acceleration process has...
AbstractMany numerical methods produce sequences of vectors converging to the solution of a problem....
Many numerical methods produce sequences of vectors converging to the solution of a problem. When th...
AbstractQuasi-linear functions generate sequence transformation methods whose conditioning depends u...
Shanks' transformation is a well know sequence transformation for accelerating the convergence of sc...
AbstractConvergence acceleration processes are known to be well conditioned for alternating sequence...
When a sequence of numbers is slowly converging, it can be transformed into a new sequence which, un...
In this paper, we trace back the genesis of Aitken\u2019s \u3942 process and Shanks\u2019 sequence t...
In this paper, we show how to construct various extensions of Shanks transformation for functions in...
In this paper, we construct several sequence transformations whose kernels contain sequences of the ...
Sequence transformations, used for accelerating the convergence, are related to biorthogonal polynom...
This paper presents a general framework for Shanks transformations of sequences of elements in a vec...
Abstract: We determine the values of the integer m for which the parametric transformation T+m due ...
AbstractShanks developed a method for accelerating the convergence of sequences. When applied to cla...
AbstractSequence transformations are important tools for the convergence acceleration of slowly conv...
When a sequence or an iterative process is slowly converging, a convergence acceleration process has...
AbstractMany numerical methods produce sequences of vectors converging to the solution of a problem....
Many numerical methods produce sequences of vectors converging to the solution of a problem. When th...