A simplification of Stenger's topological degree formula
From MaRDI portal
Publication:1249928
DOI10.1007/BF01399550zbMATH Open0387.65035MaRDI QIDQ1249928FDOQ1249928
Authors: Martin Stynes
Publication date: 1979
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132633
Cites Work
Cited In (12)
- Computing the topological degree with noisy information
- On the complexity of isolating real roots and computing with certainty the topological degree
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- On the construction of sufficient refinements for computation of topological degree
- On perturbation of roots of homogeneous algebraic systems
- Computing topological degree using noisy information
- Optimal solution of nonlinear equations
- Locating three-dimensional roots by a bisection method
- A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\)
- Improved subdivision scheme for the root computation of univariate polynomial equations
- Effective topological degree computation based on interval arithmetic
- Publications by, and About, Frank Stenger
This page was built for publication: A simplification of Stenger's topological degree formula
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249928)