[NameBlk,EqtnBlk] = blazer(M,...)
M [ model ] - Model object.M [ model ] - Model object with variables and steady-state equations regrouped to create block-recursive structure.
NameBlk [ cell ] - Cell of cellstr with variable names in each block.
EqtnBlk [ cell ] - Cell of cellstr with equations in each block.
The reordering algorithm first identifies equations with a single variable in each, and variables occurring in a single equation each, and then uses a combination of column and row approximate minimum degree permutations (colamd) followed by a Dulmage-Mendelsohn permutation (dmperm).
The output arguments NameBlk and EqtnBlk are 1-by-N cell arrays, where N is the number of blocks, and each cell is a 1-by-Kn cell array of strings, where Kn is the number of variables and equations in block N.