Premium
A sparse‐matrix canonical‐grid method for scattering by many scatterers
Author(s) -
Chan C. H.,
Tsang L.
Publication year - 1995
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.4650080217
Subject(s) - fast fourier transform , grid , decomposition , matrix (chemical analysis) , computer science , central processing unit , translation (biology) , computational science , sparse matrix , matrix decomposition , algorithm , parallel computing , mathematics , physics , quantum mechanics , materials science , geometry , computer hardware , chemistry , biochemistry , organic chemistry , eigenvalues and eigenvectors , messenger rna , composite material , gene , gaussian
A new efficient algorithm based on the decomposition of strong and weak interactions among scatterers is proposed. The weak interactions, which account for the majority of the required CPU time and memory, are calculated using a canonical grid with a translation addition theorem. This facilitates the use of FFT and results in an N log N‐type efficiency for CPU and O(N) for memory.