An algorithm for computing the eigenstructure of a regular matrix polynomial

Wen-Wei Lin*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We give an algorithm to compute the finite zeros of a regular matrix polynomial P(λ) [i.e. det P(λ) ≢ 0]. The approach is close to that of the algorithm in [8]. We use nonunitary elementary matrices instead of unitary matrices for the equivalence transformations, which are somewhat cheaper. In practice the danger of growth of nonunitary matrices seems to be more remote than usually supposed.

Original languageEnglish
Pages (from-to)195-211
Number of pages17
JournalLinear Algebra and Its Applications
Volume91
Issue numberC
DOIs
StatePublished - 1 Jan 1987

Fingerprint Dive into the research topics of 'An algorithm for computing the eigenstructure of a regular matrix polynomial'. Together they form a unique fingerprint.

Cite this