Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Cited In (22)

Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices
Improved bracketing parabolic method for numerical solution of nonlinear equations
Approximating inverse cumulative distribution functions to produce approximate random variables
On dependence of MR- and MM-algorithms upon the value of switching control variable CTR
On a class of omnibus algorithms for zero-finding
Root isolation methods based upon lagrangian interpolation
A novel method for robust minimisation of univariate functions with quadratic convergence
A Divide and Conquer method for the symmetric tridiagonal eigenproblem
A short note on convergence near a high order zero
Markov chain models of a telephone call center with call blending
On the structure of zero finders
A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root
Matrices with tunable infinity-norm condition number and no need for pivoting in LU factorization
Root refinement for real polynomials using quadratic interval refinement
Bifurcations of nonlinear reaction-diffusion systems in prolate spheroids
Always convergent iteration methods for nonlinear equations of Lipschitz functions
Average-Case Optimality of a Hybrid Secant-Bisection Method
Monotonic multigamma coupling for perfect sampling
Upper and lower bounds for the optimal constant in the extended Sobolev inequality. Derivation and numerical results
Bifurcations of nonlinear reaction-diffusion systems in oblate spheroids
Several new methods for solving equations
Improving the efficiency index in enclosing a root of an equation

Uses Software

zeroin

This page was built for publication: Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076676)