Pages that link to "Item:Q1022430"
From MaRDI portal
The following pages link to Complexity of Bezout's theorem. VI: Geodesics in the condition (number) metric (Q1022430):
Displayed 29 items.
- Self-convexity and curvature (Q290787) (← links)
- On the zeta Mahler measure function of the Jacobian determinant, condition numbers and the height of the generic discriminant (Q315740) (← links)
- Smale's fundamental theorem of algebra reconsidered (Q404254) (← links)
- Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian (Q423886) (← links)
- The unavoidable condition\dots A report on the book. Book review of: P. Bürgisser and F. Cucker, Condition. The geometry of numerical algorithms (Q494615) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← 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)
- The nearest complex polynomial with a zero in a given complex domain (Q650944) (← links)
- A numerical algorithm for zero counting. III: Randomization and condition (Q651058) (← links)
- On a problem posed by Steve Smale (Q661924) (← links)
- Certified predictor-corrector tracking for Newton homotopies (Q898257) (← 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)
- On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
- Robust certified numerical homotopy tracking (Q1955526) (← links)
- A note on the finite variance of the averaging function for polynomial system solving (Q2269908) (← links)
- Computing singular points of projective plane algebraic curves by homotopy continuation methods (Q2320699) (← links)
- A facility location formulation for stable polynomials and elliptic Fekete points (Q2340505) (← links)
- A randomized homotopy for the Hermitian eigenpair problem (Q2340509) (← links)
- A numerical realization of the conditions of Max Nöther's residual intersection theorem (Q2352104) (← links)
- Certified Numerical Homotopy Tracking (Q2883925) (← links)
- Minimizing the discrete logarithmic energy on the sphere: The role of random polynomials (Q3004359) (← links)
- Smale 17th Problem: Advances and Open Directions (Q3380357) (← links)
- Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)