On a class of omnibus algorithms for zero-finding

DOI10.1016/0885-064X(89)90014-9zbMath0669.65035MaRDI QIDQ1118978

Anna Trzmielak-Stanisławska, Andrzej S. Kozek

Publication date: 1989

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

iterative algorithmrootzero-findingNumerical examplesomnibus algorithms

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (1)

On dependence of MR- and MM-algorithms upon the value of switching control variable CTR

Uses Software

• zeroin

Cites Work

• Average case optimality
• A survey of information-based complexity
• On dependence of MR- and MM-algorithms upon the value of switching control variable CTR
• Bisection is optimal
• Any iteration for polynomial equations using linear information has infinite complexity
• Towards a calculus for admissibility
• A comparison of non-linear equation solvers
• An efficient derivative-free method for solving nonlinear equations
• Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
• On the structure of zero finders
• Comparison of a continuation method with Brent's method for the numerical solution of a single nonlinear equation
• Three New Rapidly Convergent Algorithms for Finding a Zero of a Function
• An algorithm with guaranteed convergence for finding a zero of a function
• A modified regula falsi method for computing the root of an equation
• The “Pegasus” method for computing the root of an equation
• A new high order method of regula falsi type for computing a root of an equation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a class of omnibus algorithms for zero-finding