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.

Efficient numerical methods for solving the Boltzmann equation for low-speed flows

Author(s)
Baker, Lowell L. (Lowell Lane), 1980-
Thumbnail
DownloadFull printable version (2.589Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Mechanical Engineering.
Advisor
Nicolas G. Hadjiconstantinou.
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
When the Knudsen number, typically defined as the ratio of the molecular mean free path to the characteristic length scale of a dilute gas flow, is larger than approximately 0.1, the Navier-Stokes equations are no longer valid. In this case, which is frequently encountered in small-scale flows, one must solve the more general Boltzmann equation. The objective of this work is to develop a method which requires a lower computational cost than existing methods for low speed flows. This thesis describes and analyzes the performance of a method to solve the Boltzmann equation for dilute gas flows by a direct numerical method rather than by the more prevalent stochastic molecular simulation approach. In this work, the evaluation of the collision integral of the Boltzmann equation is performed using a quasi-random Monte Carlo integration approach for faster convergence. In addition, interpolation is used to reduce the effect of discretization errors. We find that cubic interpolation leads to accurate solutions which exhibit excellent conservation properties, thus eliminating the need for an artificial correction step. The use of quasi-random sequences is shown to provide a significant speedup, which increases as the discretization becomes finer. For the problems investigated here, the maximum speedup observed is on the order of four.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2004.
 
Includes bibliographical references (leaves 66-67).
 
Date issued
2004
URI
http://hdl.handle.net/1721.1/17922
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Publisher
Massachusetts Institute of Technology
Keywords
Mechanical Engineering.

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.