Parallel solution of torn networks

Abstract The aptitude of various sparse matrix diakoptic procedures to a solution on parallel processors is analysed. Three orders of parallelism are identified: the first is peculiar to diakoptics and concerns the possibility of concurrently solving the noninteracting subnetworks resulting from the tearing of interconnection lines; the second concerns the algorithm used for the solution of each subnetwork and stems from the possibility of simultaneously carrying out different steps of the solution process at subnetwork level; the third concerns the possibility of performing operations of one or more parallel steps simultaneously.