A deterministic algorithm for inverting a polynomial matrix

DOI10.1016/j.jco.2014.09.004zbMath1309.65033OpenAlexW2107482418MaRDI QIDQ2254681

Arne Storjohann, Wei Zhou, George Labahn

Publication date: 6 February 2015

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2014.09.004

zbMATH Keywords

matrix inversionpolynomial matrixdeterministic algorithmnearly optimal algorithm

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Matrices over function rings in one or more variables (15A54)

Related Items (3)

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ An algorithm to recognize regular singular Mahler systems ⋮ On the complexity of inverting integer and polynomial matrices

Cites Work

• Unnamed Item
• Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)]
• Efficient algorithms for order basis computation
• Fast algorithms for the characteristic polynomial
• Fast projection methods for minimal design problems in linear system theory
• Essentially optimal computation of the inverse of generic polynomial matrices
• High-order lifting and integrality certification
• Normal forms for general polynomial matrices
• Computing minimal nullspace bases

This page was built for publication: A deterministic algorithm for inverting a polynomial matrix