Solving systems of algebraic equations by a general elimination method (Q1104981): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Iteration Methods for Finding all Zeros of a Polynomial Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Résolution des systèmes d'équations algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963106 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(88)80032-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054322375 / rank
 
Normal rank

Latest revision as of 08:56, 30 July 2024

scientific article
Language Label Description Also known as
English
Solving systems of algebraic equations by a general elimination method
scientific article

    Statements

    Solving systems of algebraic equations by a general elimination method (English)
    0 references
    0 references
    0 references
    0 references
    1988
    0 references
    The authors give two algorithms to factorize the U-resultant of a set of polynomials in n variables: in the first one they use a Gröbner basis; in the second one they factorize the U-resultant into linear factors. In the appendix they give examples of solutions.
    0 references
    algorithms
    0 references
    resultant
    0 references
    polynomials
    0 references
    Gröbner basis
    0 references

    Identifiers