- Title Information
- Title
- Efficient solvers and preconditioners for the implicit time integration of discontinuous Galerkin methods
- Name:
Personal
- Name Part
- Pazner, Will
- Role
- Role Term:
Text
- creator
- Name:
Personal
- Name Part
- Shu, Chi-Wang
- Role
- Role Term:
Text
- Advisor
- Name:
Personal
- Name Part
- Persson, Per-Olof
- Role
- Role Term:
Text
- Reader
- Name:
Personal
- Name Part
- Guzmán, Johnny
- Role
- Role Term:
Text
- Reader
- Name:
Corporate
- Name Part
- Brown University. Department of Applied Mathematics
- Role
- Role Term:
Text
- sponsor
- Origin Information
- Copyright Date
- 2018
- Physical Description
- Extent
- xv, 214 p.
- digitalOrigin
- born digital
- Note:
thesis
- Thesis (Ph. D.)--Brown University, 2018
- Genre (aat)
- theses
- Abstract
- In this work, we develop and analyze solvers and preconditioners designed for the implicit time integration of discontinuous Galerkin (DG) discretizations. The discontinuous Galerkin method is a high-order accurate finite element method for the numerical solution of partial differential equations on unstructured meshes. The temporal integration of such discretizations by means of implicit methods has the important advantage of avoiding restrictive stability conditions on the size of the time step. Because of the large number of degrees of freedom and potentially poorly-conditioned nature of the resulting algebraic systems of equations, sophisticated solvers and preconditioners are a requirement for good performance.
This thesis focuses on the iterative solution of the resulting linear systems by means of Krylov subspace solvers. We develop and study preconditioners that allow of the efficient use of fully-implicit Runge-Kutta methods, which have previously been considered prohibitively expensive. These methods have the additional advantage that they allow for parallelism in the temporal dimension. Additionally, we develop an implicit tensor-product solver that makes use of a construction known as the Kronecker-product singular value decomposition to obtain asymptotically-improved computational complexities on quadrilateral and hexahedral meshes. Finally, we study the effect of polygonal mesh geometries on the convergence of iterative linear solvers. The applicability of these methods is demonstrated on a wide range of large-scale, two- and three-dimensional test cases.
- Subject
- Topic
- discontinous Gakerkin method
- Subject
- Topic
- preconditioners
- Subject
- Topic
- time integration
- Subject (fast)
(authorityURI="http://id.worldcat.org/fast", valueURI="http://id.worldcat.org/fast/01779319")
- Topic
- Computational science and engineering
- Language
- Language Term (ISO639-2B)
- English
- Record Information
- Record Content Source (marcorg)
- RPB
- Record Creation Date
(encoding="iso8601")
- 20180618
- Identifier:
DOI
- 10.26300/0syb-sb60
- Access Condition:
rights statement
(href="http://rightsstatements.org/vocab/InC/1.0/")
- In Copyright
- Access Condition:
restriction on access
- Collection is open for research.
- Type of Resource (primo)
- dissertations