MIT Libraries logoDSpace@MIT

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

Model reduction in physical domain

Author(s)
Ye, Yong, 1971-
Thumbnail
DownloadFull printable version (4.425Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mechanical Engineering.
Advisor
Kamal Youcef-Toumi.
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
Modeling is an essential part of the analysis and the design of dynamic systems. Contemporary computer algorithms can produce very detailed models for complex systems with little time and effort. However, over complicated models may not be efficient. Therefore, reducing a model to a more manageable size has become an attractive research topic. A very useful type of reduced models is obtained by removing as many physical components as possible from the original model. Such approach is known as model reduction in the physical domain. Many results have been achieved in model reduction in the physical domain during past decades. Nonetheless, the newest developments in engineering practice as well as in theoretical research have brought about further challenges and opportunities. In this thesis, the criteria and the scope of model reduction in the physical domain are reinvestigated. As a result, a criterion based on the Hc norm of certain error model is proposed. Furthermore, the scope of model reduction is also extended. In this thesis, a mathematical framework is constructed for model reduction in physical domain. Specifically, model reduction problem is formulated as an optimization problem with bilinear matrix inequality (BMI) constraints. A branch-and-bound algorithm is developed to solve the BMI problem. The algorithm is proved to converge to global optimum. Several examples are presented to illustrate the use of the proposed model reduction scheme.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2002.
 
Includes bibliographical references (leaves 107-113).
 
Date issued
2002
URI
http://hdl.handle.net/1721.1/8336
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Publisher
Massachusetts Institute of Technology
Keywords
Mechanical Engineering.

Collections
  • Doctoral 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.