A note on weak and strong linearizations of regular matrix polynomials, Numerical Analysis.pdfVIP

A Note on Weak and Strong Linearizations of Regular Matrix Polynomials∗ Peter Lancaster Department of Mathematics and Statistics University of Calgary Calgary AB T2N 1N4 Canada. Panayiotis Psarrakos Department of Mathematics National Technical University Athens 15780 Greece. June 20, 2005 1 Introduction A paper of Tan and Pugh [TP] raises the question of ambiguity in a frequently used form of linearization when applied to regular matrix polynomials. Here, further insight into this question is provided, as well as a reminder of a stronger form of linearization (for which ambiguities are removed) introduced by Gohberg et al. [GKL]. n ×n l i Let A , A , . . . , A ∈ C , and define the matrix polynomial L(λ) = λ A . 0 1 n i=0 i Then L(λ) is said to be regular if detL(λ) is not identically equal to zero. We consider only regular matrix polynomials, and notice that Al = 0 is admitted. The degree of L(λ) is the largest j for which Aj = 0. Thus, it may happen that l deg(L). Some important ideas for this discussion are as follows: Two regular matrix polyno- mials A(λ), B(λ) of the same size are said to be equivalent if there are unimodular1 matrix polynomials E (λ), F (λ) such that A(λ) = E (λ)B (λ)F (λ). The canonical form under equiv- alence is the well-known Smith form,