Abstract
This paper presents an adaptive fast multipole algorithm to accelerate the computation of magnetic fields surrounding current-carrying superconducting volumes. The algorithm is based on a hierarchical tree of cubic cells and vector spherical harmonics are used to approximate the gradient of Green’s function. The derivation of the multipole and local expansion coefficients are presented, including the implementation of these coefficients within FastCap’s multipole algorithm. We demonstrate how the proposed algorithm can be used to calculate the magnetic fields of trapped flux and the magnetic fields surrounding type-II superconducting microstrips and compare the results to analytical solutions. The overall complexity of our multipole algorithm is found empirically to rise linearly, , with N evaluation points.
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.
