Computing the rank and a small nullspace basis of a polynomial matrix

DOI10.1145/1073884.1073927zbMath1360.68957OpenAlexW1984950894MaRDI QIDQ5262779

Gilles Villard, Arne Storjohann

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073927

zbMATH Keywords

linear algebramatrix rankpolynomial matrixminimal polynomial basisnullspace basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (5)

Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Trading order for degree in creative telescoping ⋮ Efficient algorithms for order basis computation ⋮ Computing lower rank approximations of matrix polynomials

This page was built for publication: Computing the rank and a small nullspace basis of a polynomial matrix