Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Domain partitioning to bound moments of differential equations using semidefinite optimization

Domain partitioning to bound moments of differential equations using semidefinite optimization

Thumbnail Image
Download
Name

85844111-MIT.pdf

Description
Full printable version
Size

2.9 MB

Format

Adobe PDF

Checksum (MD5)

af6b370051777191fa0a512f571f410d

Author(s)
Sethuraman, Sandeep
Advisor(s)
Pablo A. Parrilo.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis, we present a modification of an existing methodology to obtain a hierarchy of lower and upper bounds on moments of solutions of linear differential equations. The motivation for change is to obtain tighter bounds by solving smaller semidefinite problems. The modification we propose involves partitioning the domain and normalizing each partition to ensure numerical stability. Using the adjoint operator, linear constraints involving the boundary conditions and moments of the solution are developed for each partition. Semidefinite constraints are imposed on the moments, and an optimization problem is solved to obtain the bounds. We have demonstrated the algorithm by calculating bounds on moments of various one-dimensional case differential equations including the Bessel ODE, and Legendre polynomials. In the two-dimensional case we have demonstrated the algorithm by calculating bounds on various PDEs including the Helmholtz equation, and heat equation. In both cases, the results were encouraging with tighter bounds on moments being obtained by solving smaller problems with domain partitioning.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.
Includes bibliographical references (leaf 95).
Subjects
Computation for Design and Optimization Program.
MIT Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program
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
Persistent DSpace Link
http://hdl.handle.net/1721.1/39213
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.