论文信息 - Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials - 字舞流文

Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials

Let $P(z)$ be a polynomial of degree N with p distinct zeros. In this paper, two iterative algorithms are given, one for the refinement of $k < p$ zeros located around a point a and the other for t...

Irene Gargantini | I. Gargantini

[1] A. Ostrowski. Solution of equations in Euclidean and Banach spaces , 1973 .

[2] Irene Gargantini. Parallel Square Root Iterations , 1975, Interval Mathematics.

[3] A. A. Grau. The Simultaneous Newton Improvement of a Complete Set of Approximate Factors of a Polynomial , 1971 .

[4] P. Henrici,et al. Circular arithmetic and the determination of polynomial zeros , 1971 .

[5] James Hardy Wilkinson,et al. Rounding errors in algebraic processes , 1964, IFIP Congress.

[6] W. Miranker. Parallel methods for approximating the root of a function , 1969 .

[7] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .

[8] Merrell L. Patrick. A highly parallel algorithm for approximating all zeros of a polynomial with only real zeros , 1972, CACM.