Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms

Publisher Website
Google Scholar
Abstract
The rows and columns of an arbitrary coefficient matrix of large numerical problems can often be permuted so that substantial time can be saved in computations. For example, if a large linear programming problem has a suitable block-angular structure, one of the time-saving decomposition algorithms can be used. This article presents a systematic method for effecting such a block-angular permutation. An example and the results of manipulations of matrices with more than 300 rows and 2500 columns are shown.