Abstract
We present the asymtotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank; nullspace; determinant; generic inverse reduced form (Giorgi et al. 2003, Storjohann 2003, Jeannerod and Villard 2005, Storjohann and Villard 2005). 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. The algorithms are deterministic, or randomized with certified output in a Las Vegas fashion.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
