Generalised characteristic polynomials (Q916718): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bounds for the degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Matrix Inversion Algorithms / 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: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials / rank
 
Normal rank

Latest revision as of 08:53, 21 June 2024

scientific article
Language Label Description Also known as
English
Generalised characteristic polynomials
scientific article

    Statements

    Generalised characteristic polynomials (English)
    0 references
    1990
    0 references
    This paper is devoted to the extension of the classical elimination by resultant between two polynomials in one variable to the case of n polynomials in m variables with the coefficients in a field K. The key tool of the author's construction is the introduction of the generalized characteristic polynomial of the polynomials \(f_ 1,...,f_ n\). The construction is motivated by a result of \textit{F. S. Macaulay} [Proc. Lond. Math. Soc. 35, 3-27 (1902; JFM 34.0195.01)]. It is proved that the generalized characteristic polynomials have successful applications in elimination theory. The author confers his methods with the resultant- based methods of Van der Waerden, Bajaj-Garrity-Warren and others. It is described a single-exponential time algorithm for finding the isolated solution points of a system of \(n\) non-homogeneous polynomials in n variables.
    0 references
    polynomial elimination
    0 references
    generalized characteristic polynomial
    0 references
    single-exponential time algorithm
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references