Computing the rank and a small nullspace basis of a polynomial matrix
DOI10.1145/1073884.1073927zbMATH Open1360.68957OpenAlexW1984950894MaRDI QIDQ5262779FDOQ5262779
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
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (9)
- Computing lower rank approximations of matrix polynomials
- Trading order for degree in creative telescoping
- Efficient algorithms for order basis computation
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
- Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
- Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
- Computing valuations of the Dieudonné determinants
- Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
This page was built for publication: Computing the rank and a small nullspace basis of a polynomial matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262779)
