Anton Leykin
ABSTRACT
Consider an ideal I ⊂ R = C[x1,...,xn] defining a complex affine variety X ⊂ Cn. We describe the components associated to I by means of numerical primary decomposition (NPD). The method is based on the construction of deflation ideal I(d) that defines the deflated variety X(d) in a complex space of higher dimension. For every embedded component there exists d and an isolated component Y(d) of I(d) projecting onto Y. In turn, Y(d) can be discovered by existing methods for prime decomposition, in particular, the numerical irreducible decomposition, applied to X(d). The concept of NPD gives a full description of the scheme Spec(R/I) by representing each component with a witness set. We propose an algorithm to produce a collection of witness sets that contains a NPD and that can be used to solve the ideal membership problem for I.
- G. Attardi and C. Traverso. Strategy-accurate parallel Buchberger algorithms. J. Symbolic Comput., 21(4-6):411--425, 1996. Google Scholar
Digital Library
- D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. Bertini: software for numerical algebraic geometry. Available at http://www.nd.edu/~sommese/bertini.Google Scholar
- M. Caboara, P. Conti, and C. Traverso. Yet another ideal decomposition algorithm. In Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 1997), volume 1255 of Lecture Notes in Comput. Sci., pages 39--54. Springer, Berlin, 1997. Google Scholar
- B. Dayton and Z. Zeng. Computing the multiplicity structure in solving polynomial systems. In M. Kauers, editor, Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, pages 116--123. ACM, 2005. Google ScholarDigital Library
- W. Decker, G.-M. Greuel, and G. Pfister. Primary decomposition: algorithms and comparisons. In Algorithmic algebra and number theory (Heidelberg, 1997), pages 187--220. Springer, Berlin, 1999.Google Scholar
- D. Eisenbud, C. Huneke, and W. Vasconcelos. Direct methods for primary decomposition. Invent. Math., 110(2):207--235, 1992.Google ScholarCross Ref
- P. Gianni, B. Trager, and G. Zacharias. Gröbner bases and primary decomposition of polynomial ideals. J. Symbolic Comput., 6(2-3):149--167, 1988. Computational aspects of commutative algebra. Google ScholarDigital Library
- D. R. Grayson and M. E. Stillman. Macaulay 2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/.Google Scholar
- G. Lecerf. Quadratic Newton iteration for systems with multiplicity. Found. Comput. Math., 2:247--293, 2002.Google ScholarCross Ref
- A. Leykin. Numerical primary decomposition (webpage). www.math.umn.edu/$\sim$leykin/NPD.Google Scholar
- A. Leykin. PHCmaple: A Maple interface to the numerical homotopy algorithms in PHCpack. \newline www.math.umn.edu/$\sim$leykin/PHCmaple.Google Scholar
- A. Leykin, J. Verschelde, and A. Zhao. Newton's method with deflation for isolated singularities of polynomial systems. Theoretical Computer Science, 359(1-3):111--122, 2006. Google ScholarDigital Library
- A. Leykin, J. Verschelde, and A. Zhao. Higher-order deflation for polynomial systems with isolated singular solutions. In A. Dickenstein, F.-O. Schreyer, and A. J. Sommese, editors, Algorithms in Algebraic Geometry, volume 146 of The IMA Volumes in Mathematics and its Applications. Springer, 2008.Google Scholar
- F. S. Macaulay. The algebraic theory of modular systems. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1994. Revised reprint of the 1916 original, With an introduction by Paul Roberts.Google Scholar
- B. Mourrain. Isolated points, duality and residues. J. Pure Appl. Algebra, 117/118:469--493, 1997. Algorithms for algebra (Eindhoven, 1996).Google ScholarCross Ref
- T. Shimoyama and K. Yokoyama. Localization and primary decomposition of polynomial ideals. J. Symbolic Comput., 22(3):247--277, 1996. Google ScholarDigital Library
- A. Sommese, J. Verschelde, and C. Wampler. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal., 38(6):2022--2046, 2001. Google ScholarDigital Library
- A. J. Sommese and C. W. Wampler, II. The numerical solution of systems of polynomials. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2005.Google Scholar
- A. Steel. Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. J. Symbolic Comput., 40(3):1053--1075, 2005. Google ScholarDigital Library
- J. Verschelde. Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw., 25(2):251--276, 1999. Software available at http://www.math.uic.edu/ jan. Google ScholarDigital Library
Index Terms
- Numerical primary decomposition
Recommendations
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
In engineering and applied mathematics, polynomial systems arise whose solution sets contain components of different dimensions and multiplicities. In this article we present algorithms, based on homotopy continuation, that compute much of the geometric ...
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Let F1, F2,..., Ft be multivariate polynomials (with complex coefficients) in the variables z1, z2,..., Zn. The common zero locus of these polynomials, V(F1, F2,..., Ft) = {p ∈ Cn|Fi(p) = 0 for 1 ≤i ≤t}, determines an algebraic set. This algebraic set ...
Numerical Local Irreducible Decomposition
MACIS 2015: Revised Selected Papers of the 6th International Conference on Mathematical Aspects of Computer and Information Sciences - Volume 9582Globally, the solution set of a system of polynomial equations with complex coefficients can be decomposed into irreducible components. Using numerical algebraic geometry, each irreducible component is represented using a witness set thereby yielding a ...
Comments