Pages that link to "Item:Q1196877"
From MaRDI portal
The following pages link to Some efficient methods for enclosing simple zeros of nonlinear equations (Q1196877):
Displaying 31 items.
- Improving the efficiency index in enclosing a root of an equation (Q676171) (← links)
- Combined bracketing methods for solving nonlinear equations (Q712600) (← links)
- An improvement of the Euler-Chebyshev iterative method (Q819019) (← links)
- Some substantial modifications and improvements for derivative-free iterative methods and derivative-free transformation for multiple zeros (Q856166) (← links)
- An improved exponential regula falsi methods with quadratic convergence of both diameter and point for solving nonlinear equations (Q857027) (← links)
- A modification of Muller's method (Q879743) (← links)
- An improved bisection Newton-like method for enclosing simple zeros of nonlinear equations (Q905071) (← links)
- A derivative free method with cubic convergence of both interval and point for enclosing simple zeros of nonlinear equations (Q972095) (← links)
- Adams-like techniques for zero-finder methods (Q1021497) (← links)
- A new family of exponential iteration methods with quadratic convergence of both diameters and points for enclosing zeros of nonlinear equations (Q1029166) (← links)
- An infinite precision bracketing algorithm with guaranteed convergence (Q1293733) (← links)
- An improved regula falsi method with quadratic convergence of both diameter and point for enclosing simple zeros of nonlinear equations (Q1405068) (← links)
- On first zero crossing points. (Q1427655) (← links)
- New comparison theorem for the nonlinear multisplitting relaxation method for the nonlinear complementarity problems (Q1816691) (← links)
- The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems (Q1921253) (← links)
- A derivative free globally convergent method and its deformations (Q2048947) (← links)
- A common framework for modified regula falsi methods and new methods of this kind (Q2104373) (← links)
- A method to accelerate the convergence of the secant algorithm (Q2260479) (← links)
- Always convergent iteration methods for nonlinear equations of Lipschitz functions (Q2351494) (← links)
- A family of modified Ostrowski methods with accelerated sixth order convergence (Q2383737) (← links)
- Superlinear bracketing method for solving nonlinear equations (Q2451324) (← links)
- Polynomial approximation of \(C^M\) functions by means of boundary values and applications: A survey (Q2475359) (← links)
- Improved Muller method and bisection method with global and asymptotic superlinear convergence of both point and interval for solving nonlinear equations (Q2485631) (← links)
- An improvement to Ostrowski root-finding method (Q2489185) (← links)
- An exponential regula falsi method for solving nonlinear equations (Q2498992) (← links)
- Efficient methods for enclosing solutions of systems of nonlinear equations (Q2641080) (← links)
- A parallel root-finding algorithm (Q3465560) (← links)
- On Enclosing Simple Roots of Nonlinear Equations (Q4274393) (← links)
- Algorithm 748: enclosing zeros of continuous functions (Q4371598) (← links)
- New high-order convergence iteration methods without employing derivatives for solving nonlinear equations (Q5948724) (← links)
- A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root (Q6068198) (← links)
