A fast and robust method for computing real roots of nonlinear equations
From MaRDI portal
Recommendations
- An efficient method based on progressive interpolation for solving non-linear equations
- A novel cubically convergent iterative method for computing complex roots of nonlinear equations
- A quadratically convergent iterative method for nonlinear equations
- A new method to solve nonlinear equations
- On a general class of multipoint root-finding methods of high computational efficiency
Cites work
- A family of modified Ostrowski's methods with optimal eighth order of convergence
- A family of Steffensen type methods with seventh-order convergence
- A new family of optimal eighth order methods with dynamics for nonlinear equations
- A non-iterative method for solving non-linear equations
- Accurate fourteenth-order methods for solving nonlinear equations
- An efficient family of weighted-Newton methods with optimal eighth order convergence
- An efficient method based on progressive interpolation for solving non-linear equations
- scientific article; zbMATH DE number 3516003 (Why is no real title available?)
- scientific article; zbMATH DE number 3187178 (Why is no real title available?)
- Iterative methods based on the signum function approach for solving nonlinear equations
- New iterative methods for solving nonlinear equation by using homotopy perturbation method
- On efficient two-parameter methods for solving nonlinear equations
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- Optimal Order of One-Point and Multipoint Iteration
- Ostrowski type methods for solving systems of nonlinear equations
- Sixteenth-order method for nonlinear equations
- Two weighted eight-order classes of iterative root-finding methods
Cited in
(14)- A common framework for modified regula falsi methods and new methods of this kind
- A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
- Improved bracketing parabolic method for numerical solution of nonlinear equations
- A new algorithm for solving all the real roots of a nonlinear system of equations in a given feasible region
- Improved subdivision scheme for the root computation of univariate polynomial equations
- Kizner's method for approximately computation of real root of nonlinear equation f(x)=0
- An efficient method based on progressive interpolation for solving non-linear equations
- A Rapid Robust Rootfinder
- scientific article; zbMATH DE number 1504478 (Why is no real title available?)
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- Explicit formulae for progressively computing a real root of the smooth function
- Scaled parallel iterative method for finding real roots of nonlinear equations
- Global root bracketing method with adaptive mesh refinement
- Progressive explicit formulae for root-finding problems based on reparameterization
This page was built for publication: A fast and robust method for computing real roots of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q518465)
