Abstract
Numerical properties of a computational algorithm for the scalar Bezout identity in the ring of proper stable rational functions is studied in this paper. The method has been implemented in the MATLAB 6.5 computational environment using the pre-release version 3.0 of the Polynomnial Toolbox and exposed to extensive numerical testing. The results are summarized and some useful guidelines for using this well known algorithm are given.
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
