Condition numbers for the cube. I: Univariate polynomials and hypersurfaces

Tonelli-Cueto, Josué; Tsigaridas, Elias

doi:10.1016/j.jsc.2022.08.013

Cited by 1 publication

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is a rewriting of [51, Theorem 1.1] using [44] to get explicit constants. This rewriting was first given in [56,Proposition 2.5]. We provide the argument for the sake of completeness.…”

Section: Proposition 426 (Anti-concentration Bound)mentioning

confidence: 99%

Functional norms, condition numbers and numerical algorithms in algebraic geometry

Cucker

Ergür

Tonelli-Cueto

2022

Forum of Mathematics, Sigma

View full text Add to dashboard Cite

In numerical linear algebra, a well-established practice is to choose a norm that exploits the structure of the problem at hand to optimise accuracy or computational complexity. In numerical polynomial algebra, a single norm (attributed to Weyl) dominates the literature. This article initiates the use of $L_p$ norms for numerical algebraic geometry, with an emphasis on $L_{\infty }$ . This classical idea yields strong improvements in the analysis of the number of steps performed by numerous iterative algorithms. In particular, we exhibit three algorithms where, despite the complexity of computing $L_{\infty }$ -norm, the use of $L_p$ -norms substantially reduces computational complexity: a subdivision-based algorithm in real algebraic geometry for computing the homology of semialgebraic sets, a well-known meshing algorithm in computational geometry and the computation of zeros of systems of complex quadratic polynomials (a particular case of Smale’s 17th problem).

show abstract

Section: Proposition 426 (Anti-concentration Bound)mentioning

confidence: 99%