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.
- 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)
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739) (← links)
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric (Q1727976) (← links)
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions (Q1727980) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← 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)
- Exact solutions in log-concave maximum likelihood estimation (Q2104907) (← links)
- Central limit theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems (Q2145085) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- On the geometry of the set of symmetric matrices with repeated eigenvalues (Q2283191) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- The real polynomial eigenvalue problem is well conditioned on the average (Q2309519) (← links)
- Random fields and the enumerative geometry of lines on real and complex hypersurfaces (Q2314808) (← links)
- Adaptive strategies for solving parameterized systems using homotopy continuation (Q2333220) (← links)
- A facility location formulation for stable polynomials and elliptic Fekete points (Q2340505) (← links)
- A randomized homotopy for the Hermitian eigenpair problem (Q2340509) (← links)
- Distributing many points on spheres: minimal energy and designs (Q2347956) (← links)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds (Q2387418) (← links)
- On the condition of the zeros of characteristic polynomials (Q2402421) (← links)
- On the expected number of zeros of nonlinear equations (Q2441420) (← links)
- An arithmetic Poisson formula for the multi-variate resultant (Q2441516) (← links)
- On the probability distribution of singular varieties of given corank (Q2457405) (← links)