Abstract
Fast boundary integration methods are implemented to increase the efficiency of the calculation of the magnetostatic interaction of magnetic particles. We test the treecode algorithm and a hierarchical matrices method to improve the original used matrix-vector multiplication with a fully populated matrix. We compare the CPU-time used for the setup phase and for the matrix-vector multiplication, as well as the required storage.
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.
