Some efficient methods for enclosing simple zeros of nonlinear equations
From MaRDI portal
Three methods for solving univariate equations are presented. The methods are derivative free and render nested sequences of intervals converging to a zero of the equation. The common feature of the methods are so- called double length secant steps, which aim to improve enclosing intervals that have been obtained by preceding bracketing phases. The interval widths of the first algorithm converge \(Q\)-quadratically to zero. Two function evaluations each iteration are needed finally (that is, from a certain stage of the computation). The second algorithm uses quadratic interpolation polynomials, converges with \(Q\)-order 4, and needs three function evaluations finally each iteration. The third algorithm arises from the second one by replacing a secant step with a simple bisection. In this case, convergence is of \(R\)-order \((3+\sqrt {13})/2\), and three function evaluations each step are needed.
Recommendations
- Efficient methods for enclosing solutions of systems of nonlinear equations
- An improved regula-falsi method for enclosing simple zeros of nonlinear equations
- On Enclosing Simple Roots of Nonlinear Equations
- An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
- A simple but efficient multiple zero-finder for solving non-linear equations
- A derivative free method with cubic convergence of both interval and point for enclosing simple zeros of nonlinear equations
- On Newton-like methods to enclose solutions of nonlinear equations
- Enclosing the solutions of nonlinear systems of equations
- An improved regula falsi method for finding simple zeros of nonlinear equations
- Publication:4885370
Cites work
- A new class of interval methods with higher order of convergence
- Eingrenzung von Lösungen nichtlinearer Gleichungen durch Verfahren mit höherer Konvergenzgeschwindigkeit. (Inclusion of solutions of nonlinear equations by methods with higher convergence rate).
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3487225 (Why is no real title available?)
- scientific article; zbMATH DE number 3316497 (Why is no real title available?)
- Methods without secant steps for finding a bracketed root
- On Q-order and R-order of convergence
- On Two Higher Order Enclosing Methods of J. W. Schmidt
Cited in
(38)- Adams-like techniques for zero-finder methods
- A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations
- An infinite precision bracketing algorithm with guaranteed convergence
- An improved regula falsi method with quadratic convergence of both diameter and point for enclosing simple zeros of nonlinear equations
- On first zero crossing points.
- New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems
- The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems
- A derivative free globally convergent method and its deformations
- A common framework for modified regula falsi methods and new methods of this kind
- A method to accelerate the convergence of the secant algorithm
- Always convergent iteration methods for nonlinear equations of Lipschitz functions
- A family of modified Ostrowski methods with accelerated sixth order convergence
- Superlinear bracketing method for solving nonlinear equations
- Polynomial approximation of \(C^M\) functions by means of boundary values and applications: A survey
- Improved Muller method and bisection method with global and asymptotic superlinear convergence of both point and interval for solving nonlinear equations
- An improvement to Ostrowski root-finding method
- An exponential regula falsi method for solving nonlinear equations
- Efficient methods for enclosing solutions of systems of nonlinear equations
- A parallel root-finding algorithm
- Algorithm 631
- scientific article; zbMATH DE number 4078655 (Why is no real title available?)
- scientific article; zbMATH DE number 4098624 (Why is no real title available?)
- scientific article; zbMATH DE number 176431 (Why is no real title available?)
- scientific article; zbMATH DE number 1206075 (Why is no real title available?)
- scientific article; zbMATH DE number 474584 (Why is no real title available?)
- On Enclosing Simple Roots of Nonlinear Equations
- Algorithm 748: enclosing zeros of continuous functions
- scientific article; zbMATH DE number 1161045 (Why is no real title available?)
- New high-order convergence iteration methods without employing derivatives for solving nonlinear equations
- A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root
- Improving the efficiency index in enclosing a root of an equation
- Combined bracketing methods for solving nonlinear equations
- An improvement of the Euler-Chebyshev iterative method
- Some substantial modifications and improvements for derivative-free iterative methods and derivative-free transformation for multiple zeros
- An improved exponential regula falsi methods with quadratic convergence of both diameter and point for solving nonlinear equations
- A modification of Muller's method
- An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations
- A derivative free method with cubic convergence of both interval and point for enclosing simple zeros of nonlinear equations
This page was built for publication: Some efficient methods for enclosing simple zeros of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196877)
