A Matrix Interpretation of the Extended Euclidean Algorithm
OPEN ACCESS
Loading...
Author / Producer
Date
2000-05
Publication Type
Report
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
The extended Euclidean algorithm for polynomials and formal power series that is used for the recursive computation of \PA s can be viewed in various ways as a sequence of successive matrix multiplications that are applied to a Sylvester matrix with the original data. Here we present this result in a general version that includes the treatment of the Cabay--Meleshko look-ahead algorithm, which generalizes the extended Euclidean algorithm and yields a weakly stable (forward stable) method for computing Padé fractions if it is combined with an appropriate rule for choosing the look-ahead step length. Moreover, we choose for the matrix interpretation a particularly appealing form where also the product of all the matrices that are applied has a meaning: this product yields at the end four Toeplitz blocks with the coefficients of the polynomials (which belong to \PF s) that are generated by the extended Euclidean algorithm in addition to those resulting from the ordinary Euclidean algorithm.
Permanent link
Publication status
published
Editor
Book title
Journal / series
Volume
2000-05
Pages / Article No.
Publisher
Seminar for Applied Mathematics, ETH Zurich
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
02501 - Seminar für Angewandte Mathematik / Seminar for Applied Mathematics