scientific article; zbMATH DE number 4064369
From MaRDI portal
Publication:3798149
Recommendations
- Some parallel methods for polynomial root-finding
- A parallel algorithm for finding roots of a complex polynomial
- A parallel algorithm for simple roots of polynomials
- scientific article; zbMATH DE number 880381
- On a family of parallel root-finding methods for generalized polynomials
- On the parallel arithmetic complexity of the root-finding problem
- A globally convergent parallel algorithm for zeros of polynomial systems
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- A parallel root-finding algorithm
- scientific article; zbMATH DE number 3860295
Cited in
(9)- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- scientific article; zbMATH DE number 4176359 (Why is no real title available?)
- scientific article; zbMATH DE number 4209463 (Why is no real title available?)
- A parallel root-finding algorithm
- Efficient parallel rooting of complex polynomials on the unit circle
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- A parallel algorithm for simple roots of polynomials
- An existence and nonexistence theorem for solutions of nonlinear systems and its application to algebraic equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798149)