Computing the multiplicity structure from geometric involutive form

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing the multiplicity structure from geometric involutive form

Full text

Pdf (423 KB)

Source

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

Linz/Hagenberg, Austria

SESSION: Contributed papers table of contents

Pages 325-332

Year of Publication: 2008

ISBN:978-1-59593-904-3

Authors

Xiaoli Wu	Key Laboratory of Mathematics Mechanization, AMSS, Beijing, China
Lihong Zhi	Key Laboratory of Mathematics Mechanization, AMSS, Beijing, China

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 26, Citation Count: 1

Additional Information:

abstract 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/1390768.1390812 What is a DOI?

ABSTRACT

We present a method based on symbolic-numeric reduction to geometric involutive form to compute the primary component and the differential operators f solution of a polynomial ideal. The singular solution can be exact or approximate. If the singular solution is known with limited accuracy, then we propose a new method to refine it to high accuracy.

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	Auzinger, W., and Stetter, H. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. Intern. Series in Numer. Math. 86 (1988), 11--30.
	2	Dan Bates , Chris Peterson , Andrew J. Sommese, A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set, Journal of Complexity, v.22 n.4, p.475-489, August 2006 [doi>10.1016/j.jco.2006.04.003]
	3	Bayer, D., and Stillman, M. A criterion for detecting m-regularity. Inventiones Mathematicae 87, 1 (1987), 1--11.
	4	Bonasia, J., Lemaire, F., Reid, G., Scott, R., and Zhi, L. Determination of approximate symmetries of differential equations. In CRM Proceedings and Lecture Notes (2004), pp. 233--249.
	5	Robert M. Corless , Patrizia M. Gianni , Barry M. Trager, A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.133-140, July 21-23, 1997, Kihei, Maui, Hawaii, United States [doi>10.1145/258726.258767]
	6	David A. Cox , John Little , Donal O'Shea, Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics), Springer-Verlag New York, Inc., Secaucus, NJ, 2007
	7	Damiano, A., Sabadini, I., and Struppa, D. Computational methods for the construction of a class of Noetherian operators. Experiment. Math. 16 (2007), 41--55.
	8	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 [doi>10.1145/1277500.1277514]
	9	Barry H. Dayton , Zhonggang Zeng, Computing the multiplicity structure in solving polynomial systems, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.116-123, July 24-27, 2005, Beijing, China [doi>10.1145/1073884.1073902]
	10	Jean Charles Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F₅), Proceedings of the 2002 international symposium on Symbolic and algebraic computation, p.75-83, July 07-10, 2002, Lille, France [doi>10.1145/780506.780516]
	11	Vladimir P. Gerdt , Yuri A. Blinkov, Involutive bases of polynomial ideals, Mathematics and Computers in Simulation, v.45 n.5-6, p.519-541, March 1998 [doi>10.1016/S0378-4754(97)00127-4]
	12	Patrizia Gianni , Barry Trager , Gail Zacharias, Gro¨bner bases and primary decomposition of polynomial ideals, Journal of Symbolic Computation, v.6 n.2-3, p.149-167, Oct./Dec. 1988 [doi>10.1016/S0747-7171(88)80040-3]
	13	Kauers, M., Ed. ISSAC '05 Proc. 2005 Internat. Symp. Symbolic Algebraic Comput. (New York, 2005), ACM Press.
	14	Hidetsune Kobayashi , Hideo Suzuki , Yoshihiko Sakai, Numerical calculation of the multiplicity of a solution to algebraic equations, Mathematics of Computation, v.67 n.221, p.257-270, Jan. 1998 [doi>10.1090/S0025-5718-98-00906-5]
	15	Kuranishi, M. On E.Cartan's prolongation theorem of exterior differential systems. Amer. J. Math 79 (1957), 1--47.
	16	Lakshman, Y. A single exponential bound on the complexity of computing Grobner bases of zero dimensional ideals. Effective Methods in Algebraic Geometry, Progress in Mathematics (1994), 227--234.
	17	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
	18	Lecerf, G. Quadratic Newton iteration for systems with multiplicity. Foundations of Computational Mathematics 2, 3 (2002), 247--293.
	19	Anton Leykin , Jan Verschelde , Ailing Zhao, Newton's method with deflation for isolated singularities of polynomial systems, Theoretical Computer Science, v.359 n.1, p.111-122, 14 August 2006 [doi>10.1016/j.tcs.2006.02.018]
	20	Leykin, A., Verschelde, J., and Zhao, A. Higher-order deflation for polynomial systems with isolated singular solutions. Manuscript, 19 pages, Jan 2007.
	21	Malgrange, B. Cartan involutiveness = Mumford regularity. Contemp. Math. 331 (2003), 193--205.
	22	Maria Grazia Marinari , Teo Mora , Hans Michael Möller, Gröbner duality and multiplicities in polynomial system solving, Proceedings of the 1995 international symposium on Symbolic and algebraic computation, p.167-179, July 10-12, 1995, Montreal, Quebec, Canada [doi>10.1145/220346.220368]
	23	Marinari, M., Mora, T., and M¨oller, H. On multiplicities in polynomial system solving. Trans. Amer. Math. Soc. 348 (1996), 3283--3321.
	24	Moller, H., and Sauer, T. H-bases for polynomial interpolation and system solving. Advances Comput. Math. 12 (2000), 23--35.
	25	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]
	26	H. Michael Möller , Ralf Tenberg, Multivariate polynomial system solving using intersections of Eigenspaces, Journal of Symbolic Computation, v.32 n.5, p.513-531, November 2001 [doi>10.1006/jsco.2001.0476]
	27	Mourrain, B. Isolated points, duality and residues. J. of Pure and Applied Algebra 117 & 118 (1996), 469--493.
	28	Bernard Mourrain, A New Criterion for Normal Form Algorithms, Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.430-443, November 15-19, 1999
	29	Bernard Mourrain , Philippe Trebuchet, Solving projective complete intersection faster, Proceedings of the 2000 international symposium on Symbolic and algebraic computation, p.234-241, July 2000, St. Andrews, Scotland [doi>10.1145/345542.345642]
	30	Mourrain, B., and Trebuchet, P. Algebraic methods for numerical solving. In Proceedings of the 3rd International Workshop on Symbolic and Numeric Algorithms for Scientific Computing (2002), pp. 42--47.
	31	Bernard Mourrain , Philippe Trebuchet, Generalized normal forms and polynomial system solving, Proceedings of the 2005 international symposium on Symbolic and algebraic computation, p.253-260, July 24-27, 2005, Beijing, China [doi>10.1145/1073884.1073920]
	32	Ojika, T. Modified deflation algorithm for the solution of singular problems. J. Math. Anal. Appl. 123 (1987), 199--221.
	33	Ojika, T., Watanabe, S., and Mitsui, T. Deflation algorithm for the multiple roots of a system of nonlinear equations. J. Math. Anal. Appl. 96 (1983), 463--479.
	34	Pommaret, J. Systems of Partial Differential Equations and Lie Pseudogroups. Gordon and Breach Science Publishers, 1978.
	35	Reid, G., Scott, R., Wu, W., and Zhi, L. Algebraic and geometric properties of nearby projectively involutive polynomial systems. Manuscript, 2005.
	36	Greg Reid , Jianliang Tang , Lihong Zhi, A complete symbolic-numeric linear method for camera pose determination, Proceedings of the 2003 international symposium on Symbolic and algebraic computation, p.215-223, August 03-06, 2003, Philadelphia, PA, USA [doi>10.1145/860854.860900]
	37	Reid, G., and Zhi, L. Solving polynomial systems via symbolic-numeric elimination method. J. Symbolic Comput. (2008). To appear.
	38	Seiler, W. Involution - The formal theory of differential equations and its applications in computer algebra and numerical analysis. Habilitation thesis, Univ. of Mannheim, Germany, 2002.
	39	Hans J. Stetter, Numerical Polynomial Algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, 2004
	40	Trebuchet, P. Vers une R´esolution Stable et Rapide des Equations Algebriques. Dissertation, Universite Pierre et Marie Curie, France, 2002.
	41	van der Waerden B. L. Algebra. Frederick Ungar Pub. Co., 1970.
	42	Wittkopf, A., and Reid, G. Fast differential elimination in C: The CDiffelim Environment. Comp. Phys. Comm. 139(2) (2001), 192--217.
	43	Zhi, L., and Reid, G. Solving nonlinear polynomial system via symbolic-numeric conference on polynomial system solving (2004), J. Faugere and F. Rouillier, Eds., pp. 50--53.