The algorithm used appears in the paper 'Algorithims for D-modules' by Oaku-Takayama(1999). The method is to compute an adapted resolution with respect to the weight vector w and use the b-function with respect to w to truncate the resolution.
i1 : R = QQ[x_1,x_2,D_1,D_2,WeylAlgebra=>{x_1=>D_1,x_2=>D_2}] o1 = R o1 : PolynomialRing, 2 differential variables |
i2 : I = ideal(x_1, D_2-1) o2 = ideal (x , D - 1) 1 2 o2 : Ideal of R |
i3 : Drestriction(I,{1,0}) o3 = HashTable{0 => 0 } 1 => cokernel | D_2-1 | o3 : HashTable |
The object Drestriction is a method function with options.