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

@article{TonelliCueto2020ConditionNF,
  title={Condition numbers for the cube. I: Univariate polynomials and hypersurfaces},
  author={Josu{\'e} Tonelli-Cueto and Elias P. Tsigaridas},
  journal={Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation},
  year={2020}
}
  • Josué Tonelli-Cueto, E. Tsigaridas
  • Published 8 June 2020
  • Computer Science, Mathematics
  • Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
The condition-based complexity analysis framework is one of the gems of modern numerical algebraic geometry and theoretical computer science. One of the challenges that it poses is to expand the currently limited range of random polynomials that we can handle. Despite important recent progress, the available tools cannot handle random sparse polynomials and Gaussian polynomials, that is polynomials whose coefficients are i.i.d. Gaussian random variables. We initiate a condition-based complexity… 
7 Citations

Functional norms, condition numbers and numerical algorithms in algebraic geometry

TLDR
Three algorithms are exhibited where the usage of L p -norms substantially reduce computational complexity: a subdivision-based algorithms 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 p-adic Descartes solver: the Strassman solver

TLDR
This paper shows how the p-adic analog of Descartes’ rule of signs, Strassman’s theorem, leads to an algorithm to isolate the roots of a square-freep-adic polynomial.

On the sampling error for parametric curves

TLDR
This paper addresses the question of how to sample a point x ∈ im(γ) in such a way that it is distributed uniformly with respect to the arc-length from the point of view of complexity theory, providing bounds in terms of the size of the desired error.

On the Error of Random Sampling: Uniformly Distributed Random Points on Parametric Curves

TLDR
This paper addresses the question of how to sample a random point x ∈ im(γ) in such a way that it is distributed uniformly with respect to the arc-length from the point of view of complexity theory, providing bounds in terms of the size of the desired error.

A Near-Optimal Expected Boolean Complexity Bound for Descartes Solver

TLDR
A smoothed analysis framework on polynomials with integer coefficients to bridge the gap between the complexity estimates and the practical performance and it is shown that the Descartes solver has near-optimal expected Boolean complexity.

Beyond Worst-Case Analysis for Root Isolation Algorithms

TLDR
A smoothed analysis framework for polynomials with integer coefficients is developed to bridge the gap between the complexity estimates and the practical performance of root-finding algorithms.

References

SHOWING 1-10 OF 55 REFERENCES

Complexity of Sparse Polynomial Solving 2: Renormalization

TLDR
The theory developed in this paper leads to a continuation algorithm tracking all the solutions between two arbitrary systems of the same structure, which is randomized, in the sense that it follows a random path between the two systems.

Functional norms, condition numbers and numerical algorithms in algebraic geometry

TLDR
Three algorithms are exhibited where the usage of L p -norms substantially reduce computational complexity: a subdivision-based algorithms 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.

High probability analysis of the condition number of sparse polynomial systems

Condition and homology in semialgebraic geometry

TLDR
This PhD thesis shows how to obtain a numerical algorithm running in single exponential time with very high probability, which improves the state-of-the-art.

Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique

TLDR
This paper introduces a form of continuous amortization for adaptive complexity in subdivision algorithms based on purely numerical primitives such as function evaluation and provides an adaptive upper bound on the complexity of EVAL using an integral, analogous to integral bounds provided by Ruppert in a different context.

Efficiently Computing Real Roots of Sparse Polynomials

We propose an efficient algorithm to compute the real roots of a sparse polynomial f∈R[x] having k non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the

A Numerical Algorithm for Zero Counting. I: Complexity and Accuracy

The Complexity of an Adaptive Subdivision Method for Approximating Real Curves

TLDR
The first complexity analysis of the algorithm by Plantinga and Vegter for approximating real implicit curves and surfaces is presented, providing a priori worst-case bounds on the complexity of this algorithm both in terms of the number of subregions constructed and the bit complexity for the construction.

On the Complexity of the Plantinga-Vegter Algorithm

TLDR
A general toolbox for precision control and complexity analysis of subdivision based algorithms in computational geometry is introduced, and polynomial time complexity estimates are proved for both interval arithmetic and finite precision versions of the Plantinga-Vegter algorithm.

OUP accepted manuscript

  • Ima Journal Of Numerical Analysis
  • 2021
...