Higher order stray field computation on tensor product domains

Read full text
Authors: Lukas Exl, Sebastian Schaffer
Cited by: 0
References: 48

Abstract

We present an extension of the tensor grid method for stray field computation on rectangular domains that incorporates higher-order basis functions. Both the magnetization and the resulting magnetic field are represented using higher-order B-spline bases, which allow for increased accuracy and smoothness. The method employs a super-potential formulation, which circumvents the need to convolve with a singular kernel. The field is represented with high accuracy as a functional Tucker tensor, leveraging separable expansions on the tensor product domain and trained via a multilinear extension of the extreme learning machine methodology. Unlike conventional grid-based methods, the proposed mesh-free approach allows for continuous field evaluation. Numerical experiments confirm the accuracy and efficiency of the proposed method, demonstrating exponential convergence of the energy and linear computational scaling with respect to the multilinear expansion rank.

Fields of Study & Subjects

Electromagnetic Scattering and Analysis Matrix Theory and Algorithms Tensor decomposition and applications

Publication details

Journal / source
Journal of Computational Physics
Volume
550
Pages
114652–114652
Publication date
6 January 2026
Language
EN