论文信息 - Fast boundary methods for magnetostatic interactions in micromagnetics - 字舞流文

Fast boundary methods for magnetostatic interactions in micromagnetics

In this paper, we compare a treecode-method as used for particle simulations, hierarchical matrices or so called supermatrices, and the fully populated boundary element matrix.

H. Forster | J. Fidler | R. Dittrich | T. Schrefl | J. Fidler | W. Scholz | H. Forster | T. Schrefl

[1] D. R. Fredkin,et al. Hybrid method for computing demagnetizing fields , 1990 .

[2] Wolfgang Hackbusch,et al. A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices , 1999, Computing.

[3] W. Hackbusch. A Sparse Matrix Arithmetic Based on $\Cal H$-Matrices. Part I: Introduction to ${\Cal H}$-Matrices , 1999, Computing.

[4] Walter Dehnen,et al. A Hierarchical O(N) Force Calculation Algorithm , 2002 .

[5] Stephen L. W. McMillan,et al. An O(N log N) integration scheme for collisional stellar systems , 1993 .

[6] A. Appel. An efficient program for many-body simulations (or, Cray performance from a VAX) , 1983 .

[7] W. Hackbusch. Iterative Solution of Large Sparse Systems of Equations , 1993 .

[8] Stefan Kurz,et al. The adaptive cross-approximation technique for the 3D boundary-element method , 2002 .