Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
From MaRDI portal
Publication:4076676
DOI10.1145/355656.355659zbMath0315.65031OpenAlexW2021419267WikidataQ113767606 ScholiaQ113767606MaRDI QIDQ4076676
Publication date: 1975
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/12627
Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)
Related Items (21)
On dependence of MR- and MM-algorithms upon the value of switching control variable CTR ⋮ Markov chain models of a telephone call center with call blending ⋮ A novel method for robust minimisation of univariate functions with quadratic convergence ⋮ On a class of omnibus algorithms for zero-finding ⋮ A Divide and Conquer method for the symmetric tridiagonal eigenproblem ⋮ A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root ⋮ Root refinement for real polynomials using quadratic interval refinement ⋮ Several new methods for solving equations ⋮ Improving the efficiency index in enclosing a root of an equation ⋮ Improved bracketing parabolic method for numerical solution of nonlinear equations ⋮ A short note on convergence near a high order zero ⋮ Monotonic multigamma coupling for perfect sampling ⋮ Root isolation methods based upon lagrangian interpolation ⋮ Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices ⋮ On the structure of zero finders ⋮ Average-Case Optimality of a Hybrid Secant-Bisection Method ⋮ Bifurcations of nonlinear reaction-diffusion systems in prolate spheroids ⋮ 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 ⋮ Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization ⋮ Always convergent iteration methods for nonlinear equations of Lipschitz functions
Uses Software
This page was built for publication: Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
