MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A shifting method for dynamic system Model Order Reduction

Author(s)
Xu, Song, S.M. Massachusetts Institute of Technology
Thumbnail
DownloadFull printable version (2.780Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Jacob K. White.
Terms of use
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
Model Order Reduction (MOR) is becoming increasingly important in computational applications. At the same time, the need for more comprehensive models of systems is generating problems with increasing numbers of outputs and inputs. Classical methods, which were developed for Single-Input Single-Output (SISO) systems, generate reduced models that are too computationally inefficient for large Multiple-Input Multiple-Output (MIMO) systems. Although many approaches exclusively designed for MIMO systems have emerged during the past decade, they cannot satisfy the overall needs for maintaining the characteristics of systems. This research investigates the reasons for the poor performances of the proposed approaches, using specific examples. Inspired by these existing methods, this research develops a novel way to extract information from MIMO systems, by means of system transfer functions. The approach, called Shifting method, iteratively extracts time-constant shifts from the system and splits the transfer function into several simple systems referred to as contour terms that outline the system structure, and a reducible system referred to as remainder system that complement the Contour Terms. This algorithm produces a remainder system that existing approaches can reduce more effectively. This approach works particularly well for systems with either tightly clustered or well separated modes, and all the operations are O(n). The choice of shifts is based on an optimization process, with Chebyshev Polynomial roots as initial guesses. This paper concludes with a demonstration of the procedure as well as related error and stability analysis.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.
 
Includes bibliographical references (p. 83-86).
 
Date issued
2007
URI
http://hdl.handle.net/1721.1/41726
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.