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

DOI10.1145/1073884.1073927MaRDI QIDQ5262779zbMATH OpenOpenAlexFDO

Authors Arne Storjohann, Gilles Villard

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 algebrapolynomial matrixmatrix rankminimal polynomial basisnullspace basis

Mathematics Subject Classification ID

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

Recommendations

• Computing minimal nullspace bases
• Asymptotically fast polynomial matrix algorithms for multivariable systems
• On rank and null space computation of the generalized Sylvester matrix
• Computing column bases of polynomial matrices
• scientific article; zbMATH DE number 2151192

Cited in

(16)

• A fast recursive orthogonalization scheme for the Macaulay matrix
• Computing canonical bases of modules of univariate relations
• 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
• Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
• Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
• Construction of a minimal basis of the right null space of a singular multiparameter polynomial matrix
• Efficient computation of order bases
• Computing column bases of polynomial matrices
• Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
• Computing valuations of the Dieudonné determinants
• Generating a \(d\)-dimensional linear subspace efficiently
• Asymptotically fast polynomial matrix algorithms for multivariable systems
• On rank and null space computation of the generalized Sylvester matrix

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)