Skip to main content

Circular arithmetic and the determination of polynomial zeros

Invited Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 228)

Keywords

  • Circular Region
  • Interval Arithmetic
  • Latin Letter
  • Convergent Algorithm
  • Polynomial Zero

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Gargantini and P. Henrici: Circular arithmetic and the determination of polynomial zeros. Submitted for publication.

    Google Scholar 

  2. P. Henrici: Uniformly convergent algorithms for the simultaneous determination of all zeros of a polynomial. Studies in Numerical Analysis 2, 1–8 (1968).

    MathSciNet  Google Scholar 

  3. P. Henrici and I. Gargantini: Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial. Proc. Symp. on Constructive Aspects of the Fundamental Theorem of Algebra (B. Dejon and P. Henrici, eds.), Wiley-Interscience, London 1969, pp. 77–114.

    Google Scholar 

  4. E. Laguerre: Sur la résolution des équations numériques. Nouvelles Annales des Mathématiques, sér. 2, 17 (1878).

    Google Scholar 

  5. R. E. Moore: Interval Analysis. Prentice Hall, Englewood Cliffs 1966.

    Google Scholar 

  6. K. Nickel: Ueber die Notwendigkeit einer Fehlerschrankenarithmetik bei Rechenautomaten. Numer. Math. 9, 69–79 (1966).

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. J. Rokne and P. Lancaster: Complex Interval Arithmetic. Comm. Assoc. Comp. Mach. 14, 111–112 (1971).

    MATH  Google Scholar 

  8. A. M. Ostrowski: Solution of Equations and Systems of Equations, 2nd ed. Academic Press, New York 1966.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1971 Springer-Verlag

About this paper

Cite this paper

Henrici, P. (1971). Circular arithmetic and the determination of polynomial zeros. In: Morris, J.L. (eds) Conference on Applications of Numerical Analysis. Lecture Notes in Mathematics, vol 228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0069450

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05656-0

  • Online ISBN: 978-3-540-36976-9

  • eBook Packages: Springer Book Archive