Methods without secant steps for finding a bracketed root
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3454754 (Why is no real title available?)
- scientific article; zbMATH DE number 3316497 (Why is no real title available?)
- A Method for Solving Algebraic Equations Using an Automatic Computer
- A modified regula falsi 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 algorithm with guaranteed convergence for finding a zero of a function
- An improved pegasus method for root finding
- The Use of Rational Functions in the Iterative Solution of Equations on a Digital Computer
- The “Pegasus” method for computing the root of an equation
Cited in
(10)- Solution of constrained nonlinear equations in modelling the release of liquified gases
- A common framework for modified regula falsi methods and new methods of this kind
- Some efficient methods for enclosing simple zeros of nonlinear equations
- Improved bracketing parabolic method for numerical solution of nonlinear equations
- Efficient polynomial root-refiners: a survey and new record efficiency estimates
- On Enclosing Simple Roots of Nonlinear Equations
- Sixth order methods for solving equations
- On an iterative algorithm of order 1.839… for solving nonlinear operator equations∗)
- A note on King's method F for finding a bracketed root
- Several new methods for solving equations
This page was built for publication: Methods without secant steps for finding a bracketed root
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1228179)
