The acceleration field of subsequence matrix transformations are studied with respect to the convergence rate of the sequence being accelerated. Included is a proof that no subsequencing algorithm exists which will determine a set of subscripts (n(i)) for which (yn(i)) will be linear for every y which converges at the same rate as or faster (slower) than a fixed sequence x. © 1988 by Pacific Journal of Mathematics
Let $(S_n)$ be some vector sequence, converging to S, satisfying $S_n - S \sim ϱ ^n n^{θ}(β_0 + β_1 ...
In this paper we investigate the performance of four different SOR acceleration techniques on a vari...
This dissertation is devoted to the acceleration of convergence of vector sequences. This means to p...
The acceleration field of subsequence matrix transformations are studied with respect to the converg...
Abstract. In this article the notion of acceleration convergence of double sequences in Pringsheim’s...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractThe purpose of this paper is to propose acceleration methods for certain logarithmically con...
An algorithm for explicit integration of structural dynamics problems with multiple time steps is pr...
Abstract. Regular matrix methods that improve and accelerate the convergence of sequences and series...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Mann’s sequences are difficult to accelerate in the presence of a nonhyperbolic fixed point. New acc...
When a sequence or an iterative process is slowly converging, a convergence acceleration process has...
In this article, in a few pages, we will try to give an idea of convergence acceleration methods and...
AbstractLet (Sn) be a sequence of intervals. We give a definition of linearity and acceleration of c...
AbstractTo improve the efficiency of the straightforward algorithm for general secant methods in sev...
Let $(S_n)$ be some vector sequence, converging to S, satisfying $S_n - S \sim ϱ ^n n^{θ}(β_0 + β_1 ...
In this paper we investigate the performance of four different SOR acceleration techniques on a vari...
This dissertation is devoted to the acceleration of convergence of vector sequences. This means to p...
The acceleration field of subsequence matrix transformations are studied with respect to the converg...
Abstract. In this article the notion of acceleration convergence of double sequences in Pringsheim’s...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractThe purpose of this paper is to propose acceleration methods for certain logarithmically con...
An algorithm for explicit integration of structural dynamics problems with multiple time steps is pr...
Abstract. Regular matrix methods that improve and accelerate the convergence of sequences and series...
Linear relation analysis is a classical abstract interpretation based on an over-approximation of re...
Mann’s sequences are difficult to accelerate in the presence of a nonhyperbolic fixed point. New acc...
When a sequence or an iterative process is slowly converging, a convergence acceleration process has...
In this article, in a few pages, we will try to give an idea of convergence acceleration methods and...
AbstractLet (Sn) be a sequence of intervals. We give a definition of linearity and acceleration of c...
AbstractTo improve the efficiency of the straightforward algorithm for general secant methods in sev...
Let $(S_n)$ be some vector sequence, converging to S, satisfying $S_n - S \sim ϱ ^n n^{θ}(β_0 + β_1 ...
In this paper we investigate the performance of four different SOR acceleration techniques on a vari...
This dissertation is devoted to the acceleration of convergence of vector sequences. This means to p...
DOI
Add to ORKG