Condition number based complexity estimate for solving polynomial systems (Q629539): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2010.11.018 / rank
Normal rank
 
Property / author
 
Property / author: Zhi Ming Zheng / rank
Normal rank
 
Property / author
 
Property / author: Zhi Ming Zheng / 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.1016/j.cam.2010.11.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074519436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decision method for elementary algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates depending on condition and round-off error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate zeros and condition numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4372496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete algorithm for counting real solutions of polynomial systems of equations and inequalities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in computer algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3360296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of elementary algebra and geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition number based complexity estimate for computing local extrema / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2010.11.018 / rank
 
Normal rank

Latest revision as of 22:55, 9 December 2024

scientific article
Language Label Description Also known as
English
Condition number based complexity estimate for solving polynomial systems
scientific article

    Statements

    Condition number based complexity estimate for solving polynomial systems (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2011
    0 references
    A real-root-counting based method for deciding the feasibility of systems of polynomial equations is proposed. Along with this method, a modified Newton operator is used to efficiently approximate the real solutions when the systems are feasible.
    0 references
    real-root-counting
    0 references
    Newton operator
    0 references
    condition number
    0 references
    complexity analysis
    0 references
    systems of polynomial equations
    0 references

    Identifiers

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