In this paper, we extend our Textured Algorithm - to multi-intersected textured models. We also describe the recursive textured decomposition process as a tree, in which we can obtain the overall solution by consolidating the end subsystem solutions. The proposed algorithms, their properties, and the theorems for exact convergence are then addressed. The worst-case time complexity of the algorithm with complete tree structure, in which parents in the same recursion level have the same number of children, is analyzed. Examples are given to demonstrate the use of the algorithms and the trade-off among the number of recursion levels, the number of sequential computing steps, and problem size reduction.
|Number of pages||6|
|Journal||Proceedings of the IEEE Conference on Decision and Control|
|Publication status||Published - 1 Dec 1995|
ASJC Scopus subject areas
- Control and Systems Engineering
- Modelling and Simulation
- Control and Optimization