Multipolynomial resultants and linear algebra

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Multipolynomial resultants and linear algebra

Full text

Pdf (917 KB)

Source

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

Berkeley, California, United States

Pages: 158 - 167

Year of Publication: 1992

ISBN:0-89791-489-9

Authors

Dinesh Manocha
John F. Canny

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): 24, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/143242.143300 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.

	BoT88	Michael Ben-Or, A deterministic algorithm for sparse multivariate polynomial interpolation, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.301-309, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62241]
	Buc85	B. Buchberger. Groebner bases: An algorithmic method in ideal theory, in N.K. Bose, editor, Multidimensional Systems Theory, pages 184-232. D. Reidel Publishing Co., 1985.
	Buc89	B. Buchberger, Applications of Gro¨bner basis in non-linear computational geometry, Geometric reasoning, MIT Press, Cambridge, MA, 1989
	Can88	John F. Canny, The complexity of robot motion planning, MIT Press, Cambridge, MA, 1988
	Can90	John Canny, Generalised characteristic polynomials, Journal of Symbolic Computation, v.9 n.3, p.241-250, March 1990 [doi>10.1016/S0747-7171(08)80012-0]
	Dix08	A.L. Dixon. The eliminant of three quantics in two independent variables. Proceedings of London Mathematical Society, 6:49-69,209-236, 1908.
	GBDM77	B.S. Garbow, J.M. Boyle, J. Dongarra, and C.B. Moler. Matrix Eigensystem Routines - EISPA CK Guide Extension, volume 51 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1977.
	GC90	Xiao Gao , Shang Chou, Implicitization of Rational Parametric Equations, University of Texas at Austin, Austin, TX, 1990
	GLR82	I. Gohberg, P. Lancaster, and L. Rodman. Matrix Polynomials. Academic Press, New York, 1982.
	Hof90	C.M. Hoffmann. Algebraic and numeric techniques for offsets and blends. In W. Dahmen, M. Gasca, and C. Micchelli, editors, Computations of Curves and Surfaces, pages 499-528. Kluwer Academic Publishers, 1990.
	Hof92	C. Hoffmann. Implicit curves and surfaces in computer aided geometric design. Technical report, Department of Computer Science CER-92-002, Purdue University, 1992.
	Jou89	Jean-Pierre Jouanolou. Le formalisme du r6sultant. Technical report, Universit4 Louis Pasteur, Department of Mathematics, France, 1989. Manuscript.
	Kal91	M. Kalkbrener. Three Contmbutions to Elimination Theory. PhD thesis, Technisch-Naturwissenschaftliche Fakultat, Johannes Kepler Universitat, Linz, 1991.
	KL88	Erich Kaltofen , Yagati N. Lakshman, Improved Sparse Multivariate Polynomial Interpolation Algorithms, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.467-474, July 04-08, 1988
	KL92	D. Kaput and Y.N. Laksman. Elimination methods: An introduction. In D. Kaput B. Donald and J. Mundy, editors, Symbolic and Numemcal Computation: an Integration. Academic Press, 1992. To Appear.
	Mac02	F.S. Macaulay. On some formula in elimination. Proceedings of London Mathematical Society, pages 3-27, May 1902.
	Mac21	F.S. Macaulay. Note on the resultant of a number of polynomials of the same degree. Proceedings of London Mathematical Society, pages 14-21, June 1921.
	Mac64	F.S. Macaulay. The Algebrazc Theory of Modular Systems. Stechert-Hafner Service Agency, New York, 1964.
	MC27	F. Morley and A.B. Coble. New results in elimination. Amemcan Journal of Mathematics, 49:463-488, 1927.
	MC91a	Dinesh Manocha , John Canny, Efficient techniques for multipolynomial resultant algorithms, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.86-95, July 15-17, 1991, Bonn, West Germany [doi>10.1145/120694.120706]
	MC91b	Dinesh Manocha, MultiPolynomial Resultant Algorithms, University of California at Berkeley, Berkeley, CA, 1991
	MC92	Dinesh Manocha , John F. Canny, Implicit representation of rational parametric surfaces, Journal of Symbolic Computation, v.13 n.5, p.485-510, May 1992
	Rit50	J.F. Rift. Differential Algebra. AMS Colloquium Publications, 1950.
	Sal85	G. Salmon. Lessons Introductory to the Modern Higher Algebra. G.E. Stechert & Co., New York, 1885.
	Stu91	B. Sturmfels. Sparse elimination theory. Technical Report 91-32, Mathematical Sciences Institute, Cornell University, 1991.
	SZ91	B. Sturmfels and A. Zelevinsky. Multigraded resultants of sylvester type. Technical report, Mathematical Sciences Institute, Cornell University, 1991. Manuscript.
	Wae50	B.L. Van Der Waerden. Modern Algebra (third edztion). F. Ungar Publishing Co., New York, 1950.
	Wil65	J. H. Wilkinson, The algebraic eigenvalue problem, Oxford University Press, Inc., New York, NY, 1988
	Wu78	W. Wu. On the decision problem and the mechanization of theorem proving in elementary geometry. Scientia Sinic.a, 21:150-172, 1978. Also in Bledsoe and Loveland, eds. Theorem Proving: After 25 years, Contemporary Mathematics, 29,213-234.
	Zip90	Richard Zippel, Interpolating polynomials from their values, Journal of Symbolic Computation, v.9 n.3, p.375-403, March 1990 [doi>10.1016/S0747-7171(08)80018-1]

CITED BY 4

	L. González-Vega , G. Trujillo, Implicitization of parametric curves and surfaces by using symmetric functions, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.180-186, July 10-12, 1995, Montreal, Quebec, Canada
	Ioannis Emiris , John Canny, A practical method for the sparse resultant, Proceedings of the 1993 international symposium on Symbolic and algebraic computation, p.183-192, July 06-08, 1993, Kiev, Ukraine
	Ioannis Z. Emiris , Ashutosh Rege, Monomial bases and polynomial system solving (extended abstract), Proceedings of the international symposium on Symbolic and algebraic computation, p.114-122, July 20-22, 1994, Oxford, United Kingdom
	G. Villard, Computing Popov and Hermite forms of polynomial matrices, Proceedings of the 1996 international symposium on Symbolic and algebraic computation, p.250-258, July 24-26, 1996, Zurich, Switzerland