Square-free Strong Triangular Decomposition of Zero-dimensional Polynomial Systems

02/12/2022
by   Haokun Li, et al.
0

Triangular decomposition with different properties has been used for various types of problem solving, e.g. geometry theorem proving, real solution isolation of zero-dimensional polynomial systems, etc. In this paper, the concepts of strong chain and square-free strong triangular decomposition (SFSTD) of zero-dimensional polynomial systems are defined. Because of its good properties, SFSTD may be a key way to many problems related to zero-dimensional polynomial systems, such as real solution isolation and computing radicals of zero-dimensional ideals. Inspired by the work of Wang and of Dong and Mou, we propose an algorithm for computing SFSTD based on Gröbner bases computation. The novelty of the algorithm is that we make use of saturated ideals and separant to ensure that the zero sets of any two strong chains have no intersection and every strong chain is square-free, respectively. On one hand, we prove that the arithmetic complexity of the new algorithm can be single exponential in the square of the number of variables, which seems to be among the rare complexity analysis results for triangular-decomposition methods. On the other hand, we show experimentally that, on a large number of examples in the literature, the new algorithm is far more efficient than a popular triangular-decomposition method based on pseudo-division. Furthermore, it is also shown that, on those examples, the methods based on SFSTD for real solution isolation and for computing radicals of zero-dimensional ideals are very efficient.

READ FULL TEXT
research
01/22/2016

Computing the decomposition group of a zero-dimensional ideal by elimination method

In this note, we show that the decomposition group Dec(I) of a zero-dime...
research
11/09/2022

Certified Numerical Real Root Isolation of Zero-dimensional Multivariate Real Nonlinear Systems

Using the local geometrical properties of a given zero-dimensional squar...
research
08/09/2019

Computing zero-dimensional tropical varieties via projections

We present an algorithm for computing zero-dimensional tropical varietie...
research
03/14/2022

A p-adic Descartes solver: the Strassman solver

Solving polynomials is a fundamental computational problem in mathematic...
research
02/28/2017

Decomposition of polynomial sets into characteristic pairs

A characteristic pair is a pair (G,C) of polynomial sets in which G is a...
research
01/10/2021

A New Type of Bases for Zero-dimensional Ideals

We formulate a substantial improvement on Buchberger's algorithm for Grö...
research
12/23/2018

A new algorithm for irreducible decomposition of representations of finite groups

An algorithm for irreducible decomposition of representations of finite ...

Please sign up or login with your details

Forgot password? Click here to reset