Abstract
AbstractWe 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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
