Abstract
With the recent growth of interest in the finite difference time domain mehtod for the analysis of structures with open boundaries, much investigation is taking place into the use of absorbing boundary algorithms. Most analyses so far have not, however, taken account of finite discretisation. In the Letter, the properties of several popular absorbing boundary conditions are compared, and it is show that, although for mally identical when discretisation is not considered, differences in performance exist when realistic unit cells sizes are used. The best algorithm for general cases is identified.

This publication has 0 references indexed in Scilit: