scientific article; zbMATH DE number 3976212
From MaRDI portal
Publication:3740920
Recommendations
- The fast and parallel Halley algorithm for finding all zeros of a polynomial
- A general method to generate parallel iterations for finding all zeros of polynomial simultaneously
- scientific article; zbMATH DE number 4048919
- scientific article; zbMATH DE number 1839518
- Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial
- scientific article; zbMATH DE number 1112821
- On the convergence of Halley's method for simultaneous computation of polynomial zeros
- scientific article; zbMATH DE number 6454113
- The fast Halley algorithm for finding all zeros of a polynomial
- A globally convergent parallel algorithm for zeros of polynomial systems
Cited in
(10)- A new higher-order family of inclusion zero-finding methods
- scientific article; zbMATH DE number 3890621 (Why is no real title available?)
- On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial. II
- On the convergent condition of Newton-like method in parallel circular iteration for simultaneously finding all multiple zeros of a polynomial
- The fast Halley algorithm for finding all zeros of a polynomial
- The fast and parallel Halley algorithm for finding all zeros of a polynomial
- Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial
- scientific article; zbMATH DE number 3860295 (Why is no real title available?)
- scientific article; zbMATH DE number 2143834 (Why is no real title available?)
- Some modifications of the parallel Halley iteration method and their convergence
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 Q3740920)
