Solving systems of algebraic equations by a general elimination method

DOI10.1016/S0747-7171(88)80032-4zbMath0648.12017OpenAlexW2054322375MaRDI QIDQ1104981

Tetsuro Fujise, Akio Furukawa, Hidetsune Kobayashi

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80032-4

zbMATH Keywords

algorithmsGröbner basispolynomialsresultant

Mathematics Subject Classification ID

Equations in general fields (12E12) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items

An improvement of the rational representation for high-dimensional systems, Probing a set of hyperplanes by lines and related problems, Exact symbolic-numeric computation of planar algebraic curves, Root isolation of zero-dimensional polynomial systems with linear univariate representation, Liouvillian solutions of linear differential equations of order three and higher, A note on upper bounds for ideal-theoretic problems, Solutions of systems of algebraic equations and linear maps on residue class rings, A Gröbner free alternative for polynomial system solving, On the Bézout construction of the resultant, Probing the arrangement of hyperplanes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Résolution des systèmes d'équations algébriques
• Comments on the translation of my PhD thesis: ``An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination]
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously