UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Graph-theoretic Sensitivity Analysis of Dynamic Systems

dc.comment.hiddenI have adjusted the page numbers so that the declaration page starts with (II) and the first page number (title page) is not shown.en
dc.contributor.authorBanerjee, Joydeep
dc.date.accessioned2013-08-09T14:15:39Z
dc.date.available2014-05-07T05:00:30Z
dc.date.issued2013-08-09T14:15:39Z
dc.date.submitted2013-07-29
dc.description.abstractThe 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.en
dc.description.embargoterms1 yearen
dc.identifier.urihttp://hdl.handle.net/10012/7695
dc.language.isoenen
dc.pendingtrueen
dc.publisherUniversity of Waterlooen
dc.subjectMultibody Systemsen
dc.subjectGraph-theoryen
dc.subjectSensitivity analysisen
dc.subjectAutomatic generation of equationsen
dc.subjectSymbolic sensitivity analysisen
dc.subject.programSystem Design Engineeringen
dc.titleGraph-theoretic Sensitivity Analysis of Dynamic Systemsen
dc.typeDoctoral Thesisen
uws-etd.degreeDoctor of Philosophyen
uws-etd.degree.departmentSystems Design Engineeringen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Banerjee_Joydeep.pdf
Size:
4.45 MB
Format:
Adobe Portable Document Format
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
261 B
Format:
Item-specific license agreed upon to submission
Description: