Skip to main content
Log in

Tighter bounds of errors of numerical roots

  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

Abstract

LetP(z) be a monic univariate polynomial overC, of degreen and having roots ζ1,..., ζ n . Given approximate rootsz 1,...,z n, with ζ i z i (i = 1,...,n), we derive a very tight upper bound of ¦ζ i z i¦, by assuming that ζ i has no close root. The bound formula has a similarity with Smale’s and Smith’s formulas. We also derive a lower bound of ¦ζ i z i¦ and a lower bound of min{ζ j z i¦ ¦ji}.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. L. Blum, F. Cucker, M. Shub and S. Smale, Complexity and Real Computation. Springer-Verlag, New York, 1998.

    Google Scholar 

  2. L. Elsner, A remark on simultaneous inclusions of the zeros of a polynomial by Gerschgorin’s theorem. Numer. Math.21 (1973), 425–427.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Inaba and T. Sasaki, Certification of analytic continuation of algebraic function. Proc. CASC 2004 (Computer Algebra in Scientific Computing), V.G. Ganzha, E.W. Mayr and E.V. Vorozhtsov (eds.). Technishe Universität München Press, 2004, 249–260.

  4. L. Kantrovich and G. Akilov, Functional Analysis in Normed Spaces (translated from Russian). MacMillan, 1964.

  5. A.M. Ostrowski, Solution of Equations in Euclidean and Banach Spaces. Academic Press, New York, 1973.

    MATH  Google Scholar 

  6. S. Smale, Newton’s method estimates from data at one point. In R. Ewing, K. Gross, and C. Martin (eds.), The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics. Springer-Verlag, 1986.

  7. B.T. Smith, Error bounds for zeros of a polynomial based on Gerschgorin’s theorems. J. ACM,17 (1970), 661–674.

    Article  MATH  Google Scholar 

  8. T. Sasaki and A. Terui, Computing clustered close-roots of univariate polynomial. Preprint of Univ. Tsukuba (2007).

  9. X.H. Wang and D.F. Han, On dominating sequence method in the point estimate and Smale theorem. Sci. China (Series A),33 (1990), 135–144.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tateaki Sasaki.

Additional information

Work supported in part by Japanese Ministry of Education, Science and Culture under Grants 15300002.

About this article

Cite this article

Sasaki, T. Tighter bounds of errors of numerical roots. Japan J. Indust. Appl. Math. 24, 219–226 (2007). https://doi.org/10.1007/BF03167534

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation