Zero Decomposition with Multiplicity of Zero-Dimensional Polynomial Systems

2010/11/07 by Yinglin Li, Li, Yinglin, Bican Xia +3
Computer Science · Mathematics · #Algebraic Geometry (math.AG) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO) #Symbolic Computation (cs.SC) #cs.LO #cs.SC #math.AG

paper · pdf · doi:10.48550/arxiv.1011.1634

Key words: polynomial system, zero decomposition, multiplicity, Wu's method

arxiv created 2010/11/07 · arxiv updated 2015/03/17

Abstract

We present a zero decomposition theorem and an algorithm based on Wu's method, which computes a zero decomposition with multiplicity for a given zero-dimensional polynomial system. If the system satisfies some condition, the zero decomposition is of triangular form.

Related

• Real Solution Isolation with Multiplicity of Zero-Dimensional Triangular Systems
• Multiplicity Preserving Triangular Set Decomposition of Two Polynomials
• Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems
• Solving via modular methods
• Computing Simple Multiple Zeros of Polynomial Systems