Abstract
One of the most important mathematical formulas in fast multipole algorithms (FMA) is the addition theorem. In the numerical implementation of the addition theorem, the infinite series should be truncated. In this paper, the number of terms needed for the scalar Green's function is derived, and the error analysis for the truncation error in the multipole expansion of the vector Green's functions is given. We have found that the error term in vector Green's functions is proportional to 1/R. If the scalar Green's function is truncated at the L-th term and the relative error is /spl epsiv/, then the relative error in the dyadic Green's function is /spl epsiv//4, if it is truncated at the (L+2)-th term. For the vector Green's function related to MFIE, the relative error is /spl epsiv//2 if it is truncated at the (L+1)-th term.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.