Asymptotically fast polynomial matrix algorithms for multivariable systems
Claude-Pierre Jeannerod, Gilles Villard
Abstract
We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer algebra techniques, minimal basis computations and matrix fraction expansion/reconstruction, and to polynomial matrix multiplication. Such reductions eventually imply that all these problems can be solved in about the same amount of time as polynomial matrix multiplication.
Create a lesson
Related papers
Exact certification for conic optimization over quadratic modules: partitions of unity and recession directions
Didier Henrion, Alaa Ibrahim, Victor Magron
Where models of minimal height are hard to find: cubic rational maps with a multiple fixed point
Elira Shaska
Construction and formal verification of a special topology on Zn: characterization of connected subsets
Ignacio Vega-Páez
On the Complexity of Computing with p-adic Lattices
Pierre Fromonot, Mercedes Haiech, Tristan Vaccon
Barik transform and Barik eliminant: a novel algebraic method to solve polynomial equations in the sine and cosine of one variable
Sandipan Bandyopadhyay
Automatic Certified Differentiation in Lean
Ramy Shahin