A unified rounding error bound for polynomial evaluation (Q1397303)

The author presents a rounding error bound with the same general form for the evaluation of a polynomial written in any polynomial base when the evaluation algorithm can be expressed as a linear recurrence or a first-order linear matrix recurrence relation. In these bounds the condition number of the polynomials appears in a natural way. In the cases with rounding error bounds in the literature the new bounds generate the same or similar bounds. Examples are Horner's algorithm in the evaluation of power series and Clenshaw's and Forsythe's algorithm in the evaluation of orthogonal polynomial series [cf. \textit{C. W. Clenshaw}, Math. Tables Aids Comput. 9, 118--120 (1955; Zbl 0065.05403); \textit{G. E. Forsythe}, J. Soc. Ind. Appl. Math. 5, 74--88 (1957; Zbl 0083.35503)]. Among the `new' cases the author mentions the polynomial bases for the Szegő polynomials and the modified Reinsch algorithms for the evaluation of orthogonal polynomials near some specific (problematic) points [cf. \textit{P. Levrie} and \textit{R. Piessens}, A note on the evaluation of orthogonal polynomials using recurrence relations, Department of Computer Science, K. U. Leuven, Internal Report TW74 (1985)].