Numerical computations on the M-resistor trimming problem

The m-resistor trimming problem consists of finding the lengths of m-slits that are cut in a given polygon to achieve “2m” desired resistances. In this short report we present the results of some numerical computations performed on more complex polygonal regions with a larger number of interior slits than in (Elcrat et. al., 1995), and we study the robustness of the numerical algorithm developed in (Elcrat et. al., 1995) on these new domains.