Massively parallel solver for the high-order Galerkin Least-Squares method
Author(s)Yano, Masayuki, Ph. D. Massachusetts Institute of Technology
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
David L. Darmofal.
MetadataShow full item record
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.
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).
DepartmentMassachusetts Institute of Technology. Computation for Design and Optimization Program.
Massachusetts Institute of Technology
Computation for Design and Optimization Program.