Return to search

Graph-theoretic Sensitivity Analysis of Dynamic Systems

The main focus of this research is to use graph-theoretic formulations to develop an automated algorithm for the generation of sensitivity equations. The idea is to combine the benefits of direct differentiation with that of graph-theoretic formulation. The primary deliverable of this work is the developed software module which can derive the system equations and the sensitivity equations directly from the linear graph of the system.

Sensitivity analysis refers to the study of changes in system behaviour brought about by the changes in model parameters. Due to the rapid increase in the sizes and complexities of the models being analyzed, it is important to extend the capabilities of the current tools of sensitivity analysis, and an automated, efficient, and accurate method for the generation of sensitivity equations is highly desirable.

In this work, a graph-theoretic algorithm is developed to generate the sensitivity equations. In the current implementation, the proposed algorithm uses direct differentiation to generate sensitivity equations at the component level and graph-theoretic methods to assemble the equation fragments to form the sensitivity equations.

This way certain amount of control can be established over the size and complexity of the generated sensitivity equations. The implementation of the algorithm is based on a commercial software package \verb MapleSim[Multibody] and can generate governing and sensitivity equations for multibody models created in MapleSim.

In this thesis, the algorithm is tested on various mechanical, hydraulic, electro-chemical, multibody, and multi-domain systems. The generated sensitivity information are used to perform design optimization and parametric importance studies. The sensitivity results are validated using finite difference formulations.

The results demonstrate that graph-theoretic sensitivity analysis is an automated, accurate, algorithmic method of generation for sensitivity equations, which enables the user to have some control over the form and complexity of the generated equations. The results show that the graph-theoretic method is more efficient than the finite difference approach. It is also demonstrated that the efficiency of the generated equations are at par or better than the equation obtained by direct differentiation.

Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OWTU.10012/7695
Date29 July 2013
CreatorsBanerjee, Joydeep
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeThesis or Dissertation

Page generated in 0.0019 seconds