Algorithms for computing a primary ideal decomposition without producing intermediate redundant components

► We propose an efficient algorithm for computing a minimal primary ideal decomposition. ► All associated primes are obtained from colon ideals computed in the algorithm. ► Each primary component is extracted from the corresponding intermediate component. ► The extraction is done by computing a saturated separating ideal. ► The algorithm efficiently decomposes many hard-to-decompose ideals.