Efficient isolation of polynomial's real roots. (Q1421215): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MPSolve / 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.2003.08.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077961479 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55894335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Vincent's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval arithmetic in cylindrical algebraic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial root finding using iterated Eigenvalue computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and jumps and real roots. / rank
 
Normal rank

Latest revision as of 13:11, 6 June 2024

scientific article
Language Label Description Also known as
English
Efficient isolation of polynomial's real roots.
scientific article

    Statements

    Efficient isolation of polynomial's real roots. (English)
    0 references
    0 references
    0 references
    26 January 2004
    0 references
    The paper is devoted to the efficient isolation of real roots of a polynomial, by means of specific algorithms based on Descartes's rule of signs and on the bisection method. The hybrid version proposed by the authors, obtained by using an interval-arithmetic filter, is suitable for polynomials of high degree with huge integer coefficients. Detailed numerical comparative experiments are presented.
    0 references
    univariate polynomial
    0 references
    isolation of real root
    0 references
    Descartes's rule of signs
    0 references
    algorithm
    0 references
    bisection method
    0 references
    interval-arithmetic filter
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references

    Identifiers

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