Advanced Search

Massively Parallel Solver for the High-Order Galerkin Least-Squares Method

Research and Teaching Output of the MIT Community

Show simple item record Yano, Masayuki 2010-08-27T20:11:41Z 2010-08-27T20:11:41Z 2009-06
dc.description.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 advectiondiffusion 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 diffusiondominated 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. en
dc.description.sponsorship This work was partially supported by funding from The Boeing Company with technical monitor of Dr. Mori Mani. en
dc.language.iso en_US en
dc.publisher Aerospace Computational Design Laboratory, Dept. of Aeronautics & Astronautics, Massachusetts Institute of Technology en
dc.relation.ispartofseries ACDL Technical Reports;ACDL TR-09-1
dc.title Massively Parallel Solver for the High-Order Galerkin Least-Squares Method en
dc.type Technical Report en

Files in this item

Name Size Format Description
ACDL_TR-09-1.pdf 897.5Kb PDF

This item appears in the following Collection(s)

Show simple item record