Gröbner duality and multiplicities in polynomial system solving

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Gröbner duality and multiplicities in polynomial system solving

Full text

Pdf (1.27 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: 167 - 179

Year of Publication: 1995

ISBN:0-89791-699-9

Authors

Maria Grazia Marinari	Dipartimento di Matematica, Università di Genova
Teo Mora	Dipartimento di Informatica, Università di Genova
Hans Michael Möller	Fachbereich Mathematik, FernUniversität Hagen

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): 2, Downloads (12 Months): 15, Citation Count: 5

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

	ABRW	M. E. Alonso, E. Becker, M.-F. Roy, T. WSrmann, Zeroes, multiplicities and idempotents for zerodimensionaI systems, Proc. MEGA '94 (eds.: T. Recio and L. Gonzalez-Vega), to appear.
	BK	S. Beck, M. Kreuzer How to compute the canonical module of a set of points Proc. MEGA '94 (eds.: T. Recio and L. Gonzalez-Vega), to appear.
	C	J. P. Cardinal Dualitg et algorithmes interactifs pour Ia rgsolution de syst~mess polynomiaux, Th~se, Rennes I (1993)
	D	D. Dural, Diverses questions rglatives au calcul formel avec de hombres alg~briques, Th~se d'I~tat, Grenoble 1987.
	FGLM	J. C. Faugère , P. Gianni , D. Lazard , T. Mora, Efficient computation of zero-dimensional Gro¨bner bases by change of ordering, Journal of Symbolic Computation, v.16 n.4, p.329-344, Oct. 1993 [doi>10.1006/jsco.1993.1051]
	FGS	N. Fitchas, M.Giusti, F. Smietanski, Sur Ia complexit~ du thgor~me des zgros, to appear in Proc. 2nd International Conference on Non-Linear Optimization and Approximation, La Habana, September 1993 (Cuba), edited by J. Guddat and Brosowski, Peter Lange Verlag, Frankfurt am Main.
	G	A. Galligo, A propos du Thdor~rne de Pr@aration de Weierstrass, L.N. Math 409 (1974), pp. 543-579.
	GM	P. Gianni , T. Mora, Algebraic solution of systems of polynomial equations using Groebner bases, Proceedings of the 5th international conference, AAECC-5 on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.247-257, June 1987, Menorca, Spain
	Gr	W. GrSbner, Algebraische Geometrie II, B.I, Hochschultaschenb/icher, vol 737/737a, Bibliogr. Inst. Mannheim (1970).
	L89	D. Lazard, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, v.13 n.2, p.117-131, Feb. 1992 [doi>10.1016/S0747-7171(08)80086-7]
	L93	D. Lazard, Systems of algebraic equations (algorithms and complexity), in D. Eisenbud, L. Robbiano Eds. Computational Algebraic Geometry and Commutative Algebra, D. Eisenbud, L. Robbiano Eds., Cambridge (1993), 106-150.
	MMM1	M.G.Marinari, H.M. MSller, T. Morn, Gr6bner bases of ideals defined by functionals with an application to ideals of projective points, AAECC 4 (1993), 103-145.
	MMM2	M.G.Marinari, H.M. MSller, T. Morn, On multiplicity in polynomial system solving, preprint.
	MS	H. Michael Möller , Hans J. Stetter, Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems, Numerische Mathematik, v.70 n.3, p.311-329, May 1995 [doi>10.1007/s002110050122]
	M	H.M. MSller, On decomposing systems of polynomial equations with finitely many solutions, J. Appl. Algebra 4 (1993), 217-230.
	MT	T. Morn, C. Traverso, Natural representation of algebraic numbers, in preparation.

CITED BY 5

	Didier Bondyfalat , Bernard Mourrain , Victor Y. Pan, Controlled iterative methods for solving polynomial systems, Proceedings of the 1998 international symposium on Symbolic and algebraic computation, p.252-259, August 13-15, 1998, Rostock, Germany
	Itnuit Janovitz-Freireich , Lajos Rónyai , Ágnes Szántó, Approximate radical of ideals with clusters of roots, Proceedings of the 2006 international symposium on Symbolic and algebraic computation, July 09-12, 2006, Genoa, Italy
	Xiaoli Wu , Lihong Zhi, Computing the multiplicity structure from geometric involutive form, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, July 20-23, 2008, Linz/Hagenberg, Austria
	Barry H. Dayton, Numerical local rings and local solution of nonlinear systems, Proceedings of the 2007 international workshop on Symbolic-numeric computation, July 25-27, 2007, London, Ontario, Canada
	Scott R. Pope , Agnes Szanto, Nearest multivariate system with given root multiplicities, Journal of Symbolic Computation, v.44 n.6, p.606-625, June, 2009