Formulation and comparison of two recursive matrix algorithms for modeling layered diffraction gratings

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors Lifeng Li
Journal/Conference Name Journal of the Optical Society of America A
Paper Category ,
Paper Abstract Two recursive and numerically stable matrix algorithms for modeling layered diffraction gratings, the S-matrix algorithm and the R-matrix algorithm, are systematically presented in a form that is independent of the underlying grating models, geometries, and mountings. Many implementation variants of the algorithms are also presented. Their physical interpretations are given, and their numerical stabilities and efficiencies are discussed in detail. The single most important criterion for achieving unconditional numerical stability with both algorithms is to avoid the exponentially growing functions in every step of the matrix recursion. From the viewpoint of numerical efficiency, the S-matrix algorithm is generally preferred to the R-matrix algorithm, but exceptional cases are noted.
Date of publication 2008
Code Programming Language C++

Copyright Researcher 2022