A parallel root-finding algorithm

DOI10.1112/S1461157015000236MaRDI QIDQ3465560zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A parallel algorithm for simple roots of polynomials
• On the parallel arithmetic complexity of the root-finding problem
• A parallel algorithm for finding roots of a complex polynomial
• scientific article; zbMATH DE number 880381
• scientific article; zbMATH DE number 4064369

Cites work

• A family of derivative-free methods with high order of convergence and its application to nonsmooth equations
• A Method for Solving Algebraic Equations Using an Automatic Computer
• A note on the convergence of the secant method for simple and multiple roots
• An algorithm with guaranteed convergence for finding a zero of a function
• Exact order of convergence of the secant method
• scientific article; zbMATH DE number 4044987 (Why is no real title available?)
• Introduction to Interval Analysis
• New progress in real and complex polynomial root-finding
• Numerical recipes. The art of scientific computing.
• On a higher order secant method.
• Optimal iterative processes for root-finding
• Optimal Order and Efficiency for Iterations with Two Evaluations
• Optimal Order of One-Point and Multipoint Iteration
• Optimal sequential and parallel search for finding a root
• Parallel algorithms for solving systems of nonlinear equations
• Some efficient methods for enclosing simple zeros of nonlinear equations

Cited in

(5)

• Two Strategies for Root Finding on Multiprocessor Systems
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• scientific article; zbMATH DE number 2232802 (Why is no real title available?)
• Locating and computing in parallel all the simple roots of special functions using PVM
• A parallel algorithm for simple roots of polynomials

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

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