Topological optimization in 3D-magnetostatics: development of adjoint methods using the equations of magnetic moments.

Purpose: The purpose of this paper is mainly to develop the adjoint method within the method of magnetic moment (MMM) and thus, to provide an efficient new way to solve topology optimization problems in magnetostatic to design 3D-magnetic circuits. Design/methodology/approach: First, the MMM is recalled and the optimization design problem is reformulated as a partial derivative equation-constrained optimization problem where the constraint is the Maxwell equation in magnetostatic. From the Karush–Khun–Tucker optimality conditions, a new problem is derived which depends on a Lagrangian parameter. This problem is called the adjoint problem and the Lagrangian parameter is called the adjoint parameter. Thus, solving the direct and the adjoint problems, the values of the objective function as well as its gradient can be efficiently obtained. To obtain a topology optimization code, a semi isotropic material with penalization (SIMP) relaxed-penalization approach associated with an optimization based on gradient descent steps has been developed and used. Findings: In this paper, the authors provide theoretical results which make it possible to compute the gradient via the continuous adjoint of the MMMs. A code was developed and it was validated by comparing it with a finite difference method. Thus, a topology optimization code associating this adjoint based gradient computations and SIMP penalization technique was developed and its efficiency was shown by solving a 3D design problem in magnetostatic. Research limitations/implications: This research is limited to the design of systems in magnetostatic using the linearity of the materials. The simple examples, the authors provided, are just done to validate our theoretical results and some extensions of our topology optimization code have to be done to solve more interesting design cases. Originality/value: The problem of design is a 3D magnetic circuit. The 2D optimization problems are well known and several methods of resolution have been introduced, but rare are the problems using the adjoint method in 3D. Moreover, the association with the MMMs has never been treated yet. The authors show in this paper that this association could provide gains in CPU time. [ABSTRACT FROM AUTHOR]