scientific article; zbMATH DE number 3909639
From MaRDI portal
Publication:3685945
Recommendations
Cited in
(11)- Probabilistic algorithm for finding roots of linearized polynomials
- On applications of iteration algorithms and Skorobagatko's branching fractions to approximation of roots of polynomials in Banach algebras
- scientific article; zbMATH DE number 3923973 (Why is no real title available?)
- Finding polynomial roots: A fast algorithm convergent on the complex plane
- Algorithms for \(n\)-th root approximation.
- Approximating roots by quadratic iteration
- scientific article; zbMATH DE number 2219554 (Why is no real title available?)
- An algorithm for computing the roots of a complex polynomial
- scientific article; zbMATH DE number 4039137 (Why is no real title available?)
- scientific article; zbMATH DE number 4007587 (Why is no real title available?)
- An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli
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 Q3685945)