Asymptotically fast polynomial matrix algorithms for multivariable systems

Simple item page
dc.creatorJeannerod, Claude-Pierre
dc.creatorVillard, Gilles
dc.date2005-08-25
dc.date.accessioned2026-07-07T03:23:23Z
dc.date.available2026-07-07T03:23:23Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0508113
dc.identifierhttp://arxiv.org/abs/cs/0508113
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32921
dc.subjectSymbolic Computation
dc.subjectComputational Complexity
dc.subjectI.1; F.2.1
dc.titleAsymptotically fast polynomial matrix algorithms for multivariable systems
dc.typetext

Files

Collections

arXiv