Heuristics to accelerate the Dixon resultant

Mathematics and Computers in Simulation

Volumn 77, Issue 4, 2008, Pages 400-407

  Lewis, Robert H ^a  

^a FORDHAM UNIVERSITY   (United States)

Author keywords

Bezout; Dixon; Polynomial system; Resultant

Indexed keywords

DYNAMICAL SYSTEMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NONLINEAR EQUATIONS; POLYNOMIAL APPROXIMATION;

BEZOUT; COMPUTATIONAL CHEMISTRY; DIXON; POLYNOMIAL SYSTEMS;

HEURISTIC ALGORITHMS;

EID: 40649097746     PISSN: 03784754     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.matcom.2007.04.007     Document Type: Article

References (18)

1. P. Bikker, On Bezout's method for computing the resultant. RISC-Linz Report Series, Johannes Kepler University, Linz, Austria, 1995.
2. Bricard R. Memoire sur la theorie de l'octaedre articule. J. Math. Pures Appl. 3 (1897) 113-150. http://www.math.unm.edu/vageli/papers/bricard.pdf (English translation:
3. Buse L., Elkadi M., and Mourrain B. Generalized resultants over unirational algebraic varieties. J. Symbolic Comput. 29 (2000) 515-526
4. Coutsias E.A., Seok C., Jacobson M.J., and Dill K.A. A kinematic view of loop closure. J. Comput. Chem. 25 4 (2004) 510-528
5. Dixon A.L. The eliminant of three quantics in two independent variables. Proc. London Math. Soc. 6 (1908) 468-478
6. Emiris I.Z., and Canny J.F. Efficient incremental algorithms for the sparse resultant and the mixed volume. J. Symbolic Comput. 20 2 (1995) 117-149
7. H. Hong, personal communication.
8. Kapur D., and Saxena T. Comparison of various multivariate resultant formulations. In: Levelt A. (Ed). Proceedings of the ISSAC. Montreal, Canada (1995), ACM Press 187-194
9. Kapur D., Saxena T., and Yang L. Proceedings of the International Symposium on Symbolic and Algebraic Computation. Algebraic and geometric reasoning using Dixon resultants (1994), ACM Press
10. Kotsireas I.S., and Karamanos K. Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures. Int. J. Bifurcat. Chaos 14 7 (2004) 2417-2423
11. R.H. Lewis, Computer Algebra System Fermat. (2007) www.bway.net/∼lewis/.
12. Lewis R.H. Using the Dixon resultant on big problems. CBMS Conference. Texas A&M University (May 2002). http://www.math.tamu.edu/conferences/cbms/abs.html
13. Lewis R.H. Exploiting symmetry in a polynomial system with the Dixon resultant. International Conference on Applications of Computer Algebra (ACA). Lamar University, Texas (July 2004)
14. Lewis R.H., and Bridgett S. Conic tangency equations arising from Apollonius problems in biochemistry. Math. Comput. Simul. 61 2 (2003) 101-114
15. R.H. Lewis, E.A. Coutsias, Algorithmic search for flexibility using resultants of polynomial systems. Proceedings of the Automatic Deduction in Geometry Conference, Pontevedra, Spain, submitted for publication.
16. Little J. Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry. Adv. Appl. Math. 31 (2003) 463-500
17. D. Robertz, V. Gerdt, (2004) comparison of software systems at http://www.bway.net/∼lewis/fermat/gcdcomp.
18. Sommese A., Verschelde J., and Wampler C. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SINUM 38 6 (2001) 2022-2046