Parallel algorithms for normalization

@article{Bhm2013ParallelAF,
  title={Parallel algorithms for normalization},
  author={Janko B{\"o}hm and Wolfram Decker and Santiago Laplagne and Gerhard Pfister and Andreas Steenpa{\ss} and Stefan Steidel},
  journal={J. Symb. Comput.},
  year={2013},
  volume={51},
  pages={99-114}
}
Given a reduced affine algebra A over a perfect field K, we present parallel algorithms to compute the normalization A@? 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 A@? by putting the local results… CONTINUE READING

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Modular algorithms for computing Gröbner bases

  • J. Symb. Comput.
  • 2003
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

A software system for research in algebraic geometry

Grayson, D. R. Stillman Grayson, M. E. Stillman
  • 2010

An algorithm for computing the integral closure

Swanson
  • Journal of Symbolic Computation
  • 2009
VIEW 1 EXCERPT