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

DOI10.1016/j.jsc.2022.08.013zbMath1505.65208OpenAlexW4287760333MaRDI QIDQ2674002

Josué Tonelli-Cueto, Elias P. Tsigaridas

Publication date: 22 September 2022

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2022.08.013

zbMATH Keywords

condition numbersubdivision algorithmrandom polynomialunivariate solver

Mathematics Subject Classification ID

Numerical algebraic geometry (65H14)

Uses Software

• ISOLATE
• CHomP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Continuous amortization and extensions: with applications to bisection-based root isolation
• Computing real roots of real polynomials
• On sharp bounds for marginal densities of product measures
• High probability analysis of the condition number of sparse polynomial systems
• A deterministic algorithm for isolating real roots of a real polynomial
• On a problem posed by Steve Smale
• Computing the homology of real projective sets
• Fixed points, zeros and Newton's method
• On Smale's 17th problem: a probabilistic positive solution
• A numerical algorithm for zero counting. I: Complexity and accuracy
• On condition numbers and the distance to the nearest ill-posed problem
• Estimations for the separation number of a polynomial system
• Efficient isolation of polynomial's real roots.
• A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
• Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
• Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
• On solving univariate sparse polynomials in logarithmic time
• Towards soft exact computation (invited talk)
• The real polynomial eigenvalue problem is well conditioned on the average
• Condition
• The Polynomial Eigenvalue Problem is Well Conditioned for Random Inputs
• Small Ball Probabilities for Linear Images of High-Dimensional Distributions
• The Probability That a Numerical Analysis Problem is Difficult
• High-Dimensional Probability
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• The Complexity of an Adaptive Subdivision Method for Approximating Real Curves
• Efficiently Computing Real Roots of Sparse Polynomials
• Plantinga-Vegter Algorithm takes Average Polynomial Time
• Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
• Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• Numerical inverting of matrices of high order
• ROUNDING-OFF ERRORS IN MATRIX PROCESSES
• Numerical Inverting of Matrices of High Order. II

This page was built for publication: Condition numbers for the cube. I: Univariate polynomials and hypersurfaces