Pages that link to "Item:Q2365839"
From MaRDI portal
The following pages link to Complexity of Bezout's theorem. III: Condition number and packing (Q2365839):
Displayed 32 items.
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A fast and stable algorithm for splitting polynomials (Q679271) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- On the probability distribution of data at points in real complete intersection varieties (Q945919) (← links)
- A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
- Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric (Q1022430) (← links)
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric (Q1022431) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Distributing many points on a sphere (Q1361150) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Mathematical problems for the next century (Q1582494) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- An open global optimization problem on the unit sphere (Q1804588) (← links)
- Perturbation theory for homogeneous polynomial eigenvalue problems (Q1855432) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- 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 (Q3433761) (← links)
- On the efficiency of algorithms of analysis (Q3721699) (← links)
- Asymptotics for minimal discrete energy on the sphere (Q4382936) (← links)
- On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables (Q4517525) (← links)
- Distributing Points on the Sphere, I (Q4811522) (← links)
- Multihomogeneous Newton methods (Q4955862) (← links)
- Newton's method for overdetermined systems of equations (Q4955863) (← links)
- Finding elliptic Fekete points sets: Two numerical solution approaches (Q5937187) (← links)
- Kronecker's and Newton's approaches to solving: a first comparison (Q5938585) (← links)
- On the geometry of Graeffe iteration (Q5949383) (← links)