On the construction of sufficient refinements for computation of topological degree
From MaRDI portal
Publication:1148023
DOI10.1007/BF01400322zbMath0451.55001MaRDI QIDQ1148023
Publication date: 1981
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132744
Software, source code, etc. for problems pertaining to algebraic topology (55-04) Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (11)
A rapid generalized method of bisection for solving systems of non-linear equations ⋮ Optimal solution of nonlinear equations ⋮ On Faster Convergence of the Bisection Method for Certain Triangles ⋮ Computing the topological degree with noisy information ⋮ Locating three-dimensional roots by a bisection method ⋮ A reliable algorithm for computing the topological degree of a mapping in \(\mathbb R^{2}\) ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ An N-Dimensional bisection method for solving systems of n equations in N unknowns ⋮ Complexity of computing topological degree of Lipschitz functions in n dimensions ⋮ On perturbation of roots of homogeneous algebraic systems ⋮ Computing topological degree using noisy information
Cites Work
- Unnamed Item
- Computing the topological degree of a mapping in \(R^n\)
- A simplification of Stenger's topological degree formula
- A Lower Bound on the Angles of Triangles Constructed by Bisecting the Longest Side
- Research announcement an algorithm for numerical calculation of topical degree
- An algorithm for numerical calculation of topological degree
This page was built for publication: On the construction of sufficient refinements for computation of topological degree
