Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T07:09:02.972Z Has data issue: false hasContentIssue false

Matrix and vector sequence transformations revisited

Published online by Cambridge University Press:  20 January 2009

C. Brezinski
Affiliation:
Laboratoire D'Analyse Numerique et D'Optimisation, UFR IEEA-M3, Université des Sciences et Technologies de Lille, 59655 Villeneuve D'Ascq Cedex, France E-mail address: brezinsk@omega.univ-lillel.fr
A. Salam
Affiliation:
Laboratoire D'Analyse Numerique et D'Optimisation, UFR IEEA-M3, Université des Sciences et Technologies de Lille, 59655 Villeneuve D'Ascq Cedex, France E-mail address: brezinsk@omega.univ-lillel.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Sequence transformations are extrapolation methods. They are used for the purpose of convergence acceleration. In the scalar case, such algorithms can be obtained by two different approaches which are equivalent. The first one is an elimination approach based on the solution of a system of linear equations and it makes use of determinants. The second approach is based on the notion of annihilation difference operators. In this paper, these two approaches are generalized to the matrix and the vector cases.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1995