Computing the topological degree with noisy information

DOI10.1006/jcom.1997.0445zbMath0880.68062OpenAlexW2013735456MaRDI QIDQ1368836

Misako Yokoyama

Publication date: 20 November 1997

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

Full work available at URL: https://doi.org/10.1006/jcom.1997.0445

zbMATH Keywords

noisy evaluationstopological degree of Lipschitz functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

How to minimize the cost of iterative methods in the presence of perturbations ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ 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
• Unnamed Item
• Complexity of computing topological degree of Lipschitz functions in n dimensions
• Computing topological degree using noisy information
• 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 the topological degree with noisy information