A fast finite-difference algorithm for topology optimization of permanent magnets
Claas Abert, Christian Huber, Florian Bruckner, Christoph Vogler,, Gregor Wautischer, and Dieter Suess

TL;DR
This paper introduces a fast finite-difference algorithm utilizing FFT for topology optimization of permanent magnets, offering improved performance and accuracy over existing finite-element methods.
Contribution
The paper presents a novel finite-difference approach with FFT acceleration for topology optimization of permanent magnets, enhancing speed, accuracy, and implementation simplicity.
Findings
Superior performance compared to finite-element methods
High accuracy in stray-field computation
Flexible and easy to implement
Abstract
We present a finite-difference method for the topology optimization of permanent magnets that is based on the FFT accelerated computation of the stray-field. The presented method employs the density approach for topology optimization and uses an adjoint method for the gradient computation. Comparsion to various state-of-the-art finite-element implementations shows a superior performance and accuracy. Moreover, the presented method is very flexible and easy to implement due to various preexisting FFT stray-field implementations that can be used.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
