Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Massively parallel solver for the high-order Galerkin Least-Squares method

Massively parallel solver for the high-order Galerkin Least-Squares method

Thumbnail Image
Download
Name

587602496-MIT.pdf

Description
Full printable version
Size

897.52 KB

Format

Adobe PDF

Checksum (MD5)

b977c98f875cb6ddcbe527a504d2a90f

Author(s)
Yano, Masayuki, Ph. D. Massachusetts Institute of Technology
Advisor(s)
David L. Darmofal.
Date Issued
2009
Publisher
Massachusetts Institute of Technology
Abstract
A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with massively parallel implicit solvers. The stabilization parameter of the GLS discretization is modified to improve the resolution characteristics and the condition number for the high-order interpolation. The Balancing Domain Decomposition by Constraints (BDDC) algorithm is applied to the linear systems arising from the two-dimensional, high-order discretization of the Poisson equation, the advection-diffusion equation, and the Euler equation. The Robin-Robin interface condition is extended to the Euler equation using the entropy-symmetrized variables. The BDDC method maintains scalability for the high-order discretization for the diffusion-dominated flows. The Robin-Robin interface condition improves the performance of the method significantly for the advection-diffusion equation and the Euler equation. The BDDC method based on the inexact local solvers with incomplete factorization maintains the scalability of the exact counterpart with a proper reordering.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 85-91).
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/54217
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.