An interval version of the secant method (Q762884): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the range of values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm with guaranteed convergence for finding a zero of a function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved pegasus method for root finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval iteration for zeros of systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank

Latest revision as of 16:01, 14 June 2024

scientific article
Language Label Description Also known as
English
An interval version of the secant method
scientific article

    Statements

    An interval version of the secant method (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The paper is mainly concerned with a modification of the secant method which is based on interval arithmetic ideas. Interval arithmetic is used to force global convergence of any local zero finder without sacrifying convergence speed. Unfortunately no numerical examples are given.
    0 references
    secant method
    0 references
    Interval arithmetic
    0 references
    global convergence
    0 references
    local zero finder
    0 references

    Identifiers