Log in

A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis

  • Published:
Journal of Fixed Point Theory and Applications Aims and scope Submit manuscript

Abstract.

We show a Condition Number Theorem for the condition number of zero counting for real polynomial systems. That is, we show that this condition number equals the inverse of the normalized distance to the set of ill-posed systems (i.e., those having multiple real zeros). As a consequence, a smoothed analysis of this condition number follows.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Felipe Cucker.

Additional information

To Steve, on his 80th birthday, with admiration and esteem

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cucker, F., Krick, T., Malajovich, G. et al. A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis. J. Fixed Point Theory Appl. 6, 285–294 (2009). https://doi.org/10.1007/s11784-009-0127-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11784-009-0127-4

Mathematics Subject Classification (2000).

Keywords.

Navigation