Mann's sequences are difficult to accelerate in the presence of a nonhyperbolic fixed point. New accelerators are constructed for Mann's sequences which are useful even for other sets of very slowly convergent sequences
summary:Consider the Mann iteration $x_{n+1} = ( 1 - \alpha_n ) x_n + \alpha_n Tx_n$ for a nonexpans...
Two convergence theorems for the Ishikawa and Mann iteration sequences involving nonexpansive mappin...
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
Mann’s sequences are difficult to accelerate in the presence of a nonhyperbolic fixed point. New acc...
AbstractDelahaye and Germain-Bonne (1982) proved that the set of logarithmic sequences (LOG) is not ...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractLet (xn) be some sequence generated by xn+1 = ƒ(xn) where ƒ(x)=(x) + ∑i ⩾ 1α p+1xp+i, p ⩾ 1,...
International audienceFixed point iterations are still the most common approach to dealing with a v...
The acceleration field of subsequence matrix transformations are studied with respect to the converg...
AbstractThe purpose of this paper is to propose acceleration methods for certain logarithmically con...
AbstractLet (Sn) be a sequence of intervals. We give a definition of linearity and acceleration of c...
Despite the broad use of fixed-point iterations throughout applied mathematics, the optimal converge...
Abstract. In this article the notion of acceleration convergence of double sequences in Pringsheim’s...
International audienceFixed point iterations are still the most common approach to dealing with a va...
AbstractWe propose a definition of convergence acceleration which seems well adapted for acceleratin...
summary:Consider the Mann iteration $x_{n+1} = ( 1 - \alpha_n ) x_n + \alpha_n Tx_n$ for a nonexpans...
Two convergence theorems for the Ishikawa and Mann iteration sequences involving nonexpansive mappin...
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
Mann’s sequences are difficult to accelerate in the presence of a nonhyperbolic fixed point. New acc...
AbstractDelahaye and Germain-Bonne (1982) proved that the set of logarithmic sequences (LOG) is not ...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractLet (xn) be some sequence generated by xn+1 = ƒ(xn) where ƒ(x)=(x) + ∑i ⩾ 1α p+1xp+i, p ⩾ 1,...
International audienceFixed point iterations are still the most common approach to dealing with a v...
The acceleration field of subsequence matrix transformations are studied with respect to the converg...
AbstractThe purpose of this paper is to propose acceleration methods for certain logarithmically con...
AbstractLet (Sn) be a sequence of intervals. We give a definition of linearity and acceleration of c...
Despite the broad use of fixed-point iterations throughout applied mathematics, the optimal converge...
Abstract. In this article the notion of acceleration convergence of double sequences in Pringsheim’s...
International audienceFixed point iterations are still the most common approach to dealing with a va...
AbstractWe propose a definition of convergence acceleration which seems well adapted for acceleratin...
summary:Consider the Mann iteration $x_{n+1} = ( 1 - \alpha_n ) x_n + \alpha_n Tx_n$ for a nonexpans...
Two convergence theorems for the Ishikawa and Mann iteration sequences involving nonexpansive mappin...
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
DOI
Add to ORKG