Complexity of Bezout's theorem. III: Condition number and packing
From MaRDI portal
Publication:2365839
DOI10.1006/jcom.1993.1002zbMath0846.65018MaRDI 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
complexity; error analysis; condition number; packing; polynomial; Bezout's theorem; sensitivity of output error relative to input error
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65F35: Numerical computation of matrix norms, conditioning, scaling
65Y20: Complexity and performance of numerical algorithms
65G99: Error analysis and interval analysis
Related Items
Asymptotics for minimal discrete energy on the sphere, On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables, Distributing Points on the Sphere, I, Multihomogeneous Newton methods, Newton's method for overdetermined systems of equations, Finding elliptic Fekete points sets: Two numerical solution approaches, Kronecker's and Newton's approaches to solving: a first comparison, On the geometry of Graeffe iteration, High probability analysis of the condition number of sparse polynomial systems, Deformation techniques to solve generalised Pham systems, A fast and stable algorithm for splitting polynomials, Smoothed analysis of complex conic condition numbers, On the probability distribution of data at points in real complete intersection varieties, A numerical algorithm for zero counting. I: Complexity and accuracy, Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric, Complexity of Bezout's theorem. VII: Distance estimates in the condition metric, Mysteries of mathematics and computation, On generalized Newton algorithms: Quadratic convergence, path-following and error analysis, Complexity of Bezout's theorem. V: Polynomial time, Lower bounds for diophantine approximations, Distributing many points on a sphere, Polar varieties, real equation solving, and data structures: the hypersurface case, Mathematical problems for the next century, Real computations with fake numbers, An open global optimization problem on the unit sphere, Perturbation theory for homogeneous polynomial eigenvalue problems, Optimal and nearly optimal algorithms for approximating polynomial zeros, Linear programming, complexity theory and elementary functional analysis, Deformation techniques for efficient polynomial equation solving., Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration., 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, On the efficiency of algorithms of analysis
