Parallel algorithms for normalization

• Autores: Böhm, J.; Decker, W.; Laplagne, S.; Pfister, G.; Steenpaß, A.; Steidel, S.
• Año de publicación: 2013
• Idioma: inglés
• Tipo de recurso: artículo
• Fuente: J. Symb. Comput. 2013;51:99-114
• Materia: Grauert-Remmert criterion; Integral closure; Modular computation; Normalization; Parallel computation; Test ideal
• Institución: Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales

Given a reduced affine algebra A over a perfect field K, we present parallel algorithms to compute the normalization Ā of A. Our starting point is the algorithm of Greuel et al. (2010), which is an improvement of de Jong's algorithm (de Jong, 1998; Decker et al., 1999). First, we propose to stratify the singular locus Sing(A) in a way which is compatible with normalization, apply a local version of the normalization algorithm at each stratum, and find Ā by putting the local results together. Second, in the case where K=Q is the field of rationals, we propose modular versions of the global and local-to-global algorithms. We have implemented our algorithms in the computer algebra system Singular and compare their performance with that of the algorithm of Greuel et al. (2010). In the case where K=Q, we also discuss the use of modular computations of Gröbner bases, radicals, and primary decompositions. We point out that in most examples, the new algorithms outperform the algorithm of Greuel et al. (2010) by far, even if we do not run them in parallel. © 2012 Elsevier B.V.
Fil:Laplagne, S. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.