Computing topological degree using noisy information

DOI10.1016/0885-064X(90)90029-DzbMath0714.55002MaRDI QIDQ750943

Misako Yokoyama

Publication date: 1990

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

topological degreeLipschitz functions

Mathematics Subject Classification ID

Degree, winding number (55M25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

Computing the topological degree with noisy information ⋮ The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information ⋮ The worst case complexity of the fredholm equation with periodic free term and 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
• 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
• An algorithm for numerical calculation of topological degree

This page was built for publication: Computing topological degree using noisy information