A Numerical Algorithm for Zero Counting. II: Distance to Ill-posedness and Smoothed Analysis
classification
💻 cs.NA
keywords
conditionnumberanalysiscountingdistancerealsmoothedsystems
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.