On computability and triviality of well groups

DOI10.4230/LIPICS.SOCG.2015.842MaRDI QIDQ5368733zbMATH OpenOpenAlexFDO

Authors Peter Franek, Marek Krčál

Publication date 10 October 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/compgeom/compgeom2015.html#FranekK15

zbMATH Keywords

robustnessnonlinear equationscomputationhomotopy theorywell 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)

Recommendations

• On computability and triviality of well groups
• Stable comparison of multidimensional persistent homology groups with torsion
• Persistence of zero sets
• Computability and representations of the zero set
• Homology and robustness of level and interlevel sets

Cited in

(5)

• Solving equations and optimization problems with uncertainty
• On computability and triviality of well groups
• Quantifying transversality by measuring the robustness of intersections
• The robustness of level sets
• Persistence of zero sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368733)