Square-free pure triangular decomposition of zero-dimensional polynomial systems
Triangular sets are finite lists of non-constant polynomials arranged in a specific order based on their leading variables, where each polynomial's leading variable is less than that of the subsequent polynomials. They play a crucial role in computational algebra, particularly in solving polynomial systems. A triangular set \(T = [T_1, \ldots , T_t]\) is said to be square-free, if the discriminant of \(T_1\) with respect to its leading variable is not zero, and for each \(i\) the resultant of the separant of \(T_i\) and \([T_1, \ldots , T_i]\) for any \(i\) is zero. Triangular decomposition is a process that transforms a system of polynomials into a finite set of triangular sets. The paper presents the concept of Square-Free Pure Triangular Decomposition (SFPTD) for zero-dimensional polynomial systems and introduces an algorithm for its computation using Gröbner bases. It is proven that the arithmetic complexity of this algorithm can be single exponential in the square of the number of variables. Furthermore, this approach allows for the computation of isolating cubes of real solutions to the system and the radical of the ideal generated by the system. The algorithm has been implemented in Maple 2021, and its efficiency is compared to classical methods. The authors conclude that SFPTD could be a key approach for addressing challenges in computational algebraic geometry.
- Solving polynomial systems via truncated normal forms
- Zero decomposition with multiplicity for zero-dimensional polynomial systems
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
- Squarefree normal representation of zeros of zero-dimensional polynomial systems
- Algorithms for computing triangular decomposition of polynomial systems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algorithms for computing triangular decomposition of polynomial systems
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An algorithm for isolating the real solutions of semi-algebraic systems
- Automated inequality proving and discovering
- Computing triangular systems and regular systems
- Decomposing polynomial sets simultaneously into Gröbner bases and normal triangular sets
- Generic regular decompositions for parametric polynomial systems
- scientific article; zbMATH DE number 4214184 (Why is no real title available?)
- scientific article; zbMATH DE number 5722788 (Why is no real title available?)
- scientific article; zbMATH DE number 95107 (Why is no real title available?)
- scientific article; zbMATH DE number 3586510 (Why is no real title available?)
- scientific article; zbMATH DE number 1273642 (Why is no real title available?)
- scientific article; zbMATH DE number 1979251 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- On characteristic decomposition and quasi-characteristic decomposition
- On decomposing systems of polynomial equations with finitely many solutions
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- On the theories of triangular sets
- Real root isolation of regular chains
- Real solution isolation using interval arithmetic
- Ritt-Wu's decomposition algorithm and geometry theorem proving
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving
- Solving zero-dimensional algebraic systems
- Using Algebraic Geometry
- Zero decomposition algorithms for systems of polynomial equations
This page was built for publication: Square-free pure triangular decomposition of zero-dimensional polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594999)
