X - UWSpace - University of Waterloo

e solved serially.
In contrast. in the Lan-Fuller method, for the Bstage case as show in Figure 4.3. , the
original pmblem (P) is fint divided into a subproblem of stage 1 (PI) and an aggregated
subproblem of stage 2 to 9 (P2& then the aggregated subproblem is funher divided into a
subproblem of stage 2 (Pz) and an aggregated subproblem of stage 3 to 9 (Pi.9). This nested
partitioning process continues until the aggregated subpmblem of stage 8 and 9 (Ps.9) is
divided into a subproblem of stage 8 (P8) and a subproblem of stage 9 (Pg). The nested
panitioning process of Lm-Fuller has depth of 8. generalized as (N-1) depth. while the
hierarchicai partitioning process of the new decomposition algorithm has depth of 1.
generalized as floor(10g2~ or L+floor(logzN) (where t'iwr(.) is the function that rrtux-ns the
largest integer less than or equal to the argument). assuming that each bifurcation produces
subproblerns whose numben of parts are equal or different b y one.