An algorithm for the simultaneous inclusion of real polynomial zeros (Q1098562): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0096-3003(88)90128-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982946766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Das symmetrische Einzelschrittverfahren bei linearen Gleichungen mit Intervallen als Koeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Krawczyk-Like Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex interval arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4048486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Am improved form of the Krawczyk-Moore algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Algorithm of Alefeld and Platzöder for Systems of Nonlinear Equations / rank
 
Normal rank

Latest revision as of 15:05, 18 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the simultaneous inclusion of real polynomial zeros
scientific article

    Statements

    An algorithm for the simultaneous inclusion of real polynomial zeros (English)
    0 references
    1988
    0 references
    The idea of the symmetric single-step method is applied to improving the zeros of a polynomial simultaneously. A lower bound for the so-called R- order of convergence is given. The method is illustrated using some numerical examples.
    0 references
    symmetric single-step method
    0 references
    zeros of a polynomial
    0 references
    lower bound
    0 references
    R-order of convergence
    0 references
    numerical examples
    0 references
    0 references
    0 references

    Identifiers