On the complexity of aperiodic Fourier modal methods for finite periodic structures

• Published in: Journal of computational physics Vol. 261; pp. 130 - 144
• Main Authors: Pisarenco, M., Setija, I.D.
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 15-03-2014
• Subjects: AFMM-CFF; Alternative discretization; Aperiodic Fourier-modal method; Complexity; Computational costs; Computational efficiency; Discretization; Electromagnetic fields; FMM; Fourier analysis; Fourier-modal method; Logarithmic complexity; Mathematical analysis; Perfectly matched layers; Periodic structures; PML; RCWA; Rigorous coupled-wave analysis; Aperiodic Fourier-modal method; Computational costs; AFMM-CFF; FMM; Alternative discretization; Logarithmic complexity; Fourier-modal method; Perfectly matched layers; Rigorous coupled-wave analysis; RCWA; PML
• ISSN: 0021-9991; 1090-2716
• DOI: 10.1016/j.jcp.2013.12.051

The Fourier modal method (FMM) is based on Fourier expansions of the electromagnetic field and is inherently built for infinitely periodic structures. When the infinite periodicity assumption is not realistic, the finiteness of the structure has to be incorporated into the model. In this paper we discuss the recent extensions of the FMM for finite periodic structures and analyze their complexity both with respect to the main discretization parameter Nˆ as well as with respect to the number of periods R. We show that among the three FMM-based approaches able to represent finiteness, the aperiodic Fourier modal method with alternative discretization has the lowest computational cost given by either O(Nˆ3log2R) or O(Nˆ2R) depending on the values of Nˆ and R. This result demonstrates that the method is highly suited for rigorous modeling of scattering from large periodic structures. For instance, for Nˆ=100 and R<1000 the complexity of the aperiodic Fourier modal method with alternative discretization is comparable to the complexity of the standard FMM.