Complexity of Bezout's theorem. III: Condition number and packing
From MaRDI portal
Publication:2365839
DOI10.1006/JCOM.1993.1002zbMath0846.65018OpenAlexW2592503220MaRDI QIDQ2365839
Publication date: 29 June 1993
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1993.1002
complexityerror analysiscondition numberpackingpolynomialBezout's theoremsensitivity of output error relative to input error
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Error analysis and interval analysis (65G99)
Related Items (79)
On generalized Newton algorithms: Quadratic convergence, path-following and error analysis ⋮ Complexity of Bezout's theorem. V: Polynomial time ⋮ A reverse Thomson problem on the unit circle ⋮ On the efficiency of algorithms of analysis ⋮ On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant ⋮ Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems ⋮ Distributing Points on the Sphere, I ⋮ Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres ⋮ Lower bounds for diophantine approximations ⋮ Distributing many points on a sphere ⋮ Polar varieties, real equation solving, and data structures: the hypersurface case ⋮ Smoothed analysis of complex conic condition numbers ⋮ On the condition of the zeros of characteristic polynomials ⋮ High probability analysis of the condition number of sparse polynomial systems ⋮ Deformation techniques to solve generalised Pham systems ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ Linear programming, complexity theory and elementary functional analysis ⋮ Smale's fundamental theorem of algebra reconsidered ⋮ The Diamond ensemble: a constructive set of spherical points with small logarithmic energy ⋮ A continuation method to solve polynomial systems and its complexity ⋮ Probabilistic enumerative geometry over \(p\)-adic numbers: linear spaces on complete intersections ⋮ Rigid continuation paths II. structured polynomial systems ⋮ Harmonic properties of the logarithmic potential and the computability of elliptic Fekete points ⋮ A lower bound for the logarithmic energy on \(\mathbb{S}^2\) and for the Green energy on \(\mathbb{S}^n\) ⋮ Equilibrium charge distribution on a finite straight one-dimensional wire ⋮ On Gegenbauer point processes on the unit interval ⋮ Equidistribution of jellium energy for Coulomb and Riesz interactions ⋮ Low-energy points on the sphere and the real projective plane ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ Low-degree approximation of random polynomials ⋮ On the expected number of zeros of nonlinear equations ⋮ A numerical algorithm for zero counting. III: Randomization and condition ⋮ Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric ⋮ On a problem posed by Steve Smale ⋮ Deformation techniques for efficient polynomial equation solving. ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ A sequence of polynomials with optimal condition number ⋮ Computing the homology of real projective sets ⋮ Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials ⋮ The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms ⋮ Fast computation of zeros of polynomial systems with bounded degree under finite-precision ⋮ On the probability distribution of data at points in real complete intersection varieties ⋮ Foreword. What is numerical algebraic geometry? ⋮ A fast and stable algorithm for splitting polynomials ⋮ Asymptotics for minimal discrete energy on the sphere ⋮ A numerical algorithm for zero counting. I: Complexity and accuracy ⋮ Grid methods in computational real algebraic (and semialgebraic) geometry ⋮ The probability that a slightly perturbed numerical analysis problem is difficult ⋮ Optimal \(N\)-point configurations on the sphere: ``magic numbers and Smale's 7th problem ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Finding elliptic Fekete points sets: Two numerical solution approaches ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ On the geometry of Graeffe iteration ⋮ On a condition number of general random polynomial systems ⋮ On the geometry of the set of symmetric matrices with repeated eigenvalues ⋮ Multihomogeneous Newton methods ⋮ Newton's method for overdetermined systems of equations ⋮ Unnamed Item ⋮ Statistical mechanics of interpolation nodes, pluripotential theory and complex geometry ⋮ Computing the homology of semialgebraic sets. I: Lax formulas ⋮ Discrete and continuous Green energy on compact manifolds ⋮ An open global optimization problem on the unit sphere ⋮ Smale’s 17th problem: Average polynomial time to compute affine and projective solutions ⋮ Smale 17th Problem: Advances and Open Directions ⋮ Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems ⋮ Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric ⋮ Complexity of Bezout's theorem. VII: Distance estimates in the condition metric ⋮ A Wasserstein inequality and minimal Green energy on compact manifolds ⋮ Random fields and the enumerative geometry of lines on real and complex hypersurfaces ⋮ Sensitivity Analysis of Nonlinear Eigenproblems ⋮ A sharp Bombieri inequality, logarithmic energy and well conditioned polynomials ⋮ Mathematical problems for the next century ⋮ On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case ⋮ Perturbation theory for homogeneous polynomial eigenvalue problems ⋮ Real computations with fake numbers ⋮ Distributing many points on spheres: minimal energy and designs ⋮ Mysteries of mathematics and computation ⋮ On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
This page was built for publication: Complexity of Bezout's theorem. III: Condition number and packing
