A challenging test for convergence accelerators: summation of a series with a special sign pattern.
Sidi, Avram (2006)
Applied Mathematics E-Notes [electronic only]
Similarity:
Displaying similar documents to “Algebraic properties of the E-transformation”
A challenging test for convergence accelerators: summation of a series with a special sign pattern.
An Algorithm for a Special Case of a Generalization of the Richardson Extrapolation Process.
A. Sidi (1982)
Numerische Mathematik
Similarity:
A General Extrapolation Algorithm.
C. Brezinski (1980)
Numerische Mathematik
Similarity:
Convergence acceleration by the -algorithm
A. Fdil (1998)
Applicationes Mathematicae
Similarity:
A new algorithm which generalizes the E-algorithm is presented. It is called the -algorithm. Some results on convergence acceleration for the -algorithm are proved. Some applications are given.
Bordering methods and progressive forms for sequence transformations
C. Brezinski (1988)
Applicationes Mathematicae
Similarity:
Algorithm 9. Solution of the time transformation problem
A. Janicki (1970)
Applicationes Mathematicae
Similarity:
Some results on convergence acceleration for the E-algorithm
A. Fdil (1997)
Applicationes Mathematicae
Similarity:
Some new results on convergence acceleration for the E-algorithm which is a general extrapolation method are obtained. A technique for avoiding numerical instability is proposed. Some applications are given. Theoretical results are illustrated by numerical experiments
One-step and Extrapolation Methods for Differential-Algebraic Systems.
P. Deuflhard, E. Hairer, J. Zugck (1987)
Numerische Mathematik
Similarity:
Accelerating the Convergence of a Table with Multiple Entry
A.A.M. Cuyt (1983)
Numerische Mathematik
Similarity:
On a Generalization of the Richardson Extrapolation Process.
Avram Sidi (1990)
Numerische Mathematik
Similarity:
The Back and Forth Nudging algorithm for data assimilation problems : theoretical results on transport equations
Didier Auroux, Maëlle Nodet (2012)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In this paper, we consider the back and forth nudging algorithm that has been introduced for data assimilation purposes. It consists of iteratively and alternately solving forward and backward in time the model equation, with a feedback term to the observations. We consider the case of 1-dimensional transport equations, either viscous or inviscid, linear or not (Burgers’ equation). Our aim is to prove some theoretical results on the convergence, and convergence properties, of this algorithm....