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)
68W30: Symbolic computation and algebraic computation
65H10: Numerical computation of solutions to systems of equations
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
13P05: Polynomials, factorization in commutative rings
Related Items
Automatic classification of normal forms, 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, Computing with algebraically closed fields, Properties of regular systems and algorithmic improvements for regular decomposition, 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, 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, On approximate triangular decompositions in dimension zero
