A parallel root-finding algorithm

DOI10.1112/S1461157015000236zbMath1398.65100OpenAlexW2504895124MaRDI QIDQ3465560

M. J. P. Nijmeijer

Publication date: 22 January 2016

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s1461157015000236

Mathematics Subject Classification ID

Functional equations for real functions (39B22) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05) One-variable calculus (26A06)

Cites Work

• Unnamed Item
• Unnamed Item
• A family of derivative-free methods with high order of convergence and its application to nonsmooth equations
• New progress in real and complex polynomial root-finding
• Parallel algorithms for solving systems of nonlinear equations
• Some efficient methods for enclosing simple zeros of nonlinear equations
• Optimal sequential and parallel search for finding a root
• Exact order of convergence of the secant method
• On a higher order secant method.
• A note on the convergence of the secant method for simple and multiple roots
• Optimal iterative processes for root-finding
• A Method for Solving Algebraic Equations Using an Automatic Computer
• Introduction to Interval Analysis
• Optimal Order and Efficiency for Iterations with Two Evaluations
• Optimal Order of One-Point and Multipoint Iteration
• An algorithm with guaranteed convergence for finding a zero of a function

This page was built for publication: A parallel root-finding algorithm