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.

Riemannian geometry of matrix manifolds for Lagrangian uncertainty quantification of stochastic fluid flows

Author(s)
Feppon, Florian (Florian Jeremy)
Thumbnail
DownloadFull printable version (18.50Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Pierre F.J. Lermusiaux.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
This work focuses on developing theory and methodologies for the analysis of material transport in stochastic fluid flows. In a first part, two dominant classes of techniques for extracting Lagrangian Coherent Structures are reviewed and compared and some improvements are suggested for their pragmatic applications on realistic high-dimensional deterministic ocean velocity fields. In the stochastic case, estimating the uncertain Lagrangian motion can require to evaluate an ensemble of realizations of the flow map associated with a random velocity flow field, or equivalently realizations of the solution of a related transport partial differential equation. The Dynamically Orthogonal (DO) approximation is applied as an efficient model order reduction technique to solve this stochastic advection equation. With the goal of developing new rigorous reduced-order advection schemes, the second part of this work investigates the mathematical foundations of the method. Riemannian geometry providing an appropriate setting, a framework free of tensor notations is used to analyze the embedded geometry of three popular matrix manifolds, namely the fixed rank manifold, the Stiefel manifold and the isospectral manifold. Their extrinsic curvatures are characterized and computed through the study of the Weingarten map. As a spectacular by-product, explicit formulas are found for the differential of the truncated Singular Value Decomposition, of the Polar Decomposition, and of the eigenspaces of a time dependent symmetric matrix. Convergent gradient flows that achieve related algebraic operations are provided. A generalization of this framework to the non-Euclidean case is provided, allowing to derive analogous formulas and dynamical systems for tracking the eigenspaces of non-symmetric matrices. In the geometric setting, the DO approximation is a particular case of projected dynamical systems, that applies instantaneously the SVD truncation to optimally constrain the rank of the reduced solution. It is obtained that the error committed by the DO approximation is controlled under the minimal geometric condition that the original solution stays close to the low-rank manifold. The last part of the work focuses on the practical implementation of the DO methodology for the stochastic advection equation. Fully linear, explicit central schemes are selected to ensure stability, accuracy and efficiency of the method. Riemannian matrix optimization is applied for the dynamic evaluation of the dominant SVD of a given matrix and is integrated to the DO time-stepping. Finally the technique is illustrated numerically on the uncertainty quantification of the Lagrangian motion of two bi-dimensional benchmark flows.
Description
Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2017.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 119-129).
 
Date issued
2017
URI
http://hdl.handle.net/1721.1/111041
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.