The generalizations of Newton's interpolation formula due to Mühlbach and Andoyer.
A General Extrapolation Algorithm.
Forme confluente de l'e-algorithme topologique.
Etudes sur les e- et g-algorithmes.
Convergence Acceleration of Some Sequences by the e-Algorithm.
Bordering methods and progressive forms for sequence transformations
A breakdown-free Lanczos type algorithm for solving linear systems.
Altman's methods revisited
We discuss two different methods of Altman for solving systems of linear equations. These methods can be considered as Krylov subspace type methods for solving a projected counterpart of the original system. We discuss the link to classical Krylov subspace methods, and give some theoretical and numerical results on their convergence behavior.
Orthogonal polynomials and the Lanczos method
Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials....
Page 1