This paper outlines two methods of computing irredundant irreducible
decompositions of large scale monomial ideals with tens of thousands of minimal
generators. Accomplishing this task is infeasible in current available software
given the algorithms they use. In contrast, an implementation was built using
the methods in this paper and that gave successful computational results.
