A Family of Parallel and Interval Iterations for Finding All Roots of a Polynomial Simultaneously with Rapid Convergence

A Family of Parallel and Interval Iterations for Finding All Roots of a Polynomial Simultaneously with Rapid Convergence

Year:    1984

Journal of Computational Mathematics, Vol. 2 (1984), Iss. 1 : pp. 70–76

Abstract

This paper suggests a family of parallel iterations with parameter p for finding all roots of a polynomial simultaneously. The convergence of the methods is of order p+2. The methods may also be applied to interval iterations.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/1984-JCM-9641

Journal of Computational Mathematics, Vol. 2 (1984), Iss. 1 : pp. 70–76

Published online:    1984-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    7

Keywords: