Computational D-module theory with singular, comparison with other systems and two new algorithms
Viktor Levandovskyy, Jorge Martín Morales · 2008
We present the new implementation of core functions for the computational D-module theory. It is realized as a library dmod.lib in the computer algebra system Singular. We show both theoretical advances, such as the LOT and checkRoot algorithms as well as the comparison of our implementation with other packages for D-modules in computer algebra systems kan/sm1, Asir and Macaulay. The comparison indicates, that our implementation is among the fastest ones. With our package we are able to solve several challenges in D-module theory and we demonstrate the answers to these problems.