Search

This contribution addresses the exploitation of mirror symmetry (formally, the abelian D1 and D2 dihedral symmetry groups) in various integral formulations for eddy current problems. The novelty of the contribution is in particular how to rigorously treat non-simply-connected conductors when computing the first cohomology group generators on the symmetry cell of the problem only. [ABSTRACT FROM AUTHOR]

This contribution addresses the solution of eddy-current problems by means of a volume integral formulation based on the electric vector potential on a computational domain that exhibits a cyclic symmetry. Even if grids discretizing the domain are typically composed of tetrahedral or hexahedral elements, the proposed approach also works for general polyhedral meshes, such as those ones obtained by subgridding. In this article, an algorithm to compute a set of suitable cohomology generators needed when the conductors are not simply connected is introduced first. Besides being purely combinatorial, with linear-time worst case complexity and suitable with polyhedral meshes, it reuses a code that computes generators for triangular surface meshes, with obvious advantages concerning the implementation effort. Second, the formulation and the algorithm for cohomology computation are tweaked to be able to solve eddy-current problems with cyclic symmetry reserving specific attention to the construction of suitable tree–cotree decomposition for the problem gauging. [ABSTRACT FROM AUTHOR]

There are two ways of solving eddy current problems with an edge element $h$ -conforming formulation in the case of non-simply-connected conductors: first employs a “fake” artificial conductivity in part of the insulator. Second uses the cohomology theory to define a scalar magnetic potential in the whole insulator. This contribution provides, for the first time, a thorough comparison between these methods. We concentrate on the accuracy and computational effort required to solve a problem using both of the two methods. [ABSTRACT FROM AUTHOR]

This contribution addresses the exploitation of cyclic symmetry in boundary integral formulations for eddy current problems formulated with a magnetic scalar potential. The novelty of the contribution is how to rigorously treat non-simply connected conductors. In particular, a general algorithm to compute a set of suitable cohomology generators is introduced. The algorithm is purely combinatorial and exhibits a linear-time worst-case complexity. [ABSTRACT FROM AUTHOR]

We present an effective technique to solve eddy current problems on the conductors of arbitrary topology by an iterative geometric formulation suitable for an arbitrary polyhedral mesh. The formulation is based on the reformulation of the volume integral formulation in a form suitable to be solved by fixed point iterations. Given that nowadays, the computation of Biot–Savart fields can be performed efficiently on graphics processing units, the right-hand side of the systems is constructed at each fixed point iteration without computing the inductance matrix, which is fully populated. The proposed technique is useful in eddy current problems at industrial frequency where meshing the complement of conductors is hard, thus representing a sound alternative to integral formulations. [ABSTRACT FROM AUTHOR]

Solving eddy current problems formulated by using a magnetic scalar potential in the insulator requires a topological pre-processing to find the so-called first cohomology basis of the insulating region, which may be very time-consuming for challenging industrially driven problems. The physics-inspired Dłotko–Specogna (DS) algorithm was shown to be superior to alternatives in performing such a topological pre-processing. Yet, the DS algorithm is particularly fast when it produces as output not a regular cohomology basis but a so-called lazy one, which contains the regular one but it keeps also some additional redundant elements. Having a regular basis may be advantageous over the lazy basis if a technique to produce it would take about the same time as the computation of a lazy basis. In the literature, such a technique is missing. This paper covers this gap by introducing modifications to the DS algorithm to compute a regular basis of the first cohomology group in practically the same time as the generation of a lazy cohomology basis. The speedup of this modified DS algorithm with respect to the best alternative reaches more than two orders of magnitudes on challenging benchmark problems. This demonstrates the potential impact of the proposed contribution in the low-frequency computational electromagnetics community and beyond. [ABSTRACT FROM AUTHOR]

Integral formulations are attractive for solving eddy-current problems in complex electromagnetic systems, since they do not require the discretization of the complement of the conducting structures. This paper addresses the coupling of volume-integral and surface-integral formulations for eddy-current problems on general star-shaped polyhedral and polygonal meshes. [ABSTRACT FROM AUTHOR]

This paper presents a volume integral formulation to solve eddy current problems on general polyhedral meshes. The required topological preprocessing is efficiently addressed in linear worst case complexity by using the idea of lazy cohomology generators. [ABSTRACT FROM AUTHOR]

When solving eddy-current problems containing topologically non-trivial conductors with formulations using the magnetic scalar potential in the insulators, cohomology generators are necessary to obtain a well-defined problem. The Dłotko–Specogna (DS) algorithm is a simple and efficient tool to compute the lazy generators of the first cohomology group of the insulator that can be used in such potential design. This paper introduces an upgrade in the DS algorithm that speeds up the execution for very complicated geometries. Moreover, this paper provides, for the first time, a detailed comparison of computational resources needed for the topological pre-processing by our toolbox and by the tool to compute a standard cohomology basis available in the mesh generator GMSH. In addition, we make our implementation of DS algorithm available for download on request for non-profit use as a Topoprocessor package. [ABSTRACT FROM AUTHOR]

This paper presents a novel technique to perform the topological pre-processing needed in formulations based on an electric vector potential and a magnetic scalar potential when the eddy-current problem being solved is subject to periodic boundary conditions. In this case, in fact, all the techniques to produce the generators for the first cohomology group introduced in the literature cannot be used directly on the input mesh. The novel technique is very fast and it is used to model cables for power delivery. [ABSTRACT FROM AUTHOR]