Pages that link to "Item:Q4039362"
From MaRDI portal
The following pages link to Complexity of Bezout's Theorem I: Geometric Aspects (Q4039362):
Displayed 50 items.
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- A universality property of Gaussian analytic functions (Q430986) (← links)
- A complex analogue of Toda's theorem (Q454132) (← links)
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers (Q533873) (← links)
- Numerical computation of the genus of an irreducible curve within an algebraic set (Q534004) (← links)
- A property of the nearly optimal root-bound (Q596173) (← links)
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- A continuation method to solve polynomial systems and its complexity (Q621308) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- Globally convergent, iterative path-following for algebraic equations (Q655158) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Smoothed analysis of complex conic condition numbers (Q864180) (← links)
- Convergence criterion of Newton's method for singular systems with constant rank derivatives (Q932336) (← links)
- High order iterative schemes for quadratic equations (Q937190) (← 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)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Some lower bounds for the complexity of continuation methods (Q1279910) (← links)
- Mysteries of mathematics and computation (Q1323030) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
- Polynomial root finding by means of continuation (Q1377268) (← links)
- A fast Chebyshev's method for quadratic equations. (Q1417017) (← links)
- Local convergence of some iterative methods for generalized equations. (Q1428240) (← links)
- Counting problems over the reals (Q1575534) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Newton's method for analytic systems of equations with constant rank derivatives (Q1599200) (← links)
- Kantorovich's theorem on Newton's method in Riemannian manifolds (Q1599205) (← links)
- Perturbation theory for homogeneous polynomial eigenvalue problems (Q1855432) (← links)
- Systems of rational polynomial equations have polynomial size approximate zeros on the average (Q1869964) (← links)
- A universal constant for the convergence of Newton's method and an application to the classical homotopy method (Q1895870) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- General equilibrium models and homotopy methods (Q1960548) (← links)
- Finding zeros of analytic functions: \(\alpha\)-theory for secant type methods (Q1974566) (← links)
- Complexity analysis for certain convex programming problems (Q1974569) (← 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)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds (Q2387418) (← links)
- On the probability distribution of singular varieties of given corank (Q2457405) (← links)