Extraneous factors in the Dixon resultant formulation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Extraneous factors in the Dixon resultant formulation

Full text

Pdf (1.06 MB)

Source

International Conference on Symbolic and Algebraic Computation archive
Proceedings of the 1997 international symposium on Symbolic and algebraic computation table of contents

Kihei, Maui, Hawaii, United States

Pages: 141 - 148

Year of Publication: 1997

ISBN:0-89791-875-4

Authors

Deepak Kapur	Institute for Programming and Logics, Dept. of Computer Science, SUNY Albany, Albany, NY
Tushar Saxena	Image Understanding Lab., GE Corporate R & D (CMA), Schenectady, NY

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 15, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258726.258768 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Thomas Becker , Volker Weispfenning , Heinz Kredel, Gro¨bner bases: a computational approach to commutative algebra, Springer-Verlag, London, 1993
	2	Buchberger B., GrSbner bases: An Algorithmic Method in Polynomial Ideal Theory, Multidimensional Systems Theory, N.K. Bose, ed., D. Reidel Publ. Co., 1985.
	3	John F. Canny , Ioannis Z. Emiris, An Efficient Algorithm for the Sparse Mixed Resultant, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.89-104, May 10-14, 1993
	4	Cheng C.C., McKay J. and Wang S.S., A chain rule for multivariate resultants, Proc. Amer. Math. Soc. 123 (1995), pp 1037-1047.
	5	S.-C. Chou, Mechanical geometry theorem proving, Kluwer Academic Publishers, Norwell, MA, 1987
	6	Ioannis Zacharias Emiris, Sparse elimination and applications in kinematics, University of California at Berkeley, Berkeley, CA, 1994
	7	Gelfaad I.M., Kapranov M.M. and Zelevinsky A.V., Discriminants, Resultants and Multidimensional Determinants, Birkh~iuser, Boston, 1994.
	8	Hong Hoon, Multivariate Resultants Under Composition, Technical Report, RISC Linz, Austria, 1996.
	9	Deepak Kapur , Tushar Saxena, Sparsity considerations in Dixon resultants, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.184-191, May 22-24, 1996, Philadelphia, Pennsylvania, United States [doi>10.1145/237814.237862]
	10	Deepak Kapur , Tushar Saxena, Comparison of various multivariate resultant formulations, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.187-194, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220370]
	11	Deepak Kapur , Tushar Saxena , Lu Yang, Algebraic and geometric reasoning using Dixon resultants, Proceedings of the international symposium on Symbolic and algebraic computation, p.99-107, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190372]
	12	Lazard D., Generalized Stewart Platform: How to compute with rigid motions?, Proc. 1MACS-SC, 1993.
	13	B. Mourrain, The 40 “generic” positions of a parallel robot, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.173-182, July 06-08, 1993, Kiev, Ukraine [doi>10.1145/164081.164120]
	14	Rojas J.M., Toric intersection Theory for Affine Root Counting, Preprint, Department of Mathematics, MIT, 1996. Also available online at http://wwwmath.mit.edu/,.,rojas.
	15	Ronga F. and Vust T., Stewart Platforms without Computer, Preprint, Department of Mathematics, University of Geneva, 1992.
	16	Tushar Saxena, Efficient variable elimination using resultants, State University of New York at Albany, Albany, NY, 1997
	17	Sturmfels B., Sparse Elimination Theory, Proc. Computat. Algebraic Geom. and Commut. Algebra, D. Eisenbud and L. Robbiano, eds., Cortona, Italy, Cambridge Univ. Press, June 1991.

CITED BY 8

	Manfred Minimair, Factoring sparse resultants of linearly combined polynomials, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.207-214, August 03-06, 2003, Philadelphia, PA, USA
	Manfred Minimair, Sparse Resultant under Vanishing Coefficients, Journal of Algebraic Combinatorics: An International Journal, v.18 n.1, p.53-73, July 2003
	Arthur D. Chtcherba , Deepak Kapur, Conditions for exact resultants using the Dixon formulation, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.62-70, July 2000, St. Andrews, Scotland
	Manfred Minimair, Sparse resultant of composed polynomials II unmixed--mixed case, Journal of Symbolic Computation, v.33 n.4, p.467-478, April 2002
	Arthur D. Chtcherba , Deepak Kapur, On the efficiency and optimality of Dixon-based resultant methods, Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.29-36, July 07-10, 2002, Lille, France
	Arthur D. Chtcherba , Deepak Kapur, Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation, Journal of Symbolic Computation, v.36 n.3-4, p.289-315, September 2003
	Manfred Minimair, Resultants of skewly composed polynomials, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Arthur D. Chtcherba , Deepak Kapur , Manfred Minimair, Cayley-Dixon projection operator for multi-univariate composed polynomials, Journal of Symbolic Computation, v.44 n.8, p.972-999, August, 2009