Solving zero-dimensional algebraic systems
From MaRDI portal
Publication:1190743
DOI10.1016/S0747-7171(08)80086-7zbMath0753.13012WikidataQ55883678 ScholiaQ55883678MaRDI QIDQ1190743
Publication date: 26 September 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials, factorization in commutative rings (13P05)
Related Items
Complexity results for triangular sets, On the connection between Ritt characteristic sets and Buchberger-Gröbner bases, Automatic classification of normal forms, Gröbner bases and cocyclic Hadamard matrices, Computing with algebraically closed fields, Computing zero-dimensional tropical varieties via projections, A factorization algorithm for \(G\)-algebras and its applications, A generalized Euclidean algorithm for geometry theorem proving, Chordal Networks of Polynomial Ideals, A solution to the global identification problem in DSGE models, Elimination ideal and bivariate resultant over finite fields, Deterministic neural networks optimization from a continuous and energy point of view, CAD and topology of semi-algebraic sets, Sparse FGLM algorithms, Characteristic decomposition: from regular sets to normal sets, Separating linear forms and rational univariate representations of bivariate systems, Computing modular correspondences for abelian varieties, Counting and enumerating feasible rotating schedules by means of Gröbner bases, A new method for solving algebraic systems of positive dimension, Computing strong regular characteristic pairs with Gröbner bases, Determinantal formulae for the solution set of zero-dimensional ideals, A moment approach to analyze zeros of triangular polynomial sets, On approximate triangular decompositions in dimension zero, An algorithm for solving parametric linear systems, Computing tropical points and tropical links, Solutions of systems of algebraic equations and linear maps on residue class rings, Using Galois ideals for computing relative resolvents, Complexity of solving parametric polynomial systems, Direct methods for primary decomposition, Properties of regular systems and algorithmic improvements for regular decomposition, Unmixed-dimensional decomposition of a finitely generated perfect differential ideal, Buchberger-Zacharias theory of multivariate Ore extensions, A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection, Thirty years of polynomial system solving, and now?, On the theories of triangular sets, Triangular sets for solving polynomial systems: a comparative implementation of four methods, Computing representations for radicals of finitely generated differential ideals, Finding endomorphisms of Drinfeld modules, Computing and using minimal polynomials, Complete numerical isolation of real roots in zero-dimensional triangular systems, A computational algebraic geometry approach to enumerate Malcev magma algebras over finite fields, Factorization-free decomposition algorithms in differential algebra, A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares, Multiplicity-preserving triangular set decomposition of two polynomials, On decomposing systems of polynomial equations with finitely many solutions, Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition
