Robust algorithms for generalized Pham systems (Q626616): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00037-009-0268-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-009-0268-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060956339 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00037-009-0268-2 / rank
 
Normal rank

Latest revision as of 23:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Robust algorithms for generalized Pham systems
scientific article

    Statements

    Robust algorithms for generalized Pham systems (English)
    0 references
    0 references
    0 references
    0 references
    18 February 2011
    0 references
    \textit{D. Castro, M. Giusti, J. Heintz, G. Matera} and \textit{L. M. Pardo} [Found. Comput. Math. 3, No. 4, 347--420 (2003; Zbl 1049.68070)] introduced the concept of robustness of an algorithm for an input with parameters. In this paper, the problem for solving generalized Pham systems over the field of the complex numbers is considered. A generalized Pham system is a polynomial system of \(n\) equations in \(n\) variables, for some natural number \(n\), such that the system of the \(n\) leading forms does not have any solutions except zero. The Bezout number of a generalized Pham system is the number of solutions counted with multiplicity. To solve a system means to give a univariate polynomial whose solutions correspond to the solution of the system, and a polynomial map from the set of roots of the polynomial to the set of solutions of the system. The paper gives and upper and a lower bound for the complexity of this problem, in terms of the Bezout number. The model of computation is based on the concept of straight-line programs.
    0 references
    0 references
    straight line program
    0 references
    generalized Pham system
    0 references
    Bezout number
    0 references
    probabilistic algorithms
    0 references
    complexity
    0 references
    polynomial system solving
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references