<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T07:39:42Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/41726" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/41726</identifier><datestamp>2022-01-13T07:54:53Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Jacob K. White.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Xu, Song, S.M. Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Computation for Design and Optimization Program</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-05-19T16:12:29Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-05-19T16:12:29Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/41726</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">225068996</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 83-86).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Xu, Song.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">S.M.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">86 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Computation for Design and Optimization Program.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A shifting method for dynamic system Model Order Reduction</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1d060897-f5a3-41b8-995a-a8ae7bfe76e5">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>A shifting method for dynamic system Model Order Reduction&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Xu, Song, S.M. Massachusetts Institute of Technology&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Computation for Design and Optimization Program.&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>