Desingularization algorithms: a comparison from the practical point of view

DOI10.1142/9789814383462_0002MaRDI QIDQ2812488zbMATH OpenOpenAlexFDO

Authors Rocío Blanco, Anne Frühbis-Krüger

Publication date 16 June 2016

Published in Harmony of Gröbner Bases and the Modern Industrial Society - The Second CREST-CSBM International Conference (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Global theory and resolution of singularities (algebro-geometric aspects) (14E15) Software, source code, etc. for problems pertaining to algebraic geometry (14-04)

Abstract: Over the last decade, implementations of several desingularization algorithms have appeared in various contexts. These differ as widely in their methods and in their practical efficiency as they differ in the situations in which they may be applied. The purpose of this article is to give a brief overview over a selection of these approaches and the applicability of the respective implementations in Singular.

Recommendations

• scientific article; zbMATH DE number 2100964
• Computational aspects of singularities
• Algorithms in SINGULAR
• scientific article; zbMATH DE number 786609
• scientific article; zbMATH DE number 2212623

Cited in

(2)

• A semi-canonical reduction for periods of Kontsevich–Zagier
• Desingularization explains order-degree curves for Ore operators

Describes a project that uses

Uses Software

• desing.lib
• resbinomial
• resolve.lib
• reszeta.lib
• SINGULAR

This page was built for publication: Desingularization algorithms: a comparison from the practical point of view

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