Skip to main content
Log in

Rounding error analysis of Horner's scheme

Rundungsfehleranalyse des Hornerschemas

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper we establish a forward error analysis of the generalized complete Horner scheme for a polynomial\(p = \sum {a_j X^{n - j} } \) with pivotal pointsz 1, ...,z n . The error analysis is based on the linearization method whose fundamental tools are systems of linear error equations and associated condition numbers which yield optimal bounds of the possible errors under data perturbations and rounding errors in floating point arithmetic. For Horner's scheme the bounds may be calculated by simple recurrences. The ordinary complete Horner scheme is characterized byz=z 1=...=z n . In contrast to the hitherto known error estimates for this special case our new optimal bounds for the polynomialp atz differ from those for the polynomial\(p_a = \sum {\left| {a_j } \right|X^{n - j} } \) at |z| and thus take into account the possible partial cancellation of terms. The error estimates are illustrated by a series of numerical examples.

Zusammenfassung

In dieser Arbeit entwickeln wir eine Vorwärts-Fehleranalyse für das vollständige verallgemeinerte Hornerschema eines Polynoms\(p = \sum {a_j X^{n - j} } \) an den Stellenz 1, ...,z n . Dieser Fehleranalyse liegt die Linearisierungsmethode zugrunde, deren wesentliche Hilfsmittel Systeme linearer Fehlergleichungen und zugehöriger Konditionszahlen sind, welche optimale Schranken für die Fehler liefern, die bei Datenstörungen und dem Rechnen in Gleitkommaarithmetik entstehen können. Für das Hornerschema lassen sich diese Konditionszahlen auf einfache Weise rekursiv berechnen. Das gewöhnliche vollständige Hornerschema ist gekennzeichnet durchz=z 1=...=z n . Im Gegensatz zu den für diesen Fall bisher bekannten Fehlerabschätzungen für das Polynomp and der Stellez unterscheiden sich unsere optimalen Schranken von denen für das Polynom\(p_a = \sum {\left| {a_j } \right|X^{n - j} } \) an der Stelle |z| und berücksichtigen so das sich teilweise Aufheben von Termen. Eine Reihe von numerischen Beispielen veranschaulicht die erhaltenen Fehlerschranken.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adams, D. A.: A stopping criterion for polynomial root finding. Comm. ACM10, 655–658 (1967).

    Google Scholar 

  2. Bauer, F. L.: Computational graphs and rounding error. SIAM J. Numer. Anal.11, 87–96 (1974).

    Google Scholar 

  3. Kuck, D. J., Parker, D. S., Sameh, A. S.: Analysis of rounding methods in floating-point arithmetic. IEEE Trans. Comput.C-26, 643–650 (1977).

    Google Scholar 

  4. Linnainmaa, S.: Taylor expansion of the accumulated rounding error. BIT16, 146–160 (1976).

    Google Scholar 

  5. Müller, K. H.: Rounding error analysis of the Shaw-Traub algorithm. (In preparation.)

  6. Newbery, A. C. R.: Error analysis for polynomial evaluation. Math. Comp.28, 789–793 (1974).

    Google Scholar 

  7. O'Neill, C. J., Downs, T.: A numerical accuracy consideration in polynomial deflation. Math. Comp.32, 1144–1146 (1978).

    Google Scholar 

  8. Peters, G., Wilkinson, J. H.: Practical problems arising in the solution of polynomial equations. J. Inst. Math. Applic.8, 16–35 (1971).

    Google Scholar 

  9. Shaw, M., Traub, J. F.: On the number of multiplications for the evaluation of a polynomial and some of its derivatives. J. Assoc. Comp. Mach.21, 161–167 (1974).

    Google Scholar 

  10. Stewart, G. W.: Error analysis of the algorithm for shifting the zeros of a polynomial by synthetic division. Math. Comp.25, 135–139 (1971).

    Google Scholar 

  11. Stummel, F.: Fehleranalyse numerischer Algorithmen. (Lecture Notes.) University of Frankfurt, 1978.

  12. Stummel, F.: Rounding error analysis of elementary numerical algorithms. Computing Suppl. 2, pp. 169–195. Wien-New York: Springer 1980.

    Google Scholar 

  13. Stummel, F.: Perturbation theory for evaluation algorithms of arithmetic expressions. Math. Comp.37, 435–473 (1981).

    Google Scholar 

  14. Stummel, F., Hainer, K.: Praktische Mathematik, 2nd ed., Stuttgart: B. G. Teubner 1982.

    Google Scholar 

  15. Tsao, N.-K.: Some a posteriori error bounds in floating-point computations. J. Assoc. Comp. Mach.21, 6–17 (1974).

    Google Scholar 

  16. Tsao, N.-K.: Error analysis of splitting algorithms for polynomials. Numer. Math.32, 409–421 (1979).

    Google Scholar 

  17. Wilkinson, J. H.: Rounding errors in algebraic processes. Englewood Cliffs, N. J.: Prentice-Hall 1963.

    Google Scholar 

  18. Woźniakowski, H.: Rounding error analysis for the evaluation of a polynomial and some of its derivatives. SIAM J. Numer. Anal.11, 780–787 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Müller, K.H. Rounding error analysis of Horner's scheme. Computing 30, 285–303 (1983). https://doi.org/10.1007/BF02242136

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242136

AMS (MOS)-Subject Classifications

Key words and phrases

Navigation