Universally applicable uniaxial perfect matched layer formulation for explicit and implicit finite difference time domain algorithms

An important advance in the finite difference time domain (FDTD) algorithms is Berenger´s perfect matched layer (PML), along with its derivatives. In recent years several new explicit and implicit FDTD algorithms have appeared on the scene, of which each requires a specific PML. To simplify programming, the authors derive a universal uniaxial PML formulation, which is universally applicable to the Yee FDTD, FDTD with higher-order stencils and implicit FDTD algorithms. Numerical results show the efficiency and versatility of the new method.