On the maximum computing time of the bisection method for real root isolation (Q507151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Continued fraction real root isolation using the Hong root bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computing time of the continued fractions method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight recursion tree bounds for the Descartes method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5797046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient isolation of polynomial's real roots. / rank
 
Normal rank

Latest revision as of 08:44, 13 July 2024

scientific article
Language Label Description Also known as
English
On the maximum computing time of the bisection method for real root isolation
scientific article

    Statements

    On the maximum computing time of the bisection method for real root isolation (English)
    0 references
    0 references
    3 February 2017
    0 references
    polynomial roots
    0 references
    real roots
    0 references
    root isolation
    0 references
    computing time
    0 references
    algorithm analysis
    0 references
    dominance
    0 references
    bisection method
    0 references

    Identifiers