“…As summarized by the authors, the MATE algorithm embodies the concepts of multi-node Thévenin equivalents, diakoptics, and the modified nodal analysis by Ho et al [23], in a simple and general formulation. The first dedicated hardware architecture for MATE was presented in [24,25], while the first general-purpose implementation on an off-the-shelf PC cluster, including sparsity techniques, was performed in [26][27][28]. In this last implementation, solutions of the Western Electricity Coordinating Council (WECC) system ($15,000 buses) with the parallel MATE algorithm achieved a 7-time speedup on 15 processors as compared to a single-processor sequential sparsity-oriented solver.…”