Greatest Common Divisors via Generalized syl ; ester and

@inproceedings{Bitmead2005GreatestCD,
  title={Greatest Common Divisors via Generalized syl ; ester and},
  author={Robert R. Bitmead and S.-Y. Kung},
  year={2005}
}
We present new methods for comoutiw the ereatest common . " " right divisor of polynomial matrices. These methods imolve the recently shldied generalized Sylvester and eeneralized Bezoutian resultant matrices,~hich require no polynomial o&ations. They can provide a row proper -test common right divisor, test for coprimeness and calculate dual d&cal indices. The generalized resultant matrices are developments of the d a r Sylvester and Bemutian resultants and many of the familiar properties of… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Fast and amble algorithms for the minimal design problem

  • T. Kailnth S.-Y. Kung, M. Morf
  • 1979

An algorithm for obtaining the minimal rcalilaliun of a lincar time - invariant system and dcterminmg if a system is rCabilizablcdelectable

  • E. J. Daviron. W. Gesing
  • I E E E Trans . Auromvl . ConC .
  • 1977

A minimization algorithm for the design of linear mullivariable ryrtcm 5

  • E. J. Daviron
  • Am . Morh . Sm .

Another theorcm relating Sylucrtsr ' s matrix and ihc greatcat common divisor

  • M. A. Laidacker
  • bnerr undSlabi 1 jiy ~ JDynvmIc Syrrem

Similar Papers

Loading similar papers…