On the Evaluation of Polynomial Coefficients

1. G.S. Ammar, D. Calvetti, W.B. Gragg and L. Reichel, Polynomial zerofinders based on Szegő polynomials, J. Comput. Appl. Math. 127 (2001) 1–16.

   Google Scholar 

2. A. Bini and G. Fiorentino, Design, analysis and implementation of a multiprecision polynomial rootfinder, Numer. Algorithms 23 (2000) 127–173.

   Google Scholar 

3. C. Brezinski, Historical perspective on interpolation, approximation and quadrature, in: Handbook of Numerical Analysis, Vol. 3, eds. P.G. Ciarlet and J.L. Lions (North-Holland, Amsterdam, 1994) pp. 3–46.

   Google Scholar 

4. D. Calvetti, L. Reichel and F. Sgallari, A modified companion matrix method based on Newton polynomials, in: Fast Algorithms, ed. V. Olshevsky, Contemporary Mathematics (Amer. Math. Soc., Providence, RI) to appear.

5. B. Fischer and L. Reichel, A stable Richardson iteration method for complex linear systems, Numer. Math. 54 (1988) 225–242.

   Google Scholar 

6. F. Leja, Sur certaines suits liées aux ensemble plan et leur application à la representation conforme, Ann. Polon. Math. 4 (1957) 8–13.

   Google Scholar 

7. J.M. McNamee, An updated supplementary bibliography on roots of polynomials, J. Comput. Appl. Math. 110 (1999) 305–306. The actual bibliography is available at the Web site http://www. elsevier.nl/locate/cam.

   Google Scholar 

8. T.J. Rivlin, Chebyshev Polynomials, 2nd ed. (Wiley, New York, 1990).

   Google Scholar 

Download references