Two Strategies for Root Finding on Multiprocessor Systems

DOI10.1137/0906023zbMATH Open0569.65037OpenAlexW2080254781MaRDI QIDQ3685947FDOQ3685947

Authors: Mark A. Franklin, I. N. Katz 

Publication date: 1985

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0906023

Recommendations

• Finding the roots of a polynomial on an MIMD multicomputer
• A parallel root-finding algorithm
• A parallel algorithm for simple roots of polynomials
• scientific article; zbMATH DE number 880381
• Solving Systems of Nonlinear Equations on a Message-Passing Multiprocessor

zbMATH Keywords

convergenceparallel processingroot findingHalley's methodmultiprocessor systemsparallel numerical methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to single equations (65H05)

This page was built for publication: Two Strategies for Root Finding on Multiprocessor Systems

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