Abstract
A set of full-matrix recursion formulas for the variant of the S-matrix algorithm is derived, which includes the recent results of some other authors as a subset. In addition, a special type of symmetry that is often found in the structure of coefficient matrices (W matrices) that appear in boundary-matching conditions is identified and fully exploited for the purpose of increasing computation efficiency. Two tables of floating-point operation (flop) counts for both the new variant and the old variant of the S-matrix algorithm are given. Comparisons of flop counts show that in performing S-matrix recursions in the absence of the symmetry, it is more efficient to go directly from W matrices to S matrices. In the presence of the symmetry, however, using t matrices is equally and sometimes more advantageous, provided that the symmetry is utilized.
© 2003 Optical Society of America
Full Article | PDF ArticleMore Like This
Lifeng Li
J. Opt. Soc. Am. A 13(5) 1024-1035 (1996)
Eng Leong Tan
Appl. Opt. 45(20) 4803-4809 (2006)
Eng Leong Tan
J. Opt. Soc. Am. A 19(6) 1157-1161 (2002)