Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/moc/BriquelCPR14, #quickstatements; #temporary_batch_1731461124002
 
(3 intermediate revisions by 3 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1205.0869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Numerical Homotopy Tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Smale's 17th problem: a probabilistic positive solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast linear homotopy to find approximate zeros of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem posed by Steve Smale / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical algorithm for zero counting. I: Complexity and accuracy / 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: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's Theorem I: Geometric Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. III: Condition number and packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Bezout's theorem. V: Polynomial time / 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: Q4501787 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000736017 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/moc/BriquelCPR14 / rank
 
Normal rank

Latest revision as of 02:51, 13 November 2024

scientific article; zbMATH DE number 6268305
Language Label Description Also known as
English
Fast computation of zeros of polynomial systems with bounded degree under finite-precision
scientific article; zbMATH DE number 6268305

    Statements

    Fast computation of zeros of polynomial systems with bounded degree under finite-precision (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 March 2014
    0 references
    Smale's 17th problem
    0 references
    finite-precision
    0 references
    round-off error
    0 references
    complex polynomial systems
    0 references
    fixed precise algorithm
    0 references
    variable precise algorithm
    0 references

    Identifiers

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