Asymptotically fast polynomial matrix algorithms for multivariable systems

Details Asymptotically fast polynomial matrix algorithms for multivariable systems Asymptotically fast polynomial matrix algorithms for multivariable systems

2005-08-25

arxiv.org/abs/cs/0508113v1

Computer Science

Symbolic Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotically fast polynomial matrix algorithms for multivariable systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotically fast polynomial matrix algorithms for multivariable systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotically fast polynomial matrix algorithms for multivariable systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262931