On computability and triviality of well groups

DOI10.1007/s00454-016-9794-2zbMath1353.65047arXiv1501.03641OpenAlexW1895954743WikidataQ59462583 ScholiaQ59462583MaRDI QIDQ306506

Peter Franek, Marek Krčál

Publication date: 31 August 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.03641

zbMATH Keywords

robustnessnonlinear equationsobstruction theoryhomotopy theorycomputational topologywell groups

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Obstruction theory in algebraic topology (55S35) Cohomotopy groups (55Q55)

Related Items (1)

Robust feasibility of systems of quadratic equations using topological degree theory

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifying transversality by measuring the robustness of intersections
• Computing well diagrams for vector fields on \(\mathbb R^n\)
• On existence and uniqueness verification for non-smooth functions
• Persistence of zero sets
• Homology and robustness of level and interlevel sets
• Quasi-decidability of a fragment of the first-order theory of real numbers
• On the theory of obstructions
• Computing All Maps into a Sphere
• Topology and data
• Interval Methods for Systems of Equations
• Accuracy and Stability of Numerical Algorithms
• Computability and Representations of the Zero Set
• Robust Satisfiability of Systems of Equations
• Elementary Differential Topology. (AM-54)
• Existence Tests for Solutions of Nonlinear Equations Using Borsuk's Theorem
• Axiomatic Approach to Homology Theory

This page was built for publication: On computability and triviality of well groups