Pages that link to "Item:Q2479133"
From MaRDI portal
The following pages link to A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\) (Q2479133):
Displaying 9 items.
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
- Degree of rational mappings, and the theorems of Sturm and Tarski (Q942964) (← links)
- Numerical implementation of complex orthogonalization, parallel transport on Stiefel bundles, and analyticity (Q979117) (← links)
- A framework for existence tests based on the topological degree and homotopy (Q1006842) (← links)
- About tracing problems in dynamic geometry (Q1943666) (← links)
- Improved subdivision scheme for the root computation of univariate polynomial equations (Q2451335) (← links)
- Parallel computation of real solving bivariate polynomial systems by zero-matching method (Q2451343) (← links)
- A numerical approach to compute the topology of the apparent contour of a smooth mapping from \(\mathbb{R}^2\) to \(\mathbb{R}^2\) (Q2517499) (← links)
