Fast boundary methods for magnetostatic interactions in micromagnetics
H Forster, T Schrefl, R Dittrich… - IEEE transactions on …, 2003 - ieeexplore.ieee.org
IEEE transactions on magnetics, 2003•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org