Massively parallel computations in algebraic geometry - not a contradiction
arXiv:1811.06092
Abstract
The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GPI-Space, we have developed an infrastructure for massively parallel computations in commutative algebra and algebraic geometry. In this note, we give an overview on the current capabilities of this framework by looking into three sample applications: determining smoothness of algebraic varieties, computing GIT-fans in geometric invariant theory, and determining tropicalizations. These applications employ algorithmic methods originating from commutative algebra, sheaf structures on manifolds, local geometry, convex geometry, group theory, and combinatorics, illustrating the potential of the framework in further problems in computer algebra.
arXiv comment9 pages, 6 figures
References in corpus (9)
- Computing Tropical Varieties
- Complete sets of logarithmic vector fields for integration-by-parts identities of Feynman integrals
- Tropical mirror symmetry for elliptic curves
- Parallel algorithms for normalization
- A smoothness test for higher codimensions
- Computing GIT-fans with symmetry and the Mori chamber decomposition of
- Towards Massively Parallel Computations in Algebraic Geometry
- Current Challenges in Developing Open Source Computer Algebra Systems
- Embedded desingularization for arithmetic surfaces -- toward a parallel implementation