Complexity of computing topological degree of Lipschitz functions in n dimensions
From MaRDI portal
Publication:578854
DOI10.1016/0885-064X(86)90022-1zbMath0624.65043MaRDI QIDQ578854
Publication date: 1986
Published in: Journal of Complexity (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25)
Related Items
Optimal solution of nonlinear equations, Computing the topological degree with noisy information, Existence and computation of short-run equilibria in economic geography, Randomization for continuous problems, On the complexity of isolating real roots and computing with certainty the topological degree, Effective topological degree computation based on interval arithmetic, Quasi-decidability of a fragment of the first-order theory of real numbers, Complexity of computing topological degree of Lipschitz functions in n dimensions, Computing topological degree using noisy information
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- On the construction of sufficient refinements for computation of topological degree
- Bisection is optimal
- Computing the topological degree of a mapping in \(R^n\)
- An efficient degree-computation method for a generalized method of bisection
- A simplification of Stenger's topological degree formula
- Perspectives on information-based complexity
- An algorithm for numerical calculation of topological degree
