A graph algorithm for linearizing simulink models
Zhi Jun Han, Pieter J. Mosterman, Fu Zhang · 2013
This paper presents a new efficient approach for performing linearization of Simulink R © models. It improves the efficiency of existing linearization algorithms using a Jacobian graph, a graph-based data structure that captures the linear relation-ship between input, output and state variables. The graph-based algorithm enables the use of graph transformations to reduce the size of the Jacobian data structure, thereby im-proving the efficiency of subsequent computations. This pa-per presents a heuristic implementation of the graph-based al-gorithm. Experimental results on a number of Simulink mod-els of different sizes show how the approach is able to sig-nificantly improve computational efficiency and memory use especially in models with large numbers of blocks and states. 1.