Pages that link to "Item:Q621308"
From MaRDI portal
The following pages link to A continuation method to solve polynomial systems and its complexity (Q621308):
Displaying 19 items.
- 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)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- Solving polynomial systems with noise over \(\mathbb{F}_2\): revisited (Q527403) (← links)
- Fast linear homotopy to find approximate zeros of polynomial systems (Q626447) (← 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)
- An elimination method for polynomial systems (Q1332646) (← links)
- Continuity properties for flat families of polynomials. I: Continuous parametrizations (Q1408354) (← 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)
- Certified Numerical Homotopy Tracking (Q2883925) (← links)
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems (Q3634901) (← links)
- (Q4489762) (← links)
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems (Q5220197) (← links)
- Rigid continuation paths II. structured polynomial systems (Q6103341) (← links)
