An Adaptive Weighted Bisection Method For Finding Roots Of Non-Linear Equations
From MaRDI portal
Publication:4449523
The authors improve the weighted bisection method, in which a fixed weight is used to change the proportion of the subintervals, to an adaptive weighted method, by adapting the weights at each iteration. Numerical experiments are then presented in order to illustrate empirically the quadratic convergence of the method.
Recommendations
- A bisection method for systems of nonlinear equations
- On efficient weighted-Newton methods for solving systems of nonlinear equations
- scientific article; zbMATH DE number 736340
- Optimal iterative methods for finding multiple roots of nonlinear equations using weight functions and dynamics
- A rapid generalized method of bisection for solving systems of non-linear equations
- Adaptive Gauss-Newton method for solving systems of nonlinear equations
- Adaptive approximation by optimal weighted least-squares methods
- An adaptive nonmonotone line search technique for solving systems of nonlinear equations
- An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
Cites work
This page was built for publication: An Adaptive Weighted Bisection Method For Finding Roots Of Non-Linear Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449523)