@inproceedings{a40972ed92ae44fe9b1b4bd2feec5be8,
title = "Recursive T-matrix algorithms for 1-D and 2-D clusterings of strips",
abstract = "Two recursive T-matrix algorithms were introduced by W.C. Chew (1989) W.C. Chew and Y.M. Wang (1990). In the present work, the authors discuss the application of these algorithms to conducting strip geometries, and analyze the complexities of the algorithms. The two algorithms are shown to have complexities of O(N2P) and O(NP2), where N is the number of unknowns in the problem, and P is the number of terms that satisfies a convergence criterion in the addition theorems for the cylindrical wave functions.",
author = "L. Gurel and Chew, {W. C.}",
year = "1991",
language = "English (US)",
isbn = "0780301447",
series = "AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)",
publisher = "Publ by IEEE",
pages = "276--279",
booktitle = "1991 Digest",
note = "Antennas and Propagation Society Symposium ; Conference date: 24-06-1991 Through 28-06-1991",
}