A GPU-accelerated adaptive discontinuous Galerkin method for level set equation

Date

2016-01-02

Author

KARAKUS, A.
WARBURTON, T.
AKSEL, MEHMET HALUK
Sert, Cüneyt

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

82
views

0
downloads

This paper presents a GPU-accelerated nodal discontinuous Galerkin method for the solution of two- and three-dimensional level set (LS) equation on unstructured adaptive meshes. Using adaptive mesh refinement, computations are localised mostly near the interface location to reduce the computational cost. Small global time step size resulting from the local adaptivity is avoided by local time-stepping based on a multi-rate Adams-Bashforth scheme. Platform independence of the solver is achieved with an extensible multi-threading programming API that allows runtime selection of different computing devices (GPU and CPU) and different threading interfaces (CUDA, OpenCL and OpenMP). Overall, a highly scalable, accurate and mass conservative numerical scheme that preserves the simplicity of LS formulation is obtained. Efficiency, performance and local high-order accuracy of the method are demonstrated through distinct numerical test cases.

Subject Keywords

Local time-stepping, GPU computing, Adaptive mesh refinement, Level set, Discontinuous Galerkin

URI

https://hdl.handle.net/11511/35798

Journal

INTERNATIONAL JOURNAL OF COMPUTATIONAL FLUID DYNAMICS

DOI

https://doi.org/10.1080/10618562.2016.1155704

Collections

Department of Mechanical Engineering, Article

Suggestions

OpenMETU
Core

A stagnation-aware cooperative parallel breakout local search algorithm for the quadratic assignment problem Aksan, Yagmur; Dokeroglu, Tansel; Coşar, Ahmet (2017-01-01) The Quadratic Assignment Problem (QAP) is one of the most challenging NP-Hard combinatorial optimization problems. Circuit-layout design, transportation/traffic engineering, and assigning gates to airplanes are some of the interesting applications of the QAP. In this study, we introduce an enhanced version of a recent local search heuristic, Breakout Local Search Algorithm (BLS), by using the Levenshtein Distance metric for checking the similarity of the new starting points to previously explored QAP permut...
A two-level variational multiscale method for convection-dominated convection-diffusion equations Volker, John; Kaya Merdan, Songül; Layton, William (2006-01-01) This paper studies the error in, the efficient implementation of and time stepping methods for a variational multiscale method (VMS) for solving convection-dominated problems. The VMS studied uses a fine mesh C-O finite element space X-h to approximate the concentration and a coarse mesh discontinuous vector finite element space L-H for the large scales of the flux in the two scale discretization. Our tests show that these choices lead to an efficient VMS whose complexity is further reduced if a (locally) L...
A Novel Alternating Cell Directions Implicit Method for the Solution of Incompressible Navier Stokes Equations on Unstructured Grids Bas, O.; ÇETE, ALİ RUHŞEN; Mengi, S.; Tuncer, İsmail Hakkı; Kaynak, U. (2017-01-01) In this paper, A Novel Alternating Cell Direction Implicit Method (ACDI) is researched which allows implementation of fast line implicit methods on quadrilateral unstructured meshes. In ACDI method, designated alternating cell directions are taken along a series of contiguous cells within the unstructured grid domain and used as implicit lines similar to Line Gauss Seidel Method (LGS). ACDI method applied earlier for the solution of potential flows is extended for the solution of the incompressible Navier-S...
A local discontinuous Galerkin method for Dirichlet boundary control problems Yücel, Hamdullah (null; 2018-10-20) In this paper, we consider Dirichlet boundary control of a convection-diffusion equation with L 2 4 – 5 boundary controls subject to pointwise bounds on the control posed on a two dimensional convex polygonal domain. 6 We use the local discontinuous Galerkin method as a discretization method. We derive a priori error estimates for 7 the approximation of the Dirichlet boundary control problem on a polygonal domain. Several numerical results are 8 provided to illustrate the theoretical results.
A discontinuous subgrid eddy viscosity method for the time-dependent Navier-Stokes equations Kaya Merdan, Songül (Society for Industrial & Applied Mathematics (SIAM), 2005-01-01) In this paper we provide an error analysis of a subgrid scale eddy viscosity method using discontinuous polynomial approximations for the numerical solution of the incompressible Navier-Stokes equations. Optimal continuous in time error estimates of the velocity are derived. The analysis is completed with some error estimates for two fully discrete schemes, which are first and second order in time, respectively.

Citation Formats

A. KARAKUS, T. WARBURTON, M. H. AKSEL, and C. Sert, “A GPU-accelerated adaptive discontinuous Galerkin method for level set equation,” INTERNATIONAL JOURNAL OF COMPUTATIONAL FLUID DYNAMICS, pp. 56–68, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35798.