Reduced runtime complexity for circular/Hankel Hadamard matrix multiplication applied to the spectral projection model for electromagnetic scattering: a thesis in Electrical Engineering

Read full text Summarise with VIRAT
Authors: Christopher Brunette
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Electromagnetic scattering for various geometrical constructs is often modeled with the aid of specialized electromagnetic simulation software. Currently, the Method of Moments is one of the most used methods for analysis of scattering. However, this method has a more computationally efficient alternative known as the Spectral Projection Model (SPM). The SPM takes the kernel for the Electric Field Integral Equation and decomposes it into a projection of the spectral signature of a source point onto an observation point. This is possible using Graf’s Addition Theorem (GAT) for the Bessel and Hankel functions. Showing that GAT can be represented as a Hadamard product in the Fourier domain requires the computation of the inverse of the Circular/Hankel Hadamard Product for elliptical cross sections. In MATLAB, an algorithmic approach is employed to compute the inverse of each submatrix and construct the inverse based on these submatrices. This approach yields an inversion time complexity of O(N2.75) as an alternative to the O(N3) time complexity of a standard matrix inversion.

Fields of Study & Subjects

Electromagnetic Scattering and Analysis Matrix Theory and Algorithms Electromagnetic Simulation and Numerical Methods

Publication details

Publication date
1 January 2026
Language
EN
Document type
Thesis