Abstract
A new algorithm is presented for computing a column reduced form of a given full column rank polynomial matrix. The method is based on reformulating the problem as a problem of constructing a minimal polynomial basis for the right nullspace of a polynomial matrix closely related to the original one. The latter problem can easily be solved in a numerically reliable way. Three examples illustrating the method are included.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
