Normalization of Rings
arXiv:0904.3561 · doi:10.1016/j.jsc.2010.04.002
Abstract
We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is also described. The new algorithm of this paper has been implemented in Singular, for localizations of affine rings with respect to arbitrary monomial orderings. Benchmark tests show that it is in general much faster than any other implementation of normalization algorithms known to us.
Final version, to be published in JSC 2010
Cited by in corpus (10)
- Parallel algorithms for normalization
- Local to global algorithms for the Gorenstein adjoint ideal of a curve
- Bad Primes in Computational Algebraic Geometry
- Computing integral bases via localization and Hensel lifting
- The Cohomology Annihilator of a Curve Singularity
- Local analysis of Grauert-Remmert-type normalization algorithms
- The use of Bad Primes in Rational Reconstruction
- Current Challenges in Developing Open Source Computer Algebra Systems
- Embedded desingularization for arithmetic surfaces -- toward a parallel implementation
- The Qth-power algorithm in characteristic 0