Pages that link to "Item:Q629539"
From MaRDI portal
The following pages link to Condition number based complexity estimate for solving polynomial systems (Q629539):
Displaying 9 items.
- A condition-based algorithm for solving polyhedral feasibility problems (Q457560) (← links)
- Condition length and complexity for the solution of polynomial systems (Q506608) (← links)
- High probability analysis of the condition number of sparse polynomial systems (Q598221) (← links)
- Condition number based complexity estimate for computing local extrema (Q1026449) (← links)
- Using the method of dual quadratic solutions to solve systems of polynomial equations in the complex domain (Q1905198) (← links)
- Discovering polynomial Lyapunov functions for continuous dynamical systems (Q2437283) (← links)
- Validating the Completeness of the Real Solution Set of a System of Polynomial Equations (Q2985821) (← links)
- A condition number theorem for underdetermined polynomial systems (Q4517526) (← links)
- Characterizations and Criteria for Synchronization of Heterogeneous Networks to Linear Subspaces (Q4599721) (← links)