## Abstract

A fast recursive algorithm has been developed to solve for the scattering solution of a large 2‐D inhomogeneous body for TM waves. The inhomogeneous body is first divided into N subscatterers. The algorithm uses an aggregate T̄ matrix and translation formulas to solve for the solution of n + 1 subscatterers from the solution for n subscatterers. The computational complexity of the algorithm is of O(NMP^{2}), where NM is the number of unknowns and P is the number of harmonies required in the translation formulas. The memory requirement is proportional to the number of unknowns. The algorithm has been used to solve for the scattering solution of a 10‐λ‐diameter two‐dimensional scatterer with about 12,000 unknowns, taking about 30 s on a CRAY‐2 supercomputer.

Original language | English (US) |
---|---|

Pages (from-to) | 155-157 |

Number of pages | 3 |

Journal | Microwave and Optical Technology Letters |

Volume | 4 |

Issue number | 4 |

DOIs | |

State | Published - Mar 1991 |

Externally published | Yes |

## Keywords

- Recursive algorithm
- inhomogeneous scatterer
- numerical methods

## ASJC Scopus subject areas

- Electronic, Optical and Magnetic Materials
- Atomic and Molecular Physics, and Optics
- Condensed Matter Physics
- Electrical and Electronic Engineering