Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation
Abstract
A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.
- Authors:
-
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Publication Date:
- Research Org.:
- Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1345322
- Alternate Identifier(s):
- OSTI ID: 1397833
- Report Number(s):
- LLNL-JRNL-703859
Journal ID: ISSN 0021-9991; TRN: US1700926
- Grant/Contract Number:
- AC52-07NA27344
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Journal of Computational Physics
- Additional Journal Information:
- Journal Volume: 335; Journal Issue: C; Journal ID: ISSN 0021-9991
- Publisher:
- Elsevier
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; weighted mesh smoothing; condition number mesh relaxation; r-Refinement; level set; discontinuous Galerkin discretization; ALE method; WENO
Citation Formats
Greene, Patrick T., Schofield, Samuel P., and Nourgaliev, Robert. Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation. United States: N. p., 2017.
Web. doi:10.1016/j.jcp.2017.01.049.
Greene, Patrick T., Schofield, Samuel P., & Nourgaliev, Robert. Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation. United States. https://doi.org/10.1016/j.jcp.2017.01.049
Greene, Patrick T., Schofield, Samuel P., and Nourgaliev, Robert. Fri .
"Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation". United States. https://doi.org/10.1016/j.jcp.2017.01.049. https://www.osti.gov/servlets/purl/1345322.
@article{osti_1345322,
title = {Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation},
author = {Greene, Patrick T. and Schofield, Samuel P. and Nourgaliev, Robert},
abstractNote = {A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.},
doi = {10.1016/j.jcp.2017.01.049},
journal = {Journal of Computational Physics},
number = C,
volume = 335,
place = {United States},
year = {Fri Jan 27 00:00:00 EST 2017},
month = {Fri Jan 27 00:00:00 EST 2017}
}
Web of Science
Works referenced in this record:
An arbitrary Lagrangian-Eulerian computing method for all flow speeds
journal, March 1974
- Hirt, C. W.; Amsden, A. A.; Cook, J. L.
- Journal of Computational Physics, Vol. 14, Issue 3
Reference Jacobian Optimization-Based Rezone Strategies for Arbitrary Lagrangian Eulerian Methods
journal, February 2002
- Knupp, Patrick; Margolin, Len G.; Shashkov, Mikhail
- Journal of Computational Physics, Vol. 176, Issue 1
Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part I?a framework for surface mesh optimization
journal, May 2000
- Knupp, Patrick M.
- International Journal for Numerical Methods in Engineering, Vol. 48, Issue 3
Achieving finite element mesh quality via optimization of the Jacobian matrix norm and associated quantities. Part II?A framework for volume mesh optimization and the condition number of the Jacobian matrix
journal, July 2000
- Knupp, Patrick M.
- International Journal for Numerical Methods in Engineering, Vol. 48, Issue 8
A Framework for Variational Grid Generation: Conditioning the Jacobian Matrix with Matrix Norms
journal, January 2000
- Knupp, Patrick M.; Robidoux, Nicolas
- SIAM Journal on Scientific Computing, Vol. 21, Issue 6
Discretizations for weighted condition number smoothing on general unstructured meshes
journal, July 2011
- Váchal, P.; Maire, P. -H.
- Computers & Fluids, Vol. 46, Issue 1
A discontinuous Galerkin method based on a Taylor basis for the compressible flows on arbitrary grids
journal, October 2008
- Luo, Hong; Baum, Joseph D.; Löhner, Rainald
- Journal of Computational Physics, Vol. 227, Issue 20
A Hermite WENO reconstruction-based discontinuous Galerkin method for the Euler equations on tetrahedral grids
journal, June 2012
- Luo, Hong; Xia, Yidong; Li, Shujie
- Journal of Computational Physics, Vol. 231, Issue 16
A reconstructed discontinuous Galerkin method based on a Hierarchical WENO reconstruction for compressible flows on tetrahedral grids
journal, March 2013
- Luo, Hong; Xia, Yidong; Spiegel, Seth
- Journal of Computational Physics, Vol. 236
A unified framework for the construction of one-step finite volume and discontinuous Galerkin schemes on unstructured meshes
journal, September 2008
- Dumbser, Michael; Balsara, Dinshaw S.; Toro, Eleuterio F.
- Journal of Computational Physics, Vol. 227, Issue 18
Arbitrary high order PNPM schemes on unstructured meshes for the compressible Navier–Stokes equations
journal, January 2010
- Dumbser, Michael
- Computers & Fluids, Vol. 39, Issue 1
A Level Set Approach for Computing Solutions to Incompressible Two-Phase Flow
journal, September 1994
- Sussman, Mark; Smereka, Peter; Osher, Stanley
- Journal of Computational Physics, Vol. 114, Issue 1
A fast marching level set method for monotonically advancing fronts.
journal, February 1996
- Sethian, J. A.
- Proceedings of the National Academy of Sciences, Vol. 93, Issue 4
Volume of fluid (VOF) method for the dynamics of free boundaries
journal, January 1981
- Hirt, C. W.; Nichols, B. D.
- Journal of Computational Physics, Vol. 39, Issue 1
A Fast Level Set Method for Propagating Interfaces
journal, May 1995
- Adalsteinsson, David; Sethian, James A.
- Journal of Computational Physics, Vol. 118, Issue 2