Computations modulo regular chains

Details Computations modulo regular chains Computations modulo regular chains

2009-03-21

arxiv.org/abs/0903.3690v2

Computer Science

Symbolic Computation

27 pages, 8 figures

Scientific paper

The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular methods and fast polynomial arithmetic. Our strategies take also advantage of the context in which these operations are performed. We report on extensive experimentation, comparing our code to pre-existing Maple implementations, as well as more optimized Magma functions. In most cases, our new code outperforms the other packages by several orders of magnitude.

Affiliated with

Also associated with

No associations

Rating

Computations modulo regular chains does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computations modulo regular chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computations modulo regular chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190685