A general approach to isolating roots of a bitstream polynomial (Q655157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3535915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fastest exact algorithms for the isolation of the real roots of a polynomial equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Vincent's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the stratification and triangulation of an algebraic surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval arithmetic in cylindrical algebraic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple roots in Descartes' rule and their distance to roots of higher derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Algebra in Scientific Computing / 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: Modular algorithms in symbolic summation and symbolic integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the Descartes method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sylvester-Habicht sequences and fast Cauchy index computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for computing Hong's bound on absolute positiveness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for isolating real roots of a real polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5290272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and parallel complexity of approximate evaluation of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient isolation of polynomial's real roots. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple but exact and efficient algorithm for complex root isolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of real root isolation using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of real root isolation using continued fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953977 / rank
 
Normal rank

Revision as of 18:52, 4 July 2024

scientific article
Language Label Description Also known as
English
A general approach to isolating roots of a bitstream polynomial
scientific article

    Statements

    A general approach to isolating roots of a bitstream polynomial (English)
    0 references
    0 references
    2 January 2012
    0 references
    real polynomial
    0 references
    root isolation
    0 references
    bitstream coefficients
    0 references
    root perturbation bounds
    0 references
    adaptive precision management
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers