Normal forms for general polynomial matrices
From MaRDI portal
Publication:2457359
DOI10.1016/j.jsc.2006.02.001zbMath1128.15005OpenAlexW2141336296MaRDI QIDQ2457359
Gilles Villard, Bernhard Beckermann, George Labahn
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
matrix polynomialsfraction-free algorithmmatrix greatest common divisorminimal multipliersPopov normal form
Polynomials in number theory (11C08) Matrices over function rings in one or more variables (15A54) Canonical forms, reductions, classification (15A21) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Matrices, determinants in number theory (11C20)
Related Items
Computing minimal interpolation bases ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Scaling invariants and symmetry reduction of dynamical systems ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Efficient algorithms for order basis computation ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Laurent, rational, and hypergeometric solutions of linear \(q\)-difference systems of arbitrary order with polynomial coefficients ⋮ A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over \(\mathbb{Z} [x\)] ⋮ Fraction-free row reduction of matrices of Ore polynomials. ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ A modular algorithm to compute the generalized Hermite normal form for \(\mathbb{Z}[x\)-lattices] ⋮ Output-sensitive modular algorithms for polynomial matrix normal forms ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ A deterministic algorithm for inverting a polynomial matrix ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Asymptotically fast polynomial matrix algorithms for multivariable systems ⋮ Computing lower rank approximations of matrix polynomials
Cites Work
- 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
- 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
