Pages that link to "Item:Q4733311"
From MaRDI portal
The following pages link to An Optimal Complexity Algorithm for Computing the Topological Degree in Two Dimensions (Q4733311):
Displaying 4 items.
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Improved subdivision scheme for the root computation of univariate polynomial equations (Q2451335) (← links)
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\) (Q2479133) (← links)
- COMPUTING TWO LINCHPINS OF TOPOLOGICAL DEGREE BY A NOVEL DIFFERENTIAL EVOLUTION ALGORITHM (Q3424487) (← links)
