论文信息 - Computing Valuation Popov Forms - 字舞流文

Computing Valuation Popov Forms

Popov forms and weak Popov forms of matrices over noncommutative valuation domains are defined and discussed. Two new algorithms to construct these Popov forms are given, along with a description of some of their applications.

Yang Zhang | George Labahn | Mark Giesbrecht

[1] Michael Patrick. O'Donnell,et al. Theory of rings , 1952 .

[2] Gilles Villard,et al. Computing Popov and Hermite forms of polynomial matrices , 1996, ISSAC '96.

[3] O. Ore. Theory of Non-Commutative Polynomials , 1933 .

[4] Thomas Kailath,et al. Linear Systems , 1980 .

[5] George Labahn,et al. Shifted normal forms of polynomial matrices , 1999, ISSAC '99.

[6] George Labahn,et al. Fraction-free row reduction of matrices of Ore polynomials , 2006, J. Symb. Comput..

[7] Manuel Bronstein,et al. Linear algebra for skew-polynomial matrices , 2002 .

[8] J. Gathen. Hensel and Newton methods in valuation rings , 1984 .

[9] J. Neukirch,et al. The Theory of Valuations , 1999 .

[10] Arne Storjohann,et al. On lattice reduction for polynomial matrices , 2000 .

[11] V. Popov. Invariant Description of Linear, Time-Invariant Controllable Systems , 1972 .

[12] George Labahn,et al. Fraction-free row reduction of matrices of skew polynomials , 2002, ISSAC '02.