AbstractA new algorithm is presented for accelerating the convergence of sequences possessing an asymptotic expansion. This method is compared to methods already shown. Explicit error estimates are given and the algorithm is shown to be nearly optimal. The algorithm is applied to the problem of numerical integration, and is shown to give good results for real analytic integrands
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
AbstractWe compare the epsilon algorithm of Wynn with a generalization of summation by parts for acc...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractA new algorithm is presented for accelerating the convergence of sequences possessing an asy...
This thesis is a study of quadratic approximation and its application to the acceleration of slowly ...
AbstractLet (Sn) be some real sequence defined as Sn+1=⨍(Sn for∈N,where ⨍(x)=x+∑i⩾1αp+i(x−S)p+i, wit...
AbstractThe aim of this paper is to present a review of the most significant results obtained the pa...
AbstractLet (xn) be some sequence generated by xn+1 = ƒ(xn) where ƒ(x)=(x) + ∑i ⩾ 1α p+1xp+i, p ⩾ 1,...
AbstractThe E-algorithm can be successfully applied to accelerate the convergence of the solution of...
Abstract. Some new results on convergence acceleration for the E-algorithm which is a general extrap...
AbstractQuite often in application, logarithmically convergent series have to be evaluated. There ar...
AbstractLet (Sn) be the sequence given by the Jacobi-Gauss quadrature method when the integrand is a...
AbstractIn the present work we use the E-algorithm to accelerate the convergence of finite-differenc...
This paper presents convergence acceleration, a method for computing efficiently the limit of numeri...
AbstractIf the elements in a sequence are connected by recurrence relations, but their values are kn...
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
AbstractWe compare the epsilon algorithm of Wynn with a generalization of summation by parts for acc...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
AbstractA new algorithm is presented for accelerating the convergence of sequences possessing an asy...
This thesis is a study of quadratic approximation and its application to the acceleration of slowly ...
AbstractLet (Sn) be some real sequence defined as Sn+1=⨍(Sn for∈N,where ⨍(x)=x+∑i⩾1αp+i(x−S)p+i, wit...
AbstractThe aim of this paper is to present a review of the most significant results obtained the pa...
AbstractLet (xn) be some sequence generated by xn+1 = ƒ(xn) where ƒ(x)=(x) + ∑i ⩾ 1α p+1xp+i, p ⩾ 1,...
AbstractThe E-algorithm can be successfully applied to accelerate the convergence of the solution of...
Abstract. Some new results on convergence acceleration for the E-algorithm which is a general extrap...
AbstractQuite often in application, logarithmically convergent series have to be evaluated. There ar...
AbstractLet (Sn) be the sequence given by the Jacobi-Gauss quadrature method when the integrand is a...
AbstractIn the present work we use the E-algorithm to accelerate the convergence of finite-differenc...
This paper presents convergence acceleration, a method for computing efficiently the limit of numeri...
AbstractIf the elements in a sequence are connected by recurrence relations, but their values are kn...
The paper presents three modifications of the Aitken accelerator for slowly or irregularly c...
AbstractWe compare the epsilon algorithm of Wynn with a generalization of summation by parts for acc...
AbstractThe Θ̂-algorithm is a general extrapolation procedure for accelerating the convergence of se...
DOI
Add to ORKG