Please use this identifier to cite or link to this item:
|Title:||Fast computation of the Bezout and Dixon resultant matrices||Authors:||Chionh, E.-W.
|Issue Date:||2002||Citation:||Chionh, E.-W., Zhang, M., Goldman, R.N. (2002). Fast computation of the Bezout and Dixon resultant matrices. Journal of Symbolic Computation 33 (1) : 13-29. ScholarBank@NUS Repository. https://doi.org/10.1006/jsco.2001.0462||Abstract:||Efficient algorithms are derived for computing the entries of the Bezout resultant matrix for two univariate polynomials of degree n and for calculating the entries of the Dixon-Cayley resultant matrix for three bivariate polynomials of bidegree (m, n). Standard methods based on explicit formulas require O(n3) additions and multiplications to compute all the entries of the Bezout resultant matrix. Here we present a new recursive algorithm for computing these entries that uses only O(n2) additions and multiplications. The improvement is even more dramatic in the bivariate setting. Established techniques based on explicit formulas require O(m4n4) additions and multiplications to calculate all the entries of the Dixon-Cayley resultant matrix. In contrast, our recursive algorithm for computing these entries uses only O(m2n3) additions and multiplications. © 2002 Academic Press.||Source Title:||Journal of Symbolic Computation||URI:||http://scholarbank.nus.edu.sg/handle/10635/39280||ISSN:||07477171||DOI:||10.1006/jsco.2001.0462|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.