Parallel algorithms for normalization

DOI10.1016/j.jsc.2012.07.002zbMath1408.13072arXiv1110.4299OpenAlexW2084632107MaRDI QIDQ1940924

Andreas Steenpaß, Janko Böhm, Santiago Laplagne, Gerhard Pfister, Stefan Steidel, Wolfram Decker

Publication date: 11 March 2013

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

parallel computationtest idealnormalizationintegral closuremodular computationGrauert-Remmert criterion

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10) Commutative ring extensions and related topics (13Bxx)

Related Items (11)

Computing integral bases via localization and Hensel lifting ⋮ Comments on Integration of Algebraic Functions ⋮ Local to Global Algorithms for the Gorenstein Adjoint Ideal of a Curve ⋮ Desingularization of Arithmetic Surfaces: Algorithmic Aspects ⋮ A smoothness test for higher codimensions ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ LOCAL ANALYSIS OF GRAUERT–REMMERT-TYPE NORMALIZATION ALGORITHMS ⋮ Towards massively parallel computations in algebraic geometry ⋮ Bad Primes in Computational Algebraic Geometry ⋮ Embedded desingularization for arithmetic surfaces – toward a parallel implementation ⋮ The use of bad primes in rational reconstruction

Uses Software

• Macaulay2
• Magma
• SINGULAR

This page was built for publication: Parallel algorithms for normalization