An interval version of the secant method
type: Item
instance of: scholarly article
title: An interval version of the secant method
zbMATH Open document ID: 0558.65027
DOI: 10.1007/BF02136035
author: Arnold Neumaier
published in: BIT
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 65G30
zbMATH DE Number: 3890619
zbMATH Keywords: secant method
zbMATH Keywords: Interval arithmetic
zbMATH Keywords: global convergence
zbMATH Keywords: local zero finder
MaRDI profile type: Publication
cites work: On computing the range of values
cites work: Q4099123
cites work: An algorithm with guaranteed convergence for finding a zero of a function
cites work: Q3672991
cites work: Q4176892
cites work: An improved pegasus method for root finding
cites work: Q3207999
cites work: Interval iteration for zeros of systems of equations
cites work: Q5732060
description: scientific article; zbMATH DE number 3890619