Corpus ID: 52188085

Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis

@article{Ergr2018ProbabilisticCN,
  title={Probabilistic Condition Number Estimates for Real Polynomial Systems II: Structure and Smoothed Analysis},
  author={A. A. Erg{\"u}r and G. Paouris and J. M. Rojas},
  journal={ArXiv},
  year={2018},
  volume={abs/1809.03626}
}
  • A. A. Ergür, G. Paouris, J. M. Rojas
  • Published 2018
  • Mathematics, Computer Science
  • ArXiv
  • We consider the sensitivity of real zeros of polynomial systems with respect to perturbation of the coefficients, and extend our earlier probabilistic estimates for the condition number in two directions: (1) We give refined bounds for the condition number of random structured polynomial systems, depending on a variant of sparsity and an intrinsic geometric quantity called dispersion. (2) Given any structured polynomial system $P$, we prove the existence of a nearby well-conditioned structured… CONTINUE READING
    7 Citations
    Condition numbers for the cube: i: Univariate polynomials and hypersurfaces
    Condition Numbers for the Cube. I: Univariate Polynomials and Hypersurfaces
    Complexity of Sparse Polynomial Solving 2: Renormalization
    • 2
    • PDF
    Condition and homology in semialgebraic geometry
    • 4
    • Highly Influenced
    • PDF
    A Polyhedral Homotopy Algorithm For Real Zeros
    Plantinga-Vegter Algorithm takes Average Polynomial Time
    • 7
    • PDF
    On the Complexity of the Plantinga-Vegter Algorithm
    • 2
    • PDF

    References

    SHOWING 1-10 OF 60 REFERENCES
    Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
    • 5
    • PDF
    A simple tool for bounding the deviation of random matrices on geometric sets
    • 45
    • PDF
    Small Ball Probabilities for Linear Images of High-Dimensional Distributions
    • 61
    • PDF
    On the Complexity of Computing Error Bounds
    • 21
    • PDF
    Complexity of Sparse Polynomial Solving: Homotopy on Toric Varieties and the Condition Metric
    • G. Malajovich
    • Computer Science, Mathematics
    • Found. Comput. Math.
    • 2019
    • 9
    • PDF
    The Littlewood-Offord problem and invertibility of random matrices
    • 308
    • PDF
    A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy
    • 34
    • PDF
    A Numerical Algorithm for Zero Counting. III: Randomization and Condition
    • 17
    • PDF