Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, February 2012.

Bibliographic Details
Main Author: Diosady, Laslo Tibor
Other Authors: David L. Darmofal.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2012
Subjects:
Online Access:http://hdl.handle.net/1721.1/71454
_version_ 1811091052395757568
author Diosady, Laslo Tibor
author2 David L. Darmofal.
author_facet David L. Darmofal.
Diosady, Laslo Tibor
author_sort Diosady, Laslo Tibor
collection MIT
description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, February 2012.
first_indexed 2024-09-23T14:56:22Z
format Thesis
id mit-1721.1/71454
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T14:56:22Z
publishDate 2012
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/714542019-04-12T07:51:53Z Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations Diosady, Laslo Tibor David L. Darmofal. Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Massachusetts Institute of Technology. Dept. of Aeronautics and Astronautics. Aeronautics and Astronautics. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, February 2012. "September 2011." Cataloged from PDF version of thesis. Includes bibliographical references (p. 147-155). Aerodynamic flows involve features with a wide range of spatial and temporal scales which need to be resolved in order to accurately predict desired engineering quantities. While computational fluid dynamics (CFD) has advanced considerably in the past 30 years, the desire to perform more complex, higher-fidelity simulations remains. Present day CFD simulations are limited by the lack of an efficient high-fidelity solver able to take advantage of the massively parallel architectures of modern day supercomputers. A higher-order hybridizable discontinuous Galerkin (HDG) discretization combined with an implicit solution method is proposed as a means to attain engineering accuracy at lower computational cost. Domain decomposition methods are studied for the parallel solution of the linear system arising at each iteration of the implicit scheme. A minimum overlapping additive Schwarz (ASM) preconditioner and a Balancing Domain Decomposition by Constraints (BDDC) preconditioner are developed for the HDG discretization. An algebraic coarse space for the ASM preconditioner is developed based on the solution of local harmonic problems. The BDDC preconditioner is proven to converge at a rate independent of the number of subdomains and only weakly dependent on the solution order or the number of elements per subdomain for a second-order elliptic problem. The BDDC preconditioner is extended to the solution of convection-dominated problems using a Robin-Robin interface condition. An inexact BDDC preconditioner is developed based on incomplete factorizations and a p-multigrid type coarse grid correction. It is shown that the incomplete factorization of the singular linear systems corresponding to local Neumann problems results in a nonsingular preconditioner. The inexact BDDC preconditioner converges in a similar number of iterations as the exact BDDC method, with significantly reduced CPU time. The domain decomposition preconditioners are extended to solve the Euler and Navier- Stokes systems of equations. An analysis is performed to determine the effect of boundary conditions on the convergence of domain decomposition methods. Optimized Robin-Robin interface conditions are derived for the BDDC preconditioner which significantly improve the performance relative to the standard Robin-Robin interface conditions. Both ASM and BDDC preconditioners are applied to solve several fundamental aerodynamic flows. Numerical results demonstrate that for high-Reynolds number flows, solved on anisotropic meshes, a coarse space is necessary in order to obtain good performance on more than 100 processors. by Laslo Tibor Diosady. Ph.D. 2012-07-02T15:42:30Z 2012-07-02T15:42:30Z 2011 2012 Thesis http://hdl.handle.net/1721.1/71454 795174739 eng 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 182 p. application/pdf Massachusetts Institute of Technology
spellingShingle Aeronautics and Astronautics.
Diosady, Laslo Tibor
Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title_full Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title_fullStr Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title_full_unstemmed Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title_short Domain decomposition preconditioners for higher-order discontinuous Galerkin discretizations
title_sort domain decomposition preconditioners for higher order discontinuous galerkin discretizations
topic Aeronautics and Astronautics.
url http://hdl.handle.net/1721.1/71454
work_keys_str_mv AT diosadylaslotibor domaindecompositionpreconditionersforhigherorderdiscontinuousgalerkindiscretizations