Methods without secant steps for finding a bracketed root
From MaRDI portal
Publication:1228179
DOI10.1007/BF02252259zbMath0332.65028OpenAlexW170504220MaRDI QIDQ1228179
Publication date: 1976
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02252259
Related Items (10)
Solution of constrained nonlinear equations in modelling the release of liquified gases ⋮ On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗) ⋮ Efficient polynomial root-refiners: a survey and new record efficiency estimates ⋮ Sixth order methods for solving equations ⋮ A note on King's method F for finding a bracketed root ⋮ Several new methods for solving equations ⋮ Improved bracketing parabolic method for numerical solution of nonlinear equations ⋮ On Enclosing Simple Roots of Nonlinear Equations ⋮ Some efficient methods for enclosing simple zeros of nonlinear equations ⋮ A common framework for modified regula falsi methods and new methods of this kind
Cites Work
- Unnamed Item
- Unnamed Item
- A Method for Solving Algebraic Equations Using an Automatic Computer
- The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
- 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
- An improved pegasus method for root finding
This page was built for publication: Methods without secant steps for finding a bracketed root
