Efficient Matching Boundary Conditions of Two-dimensional Honeycomb Lattice for Atomic Simulations
Abstract: In this paper, we design a series of matching boundary conditions for a two-dimensional compound honeycomb lattice, which has an explicit and simple form, high computing efficiency and good effectiveness of suppressing boundary reflections. First, we formulate the dynamic equations and calculate the dispersion relation for the harmonic honeycomb lattice, then symmetrically choose specific atoms near the boundary to design different forms of matching boundary conditions. The boundary coefficients are determined by matching a residual function at some selected wavenumbers. Several atomic simulations are performed to test the effectiveness of matching boundary conditions in the example of a harmonic honeycomb lattice and a nonlinear honeycomb lattice with the FPU-$\beta$ potential. Numerical results illustrate that low-order matching boundary conditions mainly treat long waves, while the high-order matching boundary conditions can efficiently suppress short waves and long waves simultaneously. Decaying kinetic energy curves indicate the stability of matching boundary conditions in numerical simulations.
- G. Pang and S. Tang, Time history kernel functions for square lattice. Comput. Mech. 48 (2011) 699-711.
- C. Zheng, A perfectly matched layer approach to the nonlinear Schrödinger wave equations. J. Comput. Phys. 227(1) (2007) 537-556.
- X. Li and W. E, Variational boundary conditions for molecular dynamics simulations of crystalline solids at finite temperature: treatment of the thermal bath. Phys. Rev. B 76(10) (2007) 104107.
- G. Pang and S. Tang, Approximate linear relations for Bessel functions. Commun. Math. Sci. 15(7) (2017) 1967-1986.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
