Finding the roots of a polynomial on an MIMD multicomputer

DOI10.1016/0167-8191(90)90032-5zbMath0734.65042OpenAlexW2097461634MaRDI QIDQ811090

Michel Cosnard, Pierre Fraigniaud

Publication date: 1990

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(90)90032-5

zbMATH Keywords

parallel computationdistributed memory multicomputeriterative methodspolynomial rootshypercube topology

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Parallel numerical computation (65Y05)

Related Items (24)

ON HIGHLY EFFICIENT SIMULTANEOUS SCHEMES FOR FINDING ALL POLYNOMIAL ROOTS ⋮ ON INVERSE ITERATION PROCESS FOR FINDING ALL ROOTS OF NONLINEAR EQUATIONS WITH APPLICATIONS ⋮ Family of simultaneous methods of Hansen--Patrick's type ⋮ Methods and problems of communication in usual networks ⋮ A posteriori error bound methods for the inclusion of polynomial zeros ⋮ The Durand-Kerner polynomials roots-finding method in case of multiple roots ⋮ On the convergence of the sequences of Gerschgorin-like disks ⋮ On highly efficient derivative-free family of numerical methods for solving polynomial equation simultaneously ⋮ On iterative techniques for estimating all roots of nonlinear equation and its system with application in differential equation ⋮ Efficient iterative methods for finding simultaneously all the multiple roots of polynomial equation ⋮ Finding roots of a real polynomial simultaneously by means of Bairstow's method ⋮ On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros ⋮ Tchebychef-like method for the simultaneous finding zeros of analytic functions ⋮ On Euler-like methods for the simultaneous approximation of polynomial zeros ⋮ ON EFFICIENT FRACTIONAL CAPUTO-TYPE SIMULTANEOUS SCHEME FOR FINDING ALL ROOTS OF POLYNOMIAL EQUATIONS WITH BIOMEDICAL ENGINEERING APPLICATIONS ⋮ Study of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineering ⋮ Some families of two-step simultaneous methods for determining zeros of nonlinear equations ⋮ Orders of convergence for superlinearly convergent chaotic iterations ⋮ Inverse numerical iterative technique for finding all roots of nonlinear equations with engineering applications ⋮ Börsch-supan-like methods: point estimation and parallel implementation ⋮ A family of root-finding methods with accelerated convergence ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Computational efficiency of some combined methods for polynomial equations ⋮ On dynamics of iterative techniques for nonlinear equation with applications in engineering

This page was built for publication: Finding the roots of a polynomial on an MIMD multicomputer