2008-12-01
Computability and Representations of the Zero Set
Publication
Publication
Electronic Notes in Theoretical Computer Science , Volume 221 p. 37- 43
Presented at the
International Conference on Computability and Complexity in Analysis, Hagen, Deutschland
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representation. The computation of the zero set is based on topological index theory, the most powerful tool for finding robust solutions of equations.
| Additional Metadata | |
|---|---|
| , , , | |
| , | |
| Elsevier | |
| Electronic Notes in Theoretical Computer Science | |
| Computational Topology for Systems and Control | |
| International Conference on Computability and Complexity in Analysis | |
| Organisation | Scientific Computing |
|
Collins, P. (2008). Computability and Representations of the Zero Set. In Electronic Notes in Theoretical Computer Science (Vol. 221, pp. 37–43). Elsevier. |
|
