Premium
A recursive aggregation method for the computation of electromagnetic scattering by randomly distributed particles
Author(s) -
Lu CaiCheng,
Chew Weng Cho
Publication year - 1993
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.4650061315
Subject(s) - conjugate gradient method , derivation of the conjugate gradient method , scattering , conjugate residual method , computation , matrix (chemical analysis) , nonlinear conjugate gradient method , biconjugate gradient method , mathematics , conjugate , algebraic equation , computer science , algorithm , mathematical analysis , physics , gradient descent , nonlinear system , materials science , optics , quantum mechanics , machine learning , artificial neural network , composite material
We develop a new algorithm to expedite the matrix‐vector multiplication in using the conjugate gradient method to solve the linear algebraic equation of scattering by a cluster of particles. We compare this method of solving the scattering problem with two other methods. One is our previously developed method, called recursive aggregate T‐matrix method. The second one is the direct use of the conjugate gradient method. Our new method is shown to have reduced computational complexity as well as memory requirement compared to the use of the conjugate gradient directly to solve the linear algebraic equation of scattering. © 1993 John Wiley & Sons, Inc.