Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets

Full text

Pdf (1.18 MB)

Source

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

Montreal, Quebec, Canada

Pages: 59 - 67

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

Shankar Krishnan	Department of Computer Science, University of North Carolina, Chapel Hill, NC
Dinesh Manocha	Department of Computer Science, University of North Carolina, Chapel Hill, NC

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): 1, Downloads (12 Months): 6, Citation Count: 3

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

	AB88	Shreeram S. Abhyankar , Chandrajit L. Bajaj, Computations with Algebraic Curves, Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation, p.274-284, July 04-08, 1988
	ABB+92	E. Anderson , Z. Bai , C. Bischof , J. Demmel , J. Dongarra , J. Du Croz , A. Greenbaum , S. Hammarling , A. McKenney , S. Ostrouchov , D. Sorensen, LAPACK's user's guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992
	Abh90	S.S. Abhyankar. Algebraic Geometry for Scientists and Engineers. American Mathematical Society, Providence, R. I., 1990.
	AF88	Stefan Arnborg , Huichun Feng, Algebraic decomposition of regular curves, Journal of Symbolic Computation, v.5 n.1-2, p.131-140, February/April 1988 [doi>10.1016/S0747-7171(88)80009-9]
	AM88	Dennis S. Arnon , Scott McCallum, A polynomical-time algorithm for the topological type of a real algebraic curve, Journal of Symbolic Computation, v.5 n.1-2, p.213-236, February/April 1988 [doi>10.1016/S0747-7171(88)80013-0]
	Arn83	Dennis S. Arnon, Topologically reliable display of algebraic curves, ACM SIGGRAPH Computer Graphics, v.17 n.3, p.219-227, July 1983
	AS86	W. Auzinger and H.J. Stetter. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In International Series of Numerical Mathematics, volume 86, pages 11-30, 1986.
	BHHL88	C. L. Bajaj , C. M. Hoffman , R. E. Lynch , J. E. H. Hopcroft, Tracing surface intersections, Computer Aided Geometric Design, v.5 n.4, p.285-307, Nov. 1988 [doi>10.1016/0167-8396(88)90010-6]
	BR90	Chandrajit L. Bajaj , Andrew V. Royappa, The GANITH algebraic geometry toolkit, Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems, p.268-269, April 10-12, 1990
	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
	CE93	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
	CH	G.W. Crippen and T.F. Havel. Distance geometry and molecular conformation. Research Studies Press, New York.
	Col75	George E. Collins, Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages, p.134-183, May 20-23, 1975
	Cra89	John J. Craig, Introduction to Robotics: Mechanics and Control, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	Dix08	A.L. Dixon. The eliminant of three quantics in two independent variables. Proceedings o/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 - EISPACK Guide Extension, volume 51. Springer-Verlag, Berlin, 1977.
	GL89	G.H. Golub and C.F. Van Loan. Matrix Computations. John Hopkins Press, Baltimore, 1989.
	GLR82	I. Gohberg, P. Lancaster, and L. Rodman. Matrix Polynomials. Academic Press, New York, 1982.
	GZ79	C.B. Garcia and W.I. Zangwill. Finding all solutions to polynomial systems and other systems of equations. Math. Prog.~ 16:159-176, 1979.
	Hof89	Christoph M. Hoffmann, Geometric and solid modeling: an introduction, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1989
	Hof90	C. M. Hoffmann, A dimensionality paradigm for surface interrogations, Computer Aided Geometric Design, v.7 n.6, p.517-532, Nov. 1990 [doi>10.1016/0167-8396(90)90013-H]
	Hoh91	M.E. Hohmeyer. A surface intersection algorithm based on loop detection. International Journal of Computational Geometry and Applications, 1(4):473-490, 1991. Special issue on Solid Modeling.
	Jou91	Jean-Pierre Jouanolou. Le Formalisme du Rdsultant, volume 90 of Advances in Mathematics. 1991.
	Kat80	T. Kato. Perturbation Theory for Linear Operators. Springer Verlag, Berlin, 2 edition, 1980.
	Laz83	Daniel Lazard, Gröbner-Bases, Gaussian elimination and resolution of systems of algebraic equations, Proceedings of the European Computer Algebra Conference on Computer Algebra, p.146-156, March 28-30, 1983
	Mac02	F.S. Macaulay. On some formula in elimination. Proceedings of London Mathematical Society, 1(33):3- 27, May 1902.
	Man92	Dinesh Manocha, Algebraic and numeric techniques in modeling and robotics, University of California at Berkeley, Berkeley, CA, 1992
	Man94	Dinesh Manocha, Computing selected solutions of polynomial equations, Proceedings of the international symposium on Symbolic and algebraic computation, p.1-8, July 20-22, 1994, Oxford, United Kingdom [doi>10.1145/190347.190349]
	MC27	F. Morley and A.B. Coble. New results in elimination. American journal o/ Mathematics, 49:463-488, 1927.
	MC91	D. Manocha and J.F. Canny. A new approach for surface intersection. International Journal of Computational Geometry and Applications, 1(4):491-516, 1991. Special issue on Solid Modeling.
	MD94a	Dinesh Manocha , James Demmel, Algorithms for intersecting parametric and algebraic curves I: simple intersections, ACM Transactions on Graphics (TOG), v.13 n.1, p.73-100, Jan. 1994 [doi>10.1145/174462.174617]
	MD94b	Dinesh Manocha , James Demmel, Algorithms for intersecting parametric and algebraic curves II: multiple intersections, Graphical Models and Image Processing, v.57 n.2, p.81-100, March 1995 [doi>10.1006/gmip.1995.1010]
	Moo79	Ramon E. Moore , Fritz Bierbaum, Methods and Applications of Interval Analysis (SIAM Studies in Applied and Numerical Mathematics) (Siam Studies in Applied Mathematics, 2.), Soc for Industrial & Applied Math, 1979
	Mor92	A.P. Morgan. Polynomial continuation and its relationship to the symbolic reduction of polynomial systems. In Symbolic and Numerical Computation for Artificial Intelligence, pages 23-45, 1992.
	PK92	J. Ponce and D.J. Kriegman. Elimination theory and computer vision: Recognition and positioning of curved 3d objects from range, intensity, or contours. In Symbolic and Numerical Computation for Artificial Intelligence, pages 123-146, 1992.
	Ren94	James Renegar, Is it possible to know a problem instance is ill-posed?: some foundations for a general theory of condition numbers, Journal of Complexity, v.10 n.1, p.1-56, March 1994 [doi>10.1006/jcom.1994.1001]
	SN91	Thomas W. Sederberg , Tomoyuki Nishita, Geometric Hermite approximation of surface patch intersection curves, Computer Aided Geometric Design, v.8 n.2, p.97-114, May 1991 [doi>10.1016/0167-8396(91)90036-B]
	Sny92	John M. Snyder, Interval analysis for computer graphics, Proceedings of the 19th annual conference on Computer graphics and interactive techniques, p.121-130, July 1992
	SS83	J.T. Schwartz and M. Sharir. On the piano movers probelem ii, general techniques for computing topo.- logical properties of real algebraic manifolds. Advances o~ Applied Maths, 4:298-351, 1983.
	SZ94	B. Sturmfels and A. Zelevinsky. Multigraded resultants of sylvester type. Journal of Algebra, 1994. To appear.
	Wal50	R.J. Walker. Algebraic Curves. Princeton University Press, New Jersey, 1950.

CITED BY 4

	Aaron Wallack , Ioannis Z. Emiris , Dinesh Manocha, MARS: a MAPLE/MATLAB/C resultant-based solver, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.244-251, August 13-15, 1998, Rostock, Germany
	Abel J. P. Gomes , José F. M. Morgado , Edgar S. Pereira, A BSP-based algorithm for dimensionally nonhomogeneous planar implicit curves with topological guarantees, ACM Transactions on Graphics (TOG), v.28 n.2, p.1-24, April 2009
	Dinesh Manocha , Shankar Krishnan, Solving algebraic systems using matrix computations, ACM SIGSAM Bulletin, v.30 n.4, p.4-21, Dec. 1996
	John F. Canny , Ioannis Z. Emiris, A subdivision-based algorithm for the sparse resultant, Journal of the ACM (JACM), v.47 n.3, p.417-451, May 2000