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-constrained optimization methods for reduction of parameterized large-scale systems

Author(s)
Bui-Thanh, Tan
Thumbnail
DownloadFull printable version (1.546Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics.
Advisor
Karen E. Willcox.
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
Most model reduction techniques employ a projection framework that utilizes a reduced-space basis. The basis is usually formed as the span of a set of solutions of the large-scale system, which are computed for selected values (samples) of input parameters and forcing inputs. In existing model reduction techniques, choosing where and how many samples to generate has been, in general, an ad-hoc process. A key challenge is therefore how to systematically sample the input space, which is of high dimension for many applications of interest. This thesis proposes and analyzes a model-constrained greedy-based adaptive sampling approach in which the parametric input sampling problem is formulated as an optimization problem that targets an error estimation of reduced model output prediction. The method solves the optimization problem to find a locally-optimal point in parameter space where the error estimator is largest, updates the reduced basis with information at this optimal sample location, forms a new reduced model, and repeats the process. Therefore, we use a systematic, adaptive error metric based on the ability of the reduced-order model to capture the outputs of interest in order to choose the snapshot locations that are locally the worst case scenarios.
 
(cont.) The state-of-the-art subspace trust-region interior-reflective inexact Newton conjugate-gradient optimization solver is employed to solve the resulting greedy partial differential equation constrained optimization problem, giving a reduction methodology that is efficient for large-scale systems and scales well to high-dimensional input spaces. The model-constrained adaptive sampling approach is applied to a steady thermal fin optimal design problem and to probabilistic analysis of geometric mistuning in turbomachinery. The method leads to reduced models that accurately represent the full large-scale systems over a wide range of parameter values in parametric spaces up to dimension 21.
 
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2007.
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Includes bibliographical references (p. 143-158).
 
Date issued
2007
URI
http://hdl.handle.net/1721.1/40305
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Publisher
Massachusetts Institute of Technology
Keywords
Aeronautics and Astronautics.

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.