Solving zero-dimensional algebraic systems
From MaRDI portal
Publication:1190743
Let \(X_ 1,\ldots,X_ n\) be \(n\) variables ordered as \(X_ 1<X_ 2<\cdots<X_ n\). The main variable of a polynomial is the greatest variable in it. A set of \(n\) polynomials is called \textit{triangular} if the main variable of the \(i\)-th polynomial is \(X_ i\) and monic in \(X_ i\). Using this terminology, the author first remarks: Proposition 1. If \(K\) is a field, any maximal ideal in \(K[X_ 1,\ldots,X_ n]\) has a triangular system of generators. Proposition 2. Every system with a finite number of solutions (in an algebraic closure of \(K\)) is equivalent to the union of a finite number of triangular systems. Then he shows how to compute numerically the common zeros of a triangular set.
Recommendations
- scientific article; zbMATH DE number 939821
- Zero decomposition algorithms for systems of polynomial equations
- About solutions of algebraic systems
- Solving zero-dimensional systems through the rational univariate representation
- scientific article; zbMATH DE number 5520885
- Solving systems of algebraic equations
- scientific article; zbMATH DE number 5073897
- scientific article; zbMATH DE number 1263377
- scientific article; zbMATH DE number 5066558
Cited in
(63)- Thirty years of polynomial system solving, and now?
- Computing representations for radicals of finitely generated differential ideals
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- A new method for solving algebraic systems of positive dimension
- Determinantal formulae for the solution set of zero-dimensional ideals
- An algorithm for solving parametric linear systems
- Solutions of systems of algebraic equations and linear maps on residue class rings
- Direct methods for primary decomposition
- On decomposing systems of polynomial equations with finitely many solutions
- Factorization-free decomposition algorithms in differential algebra
- Gröbner bases and cocyclic Hadamard matrices
- Sparse FGLM algorithms
- Characteristic decomposition: from regular sets to normal sets
- On the theories of triangular sets
- Triangular sets for solving polynomial systems: a comparative implementation of four methods
- Complexity results for triangular sets
- A generalized Euclidean algorithm for geometry theorem proving
- Computing tropical points and tropical links
- Buchberger-Zacharias theory of multivariate Ore extensions
- Finding endomorphisms of Drinfeld modules
- Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
- Computing zero-dimensional tropical varieties via projections
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- Computing strong regular characteristic pairs with Gröbner bases
- Complexity of solving parametric polynomial systems
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection
- Computing and using minimal polynomials
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- Multiplicity-preserving triangular set decomposition of two polynomials
- On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
- A factorization algorithm for \(G\)-algebras and its applications
- On approximate triangular decompositions in dimension zero
- A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields
- Solving via modular methods
- scientific article; zbMATH DE number 3970886 (Why is no real title available?)
- scientific article; zbMATH DE number 27364 (Why is no real title available?)
- Automatic classification of normal forms
- scientific article; zbMATH DE number 1057751 (Why is no real title available?)
- ZERO DECOMPOSITION THEOREMS FOR COUNTING THE NUMBER OF SOLUTIONS FOR PARAMETRIC EQUATION SYSTEMS
- A Moment Approach to Analyze Zeros of Triangular Polynomial Sets
- scientific article; zbMATH DE number 939821 (Why is no real title available?)
- Separating linear forms and rational univariate representations of bivariate systems
- Chordal networks of polynomial ideals
- A moment approach to analyze zeros of triangular polynomial sets
- Using Galois ideals for computing relative resolvents
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- A solution to the global identification problem in DSGE models
- Elimination ideal and bivariate resultant over finite fields
- Algorithms for multivariate laurent series
- Deterministic neural networks optimization from a continuous and energy point of view
- CAD and topology of semi-algebraic sets
- A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
- Satisfiability modulo finite fields
- Square-free pure triangular decomposition of zero-dimensional polynomial systems
- Bivariate polynomial reduction and elimination ideal over finite fields
- Computing modular correspondences for abelian varieties
- A characterization of complex Hadamard matrices appearing in families of MUB triplets
- Solving systems of algebraic equations over finite commutative rings and applications
- Simple characteristic decomposition of polynomial sets
- Decomposition of polynomial ideals into triangular regular sequences
- Computing with algebraically closed fields
- A generalization of Stickelberger's theorem
- Properties of regular systems and algorithmic improvements for regular decomposition
This page was built for publication: Solving zero-dimensional algebraic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190743)
