Show simple item record

dc.contributor.authorChionh, Eng-Wee
Goldman, Ronald
Zhang, Ming
dc.date.accessioned 2017-08-02T22:03:47Z
dc.date.available 2017-08-02T22:03:47Z
dc.date.issued 1999-06-17
dc.identifier.urihttps://hdl.handle.net/1911/96509
dc.description.abstract A simple matrix transformation linking the resultant matrices of Sylvester and Bezout is derived. This transformation matrix is then applied to generate an explicit formula for each entry of the Bezout resultant, and this entry formula is used, in turn, to construct an efficient recursive algorithm for computing all the entries of the Bezout matrix. Hybrid resultant matrices consisting of some columns from the Sylvester matrix and some columns from the Bezout matrix provide natural transitions from the Sylvester to the Bezout resultant, and allow as well the Bezout construction to be generalized to two polynomials of different degrees. Such hybrid resultants are derived here, employing again the transformation matrix from the Sylvester to the Bezout resultant.
dc.format.extent 12 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Transformations and Transitions from the Sylvester to the Bezout Resultant
dc.type Technical report
dc.date.note June 17, 1999
dc.identifier.digital TR99-343
dc.type.dcmi Text
dc.identifier.citation Chionh, Eng-Wee, Goldman, Ronald and Zhang, Ming. "Transformations and Transitions from the Sylvester to the Bezout Resultant." (1999) https://hdl.handle.net/1911/96509.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record