Computing the Invariant Polynomials of a Polynomial Matrix. I

被引:0
作者
V. N. Kublanovskaya
机构
[1] St.Petersburg Department of the Steklov Mathematical Institute,
关键词
Polynomial Matrix; Full Column Rank; Invariant Polynomial; Algebraic Problem; Polynomial Matrice;
D O I
10.1023/B:JOTH.0000026287.84587.b9
中图分类号
学科分类号
摘要
An algorithm for computing the invariant polynomials and the canonical triangular (trapezoidal) matrix for a polynomial matrix of full column rank is suggested. The algorithm is based on the Δ W-1 rank-factorization method for solving algebraic problems for polynomial matrices, previously suggested by the author. Bibliography: 3 titles.
引用
收藏
页码:2508 / 2510
页数:2
相关论文
共 2 条
[1]  
Kublanovskaya V. N.(1992)Rank-division algorithms and their applications J. Numer. Linear Algebra Appl. 1 199-213
[2]  
Kublanovskaya V. N.(1997)Methods and algorithms for solving spectral problems for polynomial and rational matrices Zap. Nauchn. Semin. POMI 238 7-329