H-matrix techniques for stray-field computations in computational micromagnetics

N Popovic*, D Praetorius

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

A major task in the simulation of micromagnetic phenomena is the effective computation of the stray-field H and/or of the corresponding energy, where H solves the magnetostatic Maxwell equations in the entire space. For a given FE magnetization M-h, the naive computation of H via a closed formula typically leads to dense matrices and quadratic complexity with respect to the number N of elements. To reduce the computational cost, it is proposed to apply H-matrix techniques instead. This approach allows for the computation (and evaluation) of H in linear complexity even on adaptively generated (or unstructured) meshes.

Original languageEnglish
Title of host publicationLARGE-SCALE SCIENTIFIC COMPUTING
Editors Lirkov, S Margenov, J Wasniewski
PublisherSpringer-Verlag Berlin Heidelberg
Pages102-110
Number of pages9
ISBN (Print)3-540-31994-8
Publication statusPublished - 2006
Event5th International Conference on Large-Scale Scientific Computing (LSSC 2005) - Sozopol, Bulgaria
Duration: 6 Jun 200510 Jun 2005

Publication series

NameLECTURE NOTES IN COMPUTER SCIENCE
PublisherSPRINGER-VERLAG BERLIN
Volume3743
ISSN (Print)0302-9743

Conference

Conference5th International Conference on Large-Scale Scientific Computing (LSSC 2005)
Country/TerritoryBulgaria
Period6/06/0510/06/05

Keywords

  • INTEGRAL-OPERATORS
  • MACROSCOPIC MODEL
  • APPROXIMATION
  • INTERPOLATION

Fingerprint

Dive into the research topics of 'H-matrix techniques for stray-field computations in computational micromagnetics'. Together they form a unique fingerprint.

Cite this