Fast stray field computation on tensor grids
By Lukas Exl, W. Auzinger, S. Bance, M. Gusenbauer, F. Reichel, Thomas Schrefl. 2011
28 citations recorded by the source corpus.
A direct integration algorithm is described to compute the magnetostatic field and energy for given magnetization distributions on not necessarily uniform tensor grids. We use an analytically-based tensor approximation approach for function-related tensors, which reduces calculations to multilinear algebra operations. The algorithm scales with N4/3 for N computational cells used and with N2/3 (sublinear) when magnetization is given in canonical tensor format. In the final section we confirm our theoretical results concerning computing times and accuracy by means of numerical examples.
Subfields: Computational Mathematics, Computational Theory and Mathematics, Hardware and Architecture
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mathematics
In Computational Theory and Mathematics
In Hardware and Architecture
Citations in the corpus
- A literature survey of low‐rank tensor approximation techniques (2013, neutral): “• computational tasks in micromagnetics [81, 82];”
- FFT-based Kronecker product approximation to micromagnetic long-range interactions (2012, methodology): “Also compare with [11].”