Pages that link to "Item:Q4728110"

The following pages link to On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials (Q4728110):

Displayed 29 items.

• Smale's fundamental theorem of algebra reconsidered (Q404254) ‎ (← links)
• On the distance to the zero set of a homogeneous polynomial (Q582323) ‎ (← links)
• The steepest descent gravitational method for linear programming (Q583105) ‎ (← links)
• A continuation method to solve polynomial systems and its complexity (Q621308) ‎ (← links)
• On the asymptotic behavior of the projective rescaling algorithm for linear programming (Q750290) ‎ (← links)
• Shifted varieties and discrete neighborhoods around varieties (Q820939) ‎ (← links)
• Smoothed analysis of complex conic condition numbers (Q864180) ‎ (← links)
• Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) ‎ (← links)
• Average case optimality (Q1071513) ‎ (← links)
• On the existence of generally convergent algorithms (Q1077876) ‎ (← links)
• Optimal solution of nonlinear equations (Q1086985) ‎ (← links)
• Computational experience with a dual affine variant of Karmarkar's method for linear programming (Q1092808) ‎ (← links)
• The geometry of ill-conditioning (Q1100848) ‎ (← links)
• A fully polynomial time projective method (Q1104857) ‎ (← links)
• Rudiments of an average case complexity theory for piecewise-linear path following algorithms (Q1111475) ‎ (← links)
• Average errors for zero finding: Lower bounds for smooth or monotone functions (Q1339671) ‎ (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) ‎ (← links)
• Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) ‎ (← links)
• Condition numbers for the cube. I: Univariate polynomials and hypersurfaces (Q2674002) ‎ (← links)
• Fast and efficient linear programming and linear least-squares computations (Q3028716) ‎ (← links)
• Smale’s 17th problem: Average polynomial time to compute affine and projective solutions (Q3079201) ‎ (← links)
• Smooth analysis of the condition number and the least singular value (Q3160742) ‎ (← links)
• The probability that a slightly perturbed numerical analysis problem is difficult (Q3577011) ‎ (← links)
• The Probability That a Numerical Analysis Problem is Difficult (Q3805780) ‎ (← links)
• Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038) ‎ (← links)
• Newton's method for overdetermined systems of equations (Q4955863) ‎ (← links)
• On the volume of tubular neighborhoods of real algebraic varieties (Q5179371) ‎ (← links)
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) ‎ (← links)
• Applications of Algebra for Some Game Theoretic Problems (Q5250276) ‎ (← links)