Massachusetts Institute of Technology
Fast time domain simulation for large order hybrid systems
Abstract
dc:description.abstractSimulation is an important tool for the analysis and design of complex systems. As the models become more and more complex, more powerful simulation methods are desired. As an attempt to address this problem, a simulation scheme is proposed and developed in this thesis. The main objective of this work is to simulate continuous-time linear time-invariant (CT-LTI) systems efficiently with acceptable approximation and error. The method basically divides the original large order system into smaller subsystems, simulates them with state transition formula and superposes the responses by using the linearity property of LTI systems. A similarity transformation can first be employed to obtain the modal canonical form of the system. The modal form can then be divided into subsystems with manageable sizes. Discretization scheme specially developed for these subsystems can then be employed to get their discretized counterparts. At this stage, the original continuous-time IVP becomes a set of of smaller matrix vector multiplication routines. Special matrix vector product solver is chosen to exploit the sparsity resulted from the diagonalized structure of the A-matrix. Also, subsystems are considered in frequency domain to see if multiple sampling rate scheme is acceptable. Finally, the results of the simulations can be superposed to form the response of the original system. Next, the more advanced problem of simulating hybrid feedback control systems are studied.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2002
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Sou, Kin Cheong, 1979-
- Advisor dc:contributor.advisor
-
- Olivier L. de Weck.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/32248
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/32248