Normal forms for general polynomial matrices

DOI10.1016/j.jsc.2006.02.001zbMath1128.15005MaRDI QIDQ2457359

Bernhard Beckermann, George Labahn, Gilles Villard

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2006.02.001

zbMATH Keywords

matrix polynomials; fraction-free algorithm; matrix greatest common divisor; minimal multipliers; Popov normal form

Mathematics Subject Classification ID

11C08: Polynomials in number theory

15A54: Matrices over function rings in one or more variables

15A21: Canonical forms, reductions, classification

11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors

11C20: Matrices, determinants in number theory

Related Items

Asymptotically fast polynomial matrix algorithms for multivariable systems, Essentially optimal computation of the inverse of generic polynomial matrices, Fraction-free row reduction of matrices of Ore polynomials., Output-sensitive modular algorithms for polynomial matrix normal forms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursiveness in matrix rational interpolation problems
• A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
• A general module theoretic framework for vector M-Padé and matrix rational interpolation
• Parallel algorithms for matrix normal forms
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• A new method for computing a column reduced polynomial matrix
• Fast projection methods for minimal design problems in linear system theory
• On lattice reduction for polynomial matrices
• Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• The Canonical Diophantine Equations with Applications
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• Irreducible Realizations and the Degree of a Rational Matrix