Search results

The purpose of this paper is to present a new approach to optimizing the design of 3D magnetic circuits. This approach is based on topology optimization, where derivative calculations are performed using the continuous adjoint method. Thus, the continuous adjoint method for magnetostatics has to be developed in 3D and has to be combined with penalization, filtering and homotopy approaches to provide an efficient optimization code.

To provide this new topology optimization code, this study starts from 2D magnetostatic results to perform the sensitivity analysis, and this approach is extended to 3D. From this sensitivity analysis, the continuous adjoint method is derived to compute the gradient of an objective function of a 3D topological optimization design problem. From this result, this design problem is discretized and can then be solved by finite element software. Thus, by adding the solid isotropic material with penalization (SIMP) penalization approach and developing a homotopy-based optimization algorithm, an interesting means for designing 3D magnetic circuits is provided.

In this paper, the 3D continuous adjoint method for magnetostatic problems involving an objective least-squares function is presented. Based on 2D results, new theoretical results for developing sensitivity analysis in 3D taking into account different parameters including the ferromagnetic material, the current density and the magnetization are provided. Then, by discretizing, filtering and penalizing using SIMP approaches, a topology optimization code has been derived to address only the ferromagnetic material parameters. Based on this efficient gradient computation method, a homotopy-based optimization algorithm for solving large-scale 3D design problems is developed.

In this paper, an approach based on topology optimization to solve 3D magnetostatic design problems when an objective least-squares function is involved is proposed. This approach is based on the continuous adjoint method derived for 3D magnetostatic design problems. The effectiveness of this topology optimization code is demonstrated by solving the design of a 3D magnetic circuit with up to 100,000 design variables.

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.

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.

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.

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.

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.

Performing accurate numerical simulations of electrical drives, the precise knowledge of the local magnetic material properties is of utmost importance. Due to the various manufacturing steps, e.g. heat treatment or cutting techniques, the magnetic material properties can strongly vary locally, and the assumption of homogenized global material parameters is no longer feasible. This paper aims to present the general methodology and two different solution strategies for determining the local magnetic material properties using reference and simulation data.

The general methodology combines methods based on measurement, numerical simulation and solving an inverse problem. Therefore, a sensor-actuator system is used to characterize electrical steel sheets locally. Based on the measurement data and results from the finite element simulation, the inverse problem is solved with two different solution strategies. The first one is a quasi Newton method (QNM) using Broyden's update formula to approximate the Jacobian and the second is an adjoint method. For comparison of both methods regarding convergence and efficiency, an artificial example with a linear material model is considered.

The QNM and the adjoint method show similar convergence behavior for two different cutting-edge effects. Furthermore, considering a priori information improved the convergence rate. However, no impact on the stability and the remaining error is observed.

The presented methodology enables a fast and simple determination of the local magnetic material properties of electrical steel sheets without the need for a large number of samples or special preparation procedures.

Topology optimization of structures under self-weight loading is a challenging problem which has received increasing attention in the past years. The use of standard formulations based on compliance minimization under volume constraint suffers from numerous difficulties for self-weight dominant scenarios, such as non-monotonic behaviour of the compliance, possible unconstrained character of the optimum and parasitic effects for low densities in density-based approaches. This paper aims to propose an alternative approach for dealing with topology design optimization of structures into three spatial dimensions subject to self-weight loading.

In order to overcome the above first two issues, a regularized formulation of the classical compliance minimization problem under volume constraint is adopted, which enjoys two important features: (a) it allows for imposing any feasible volume constraint and (b) the standard (original) formulation is recovered once the regularizing parameter vanishes. The resulting topology optimization problem is solved with the help of the topological derivative method, which naturally overcomes the above last issue since no intermediate densities (grey-scale) approach is necessary.

A novel and simple approach for dealing with topology design optimization of structures into three spatial dimensions subject to self-weight loading is proposed. A set of benchmark examples is presented, showing not only the effectiveness of the proposed approach but also highlighting the role of the self-weight loading in the final design, which are: (1) a bridge structure is subject to pure self-weight loading; (2) a truss-like structure is submitted to an external horizontal force (free of self-weight loading) and also to the combination of self-weight and the external horizontal loading; and (3) a tower structure is under dominant self-weight loading.

An alternative regularized formulation of the compliance minimization problem that naturally overcomes the difficulties of dealing with self-weight dominant scenarios; a rigorous derivation of the associated topological derivative; computational aspects of a simple FreeFEM implementation; and three-dimensional numerical benchmarks of bridge, truss-like and tower structures.

The primary objective of this study is to tackle the enduring challenge of preserving feature integrity during the manipulation of geometric data in computer graphics. Our work aims to introduce and validate a variational sparse diffusion model that enhances the capability to maintain the definition of sharp features within meshes throughout complex processing tasks such as segmentation and repair.

We developed a variational sparse diffusion model that integrates a high-order L₁ regularization framework with Dirichlet boundary constraints, specifically designed to preserve edge definition. This model employs an innovative vertex updating strategy that optimizes the quality of mesh repairs. We leverage the augmented Lagrangian method to address the computational challenges inherent in this approach, enabling effective management of the trade-off between diffusion strength and feature preservation. Our methodology involves a detailed analysis of segmentation and repair processes, focusing on maintaining the acuity of features on triangulated surfaces.

Our findings indicate that the proposed variational sparse diffusion model significantly outperforms traditional smooth diffusion methods in preserving sharp features during mesh processing. The model ensures the delineation of clear boundaries in mesh segmentation and achieves high-fidelity restoration of deteriorated meshes in repair tasks. The innovative vertex updating strategy within the model contributes to enhanced mesh quality post-repair. Empirical evaluations demonstrate that our approach maintains the integrity of original, sharp features more effectively, especially in complex geometries with intricate detail.

The originality of this research lies in the novel application of a high-order L₁ regularization framework to the field of mesh processing, a method not conventionally applied in this context. The value of our work is in providing a robust solution to the problem of feature degradation during the mesh manipulation process. Our model’s unique vertex updating strategy and the use of the augmented Lagrangian method for optimization are distinctive contributions that enhance the state-of-the-art in geometry processing. The empirical success of our model in preserving features during mesh segmentation and repair presents an advancement in computer graphics, offering practical benefits to both academic research and industry applications.