Construction of regulating subgroups in almost completely decomposable groups

Based on a constructive proof of a theorem of Dittmann, an algorithm is developed for finding a regulating subgroup of an almost completely decomposable group given in standard description. The algorithm is implemented in the Maple 8 computer algebra system and involves properties and manipulations of matrices with integer entries.