TY - JOUR
T1 - An Explicit Implicit Scheme for Cut Cells in Embedded Boundary Meshes
AU - May, Sandra
AU - Berger, Marsha
N1 - Funding Information:
The authors would like to thank Ann Almgren, John Bell, and Andy Nonaka from Lawrence Berkeley National Laboratory for providing and helping the authors with the software packages BoxLib and VarDen, as well as for helpful discussions. This work was supported in part by the DOE office of Advanced Scientific Computing under Grant DE-FG02-88ER25053 and by AFOSR Grant FA9550-13-1-0052 as well as by ERC STG. N 306279, SPARCCLE.
Publisher Copyright:
© 2016, Springer Science+Business Media New York.
PY - 2017/6/1
Y1 - 2017/6/1
N2 - We present a new mixed explicit implicit time stepping scheme for solving the linear advection equation on a Cartesian cut cell mesh. We use a standard second-order explicit scheme on Cartesian cells away from the embedded boundary. On cut cells, we use an implicit scheme for stability. This approach overcomes the small cell problem—that standard schemes are not stable on the arbitrarily small cut cells—while keeping the cost fairly low. We examine several approaches for coupling the schemes in one dimension. For one of them, which we refer to as flux bounding, we can show a TVD result for using a first-order implicit scheme. We also describe a mixed scheme using a second-order implicit scheme and combine both mixed schemes by an FCT approach to retain monotonicity. In the second part of this paper, extensions of the second-order mixed scheme to two and three dimensions are discussed and the corresponding numerical results are presented. These indicate that this mixed scheme is second-order accurate in L1 and between first- and second-order accurate along the embedded boundary in two and three dimensions.
AB - We present a new mixed explicit implicit time stepping scheme for solving the linear advection equation on a Cartesian cut cell mesh. We use a standard second-order explicit scheme on Cartesian cells away from the embedded boundary. On cut cells, we use an implicit scheme for stability. This approach overcomes the small cell problem—that standard schemes are not stable on the arbitrarily small cut cells—while keeping the cost fairly low. We examine several approaches for coupling the schemes in one dimension. For one of them, which we refer to as flux bounding, we can show a TVD result for using a first-order implicit scheme. We also describe a mixed scheme using a second-order implicit scheme and combine both mixed schemes by an FCT approach to retain monotonicity. In the second part of this paper, extensions of the second-order mixed scheme to two and three dimensions are discussed and the corresponding numerical results are presented. These indicate that this mixed scheme is second-order accurate in L1 and between first- and second-order accurate along the embedded boundary in two and three dimensions.
KW - Cartesian cut cell method
KW - Embedded boundary grid
KW - Explicit implicit scheme
KW - Finite volume scheme
KW - Small cell problem
UR - http://www.scopus.com/inward/record.url?scp=85001090515&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85001090515&partnerID=8YFLogxK
U2 - 10.1007/s10915-016-0326-2
DO - 10.1007/s10915-016-0326-2
M3 - Article
AN - SCOPUS:85001090515
SN - 0885-7474
VL - 71
SP - 919
EP - 943
JO - Journal of Scientific Computing
JF - Journal of Scientific Computing
IS - 3
ER -