Efficient techniques for multipolynomial resultant algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient techniques for multipolynomial resultant algorithms

Full text

Pdf (1.00 MB)

Source

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

Bonn, West Germany

Pages: 86 - 95

Year of Publication: 1991

ISBN:0-89791-437-6

Authors

Dinesh Manocha	Computer Science Division, University of California, Berkeley, CA
John Canny	Computer Science Division, University of California, Berkeley, CA

Sponsors

GMD : German Natl Research Ctr for Information Tech. - Gesellschft
German Comp Soc : GI - Gesellshaft for Informatik
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 16, Citation Count: 2

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

	BGW88	Bajaj, C., Garrity, T. and Warren, J. (November 1988) "On the applications of multi-equational resultants", Tech. report CSD-TR-826, Computer Science Deptt., Purdue University.
	BU85	Buchberger, B. (1987) "GrSbner bases: An algorithmic method in polynomial ideal theory", in Multidimensional Systems Theory, edited by N.K. Bose, pp. 184-232, D. Reidel Publishing Co..
	Bu89	B. Buchberger, Applications of Gro¨bner basis in non-linear computational geometry, Geometric reasoning, MIT Press, Cambridge, MA, 1989
	BT88	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]
	Ca87	John F. Canny, The complexity of robot motion planning, MIT Press, Cambridge, MA, 1988
	Ca90	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]
	DE89	Demmel, J. (1989) "LAPACK: A portable linear algebra library for supercomputers", IEEE Control systems society workshop on computer-aided control system design, Tampa, Florida.
	Di08	Dixon, A.L. (1908) "The eliminant of three quantics in two independent variables", Proceedings of London Mathematical Society, vol. 6, pp. 49-69, 473-492.
	GLR82	G'ohberg, I., Lancaster, P. and Rodman, L. (1982) Matrix polynomials, Academic Press, New York.
	GV89	Golub, G.H. and Van Loan, C. F. (1989) Matrix computations, The John Hopkins Press, Baltimore, Maryland.
	Ho90	Hoffmann, C. (1990) "Algebraic and numeric techniques for offsets and blends", in Computation of Curves and Surfaces, eds. W. Dahmen et. al., pp. 499-529, Kluwer Academic Publishers.
	Jo89	Jouanolou, Jean-Pierre (1989) "Le Formalisme Du R~sultant", Department of Mathemetics, Universit~ Louis Pasteur, France.
	KL88	Kaltofen, E. and Lakshman, Y.N. (1988) "Improved sparse multivariate polynomial interpolation algorithms", in Lecture Notes in Computer Science, vol. 358, pp. 467-474, Springer-Verlag.
	KLW90	E. Kaltofen , Y. N. Lakshman , J.-M. Wiley, Modular rational sparse multivariate polynomial interpolation, Proceedings of the international symposium on Symbolic and algebraic computation, p.135-139, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96912]
	Kn81	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	Lo83	Loos, R. 1983 "Computing rational zeros of integral polynomials by p-adic expansion" ,. SIAM Journal on Computing, vol. 7, pp. 286-293
	Ma02	Macaulay, F. S. (May 1902) "On some formula in elimination", Proceedings of London Mathematical Society, pp. 3-27.
	Ma21	Macaulay, F. S. (June 1921) "Note on the resultant of a number of polynomials of the same degree", Proceedings of London Mathematical Society, pp. 14-21.
	MC27	Morley, F. and Coble, A.B. (1927) "New results in elimination", American Journal of Mathematics, vol. 49, pp. 463-488.
	MC90	Dinesh Manocha , John F. Canny, Implicitizing Rational Parametric Surfaces, University of California at Berkeley, Berkeley, CA, 1990
	MC91a	Dinesh Manocha , John Canny, A new approach for surface intersection, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.209-219, June 05-07, 1991, Austin, Texas, United States [doi>10.1145/112515.112544]
	MC91b	Dinesh Manocha, MultiPolynomial Resultant Algorithms, University of California at Berkeley, Berkeley, CA, 1991
	Mi90	Milne, P. (1990) "On the solutions of a set of polynomial equations", manuscript, Department of Computer Science, University of Bath, England.
	MM82	Mayr E. and Meyer A. (1982) "The complexity of the word problem in commutative semigroups and polynomial ideals", Advances in Mathematics, vol. 46, pp. 305-329.
	Mo25	Morley, F. (1925) "The eliminant of a net of curves", American Journal of Mathematics, vol. 47', pp. 91-97.
	Mr87	Morgan, A.P. (1987) Solving polynomial systems using continuation for scientific and engineering problems, Prentice-Hall, Englewood Cliffs, New Jersey.
	Mr90	Morgan, A.P. (1990) "Polynomial continuation and its relationship to the symbolic reduction of polynomial systems", presented at the workshop on Integration of Numeric and Symbolic Computing Methods, Saratoga Springs, New York.
	Sa1885	Salmon, G. (1885) Lessons inlroduclory to the modern higher algebra, G.E. Stechert & Co., New York.
	Wd50	van der Waerden B. L. (1950) Modern algebra, (third edition) F. Ungar Publishing Co., New York.
	WM90	Wampler, C. and Morgan, A. (1990) "Numerical continuation methods for solving polynomial systems arising in kinematics", ASME Journal on Design, vol. 112, pp. 59-68.
	zi90	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 2

	Dinesh Manocha , John F. Canny, Multipolynomial resultants and linear algebra, Papers from the international symposium on Symbolic and algebraic computation, p.158-167, July 27-29, 1992, Berkeley, California, United States
	Chandrajit L. Bajaj , Andrew Royappa, Triangulation and display of rational parametric surfaces, Proceedings of the conference on Visualization '94, October 17-21, 1994, Washinton, D.C.