On some iterative algorithms for polynomial factorization
zbMATH Open1265.65091MaRDI QIDQ4647749FDOQ4647749
Authors: Dilyana Toceva, Nikolay Kyurkchiev, Anton Iliev 
Publication date: 7 November 2012
Recommendations
numerical examplesorder of convergenceefficiency indexpolynomial factorizationparallel iterationquadratic factorsDvorchuk methodKyurkchiev-Zheng-Marinov methodTanabe method
Parallel numerical computation (65Y05) Polynomials in real and complex fields: factorization (12D05) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)
Cited In (14)
- Numerical factorization of a polynomial by rational Hermite interpolation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On applications of iteration algorithms and Skorobagatko's branching fractions to approximation of roots of polynomials in Banach algebras
- On the choice of iteration parameters in the Stone incomplete factorization
- Iterative algorithms and branching fractions for factoring polynomials in numerical fields and Banach algebras
- Application of Newton's and Chebyshev's methods to parallel factorization of polynomials
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- Algorithms for adaptive factorization of polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On some iterative algorithms for polynomial factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647749)
