Application of Newton's and Chebyshev's methods to parallel factorization of polynomials

Journal of Computational Mathematics

Volumn 19, Issue 4, 2001, Pages 347-356

  Zheng, S M ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Chebyshev's method; Factorization of polynomial; Newton's method; Parallel iteration

Indexed keywords

CHEBYSHEV APPROXIMATION; ITERATIVE METHODS; NUMERICAL METHODS; QUADRATIC PROGRAMMING;

PARALLEL ITERATIONS;

POLYNOMIAL APPROXIMATION;

EID: 0035391125     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Residuenabschätzung für polynom-nullstellen mittels lagrange-inter-polation
2. Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
3. An iteration formula for the simultaneous determination of the zeros of a polynomial
4. Neuer beweis des satzes, dass jede ganze rationale funktion einer verän-derlichen dargestellt werden als produkt aus linearen derselben veränderlichen
5. Validated computation of polynomial zeros by the Durand-Kerner method
6. The theory of Smale's point estimation and the convergence of Durand-Kerner program
7. A family of parallel and interval iterations for finding all roots of a polynomial simultaneously with rapid convergence
8. On convergence of Durand-Kerner method for finding all roots of a polynomial simultaneously
9. Linear interpolation and parallel iteration for splitting factors of polynomials