Pages that link to "Item:Q5501604"

The following pages link to The complexity and geometry of numerically solving polynomial systems. (Q5501604):

Displaying 15 items.

• Smale's fundamental theorem of algebra reconsidered (Q404254) (← links)
• Complexity of path-following methods for the eigenvalue problem (Q404275) (← links)
• Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
• Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
• Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
• Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms (Q765856) (← links)
• A convex geometric approach to counting the roots of a polynomial system (Q1338221) (← links)
• Constructing polynomial systems with many positive solutions using tropical geometry (Q1635703) (← links)
• On the geometry and topology of the solution variety for polynomial system solving (Q1928275) (← links)
• Efficient polynomial system-solving by numerical methods (Q2431371) (← links)
• Resolution of polynomial systems (Q2725943) (← links)
• On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection (Q2985822) (← links)
• (Q3491728) (← links)
• (Q3740923) (← links)
• Geometry of polynomials and root-finding via path-lifting (Q4606640) (← links)