Algorithms for computing multiplier ideals

We give algorithms for computing multiplier ideals using Gröbner bases in Weyl algebras. To this end, we define a modification of Budur–Mustaţaˇ–Saito’s generalized Bernstein–Sato polynomial. We present several examples computed by our algorithm.