Improving the efficiency index in enclosing a root of an equation

DOI10.1007/BF02389896zbMath0872.65042OpenAlexW377661483MaRDI QIDQ676171

Yixun Shi

Publication date: 8 October 1997

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02389896

zbMATH Keywords

efficiency indexapproximate quadratic approximationinverse cubic interpolationroot enclosing algorithm

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• zeroin

Cites Work

• Unnamed Item
• Unnamed Item
• On Q-order and R-order of convergence
• Some efficient methods for enclosing simple zeros of nonlinear equations
• An efficient derivative-free method for solving nonlinear equations
• On Two Higher Order Enclosing Methods of J. W. Schmidt
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
• On Enclosing Simple Roots of Nonlinear Equations
• Algorithm 748: enclosing zeros of continuous functions

This page was built for publication: Improving the efficiency index in enclosing a root of an equation