Abstract
The unconditionally stable solution of time-domain integral equations by the classical marching-on-in-order schemes demands O(N t 3N s 2) CPU cycles, where N t and N s are the number of temporal and spatial unknowns, respectively. Discrete fast Fourier transform (FFT)-based algorithms are proffered to expedite the recursive temporal convolution products of the Toeplitz block aggregates of the retarded interaction matrices through which the overall computational cost and memory requirements reduces to O(α(N s )N t log(N t )) and O(N t α(N s )), respectively. Simulation results for arbitrarily shaped scatterers demonstrate the accuracy and efficiency of the technique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
