IRIS Toolbox Reference Manual

blazer

Reorder steady-state equations into block-recursive structure

Syntax

[NameBlk,EqtnBlk] = blazer(M,...)

Input arguments

Output arguments

Description

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.

Example