An algorithm for computing the eigenstructure of a regular matrix polynomial

Wen-Wei Lin*

*Corresponding author for this work

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)195-211
頁數17
期刊Linear Algebra and Its Applications
91
發行號C
DOIs
出版狀態Published - 1 一月 1987

指紋 深入研究「An algorithm for computing the eigenstructure of a regular matrix polynomial」主題。共同形成了獨特的指紋。

引用此