Search

An electromagnetic wave propagation problem can be formulated according to a pair of complementary formulations, called the e -formulation and the h -formulation. The two formulations are linked to each other by Maxwell’s curl equations, and, in the continuous setting, they are perfectly equivalent in describing the wave propagation phenomenon. However, this is not true in the discrete setting, where the two formulations, in general, give different solutions. In the past decades, complementary formulations were widely studied for static problems and eddy-current problems, where they were exploited as error estimators for adaptive refinement schemes. Moreover, the so-called bilateral energy bounds arise for some problems whether theoretically or at least numerically. However, to the best of our knowledge, little attention has been given to complementarity in the wave propagation problems. In this paper, we propose an adaptive refinement scheme using the constitutive error as an estimator, and then, we investigate the behavior in terms of bilateral energy bounds. [ABSTRACT FROM AUTHOR]

The aim of the paper is to present an automatic and general technique, suitable with the A-X geometric eddy-current formulation, to impose sources over massive conductors of any shape. For this purpose, the localized source approach is used, which does not require the solutions of steady-state conduction problems in the preprocessing stage. Nevertheless, this approach needs a thick cut in each active conductor, which is usually found "by hand." In this paper, an automatic and general algorithm to compute such thick cuts is introduced. Some benchmark problems are presented to demonstrate the generality and the robustness of the algorithm. [ABSTRACT FROM AUTHOR]

A perturbation method for the T - Ω geometric formulation to solve eddy-current problems is introduced. The proposed formulation is applied to the feasibility design of a nondestructive evaluation device suitable to detect "long" longitudinal flaws in hot steel bars. [ABSTRACT FROM AUTHOR]

The aim of this paper is to present a 3-D time-domain eddy-current A formulation based on the discrete geometric approach (DGA) over unstructured and nonorthogonal hexahedral dual grids. The resulting differential algebraic system of equation, solved by means of a singly-diagonally implicit Runge-Kutta (SDIRK) variable step-size solver, leads to very accurate results at reduced computational costs, as shown by numerical analysis. [ABSTRACT FROM AUTHOR]

We examine the construction of reluctivity and Ohm's constitutive matrices for discrete geometric approaches using nonregular hexa-hedra as primal volumes. The effect of element deformation on the representation of uniform fields have been investigated for static fields. Then convergence and accuracy of the proposed matrices has been carried out using an eddy-current problem as working example. [ABSTRACT FROM AUTHOR]

We examine the construction of a symmetric positive definite conductance matrix for eddy-current problems, using a discrete approach. We construct a new set of piecewise uniform basis vector functions on both the primal and the dual complex. We define these vector functions for both tetrahedra and prisms. [ABSTRACT FROM AUTHOR]

Using a geometric formulation for eddy currents, we present a geometric approach to constructing approximations of the discrete magnetic and Ohm's constitutive matrices. In the case of Ohm's matrix, we also show how to make it symmetric. We compared the impact on the solution of the proposed Ohm's matrices, and an iterative technique to obtain a consistent right-hand-side term in the final system is described. [ABSTRACT FROM AUTHOR]

Abstract: In this paper a Geometric T–Ω formulation to solve eddy-current problems on a tetrahedral mesh is presented. When non-simply-connected conducting regions are considered, the formulation requires the so-called thick cuts, while, in the literature, more attention is usually given to the so-called thin cuts. While the automatic construction of thin cuts has been theoretically solved many years ago, no implementation of an algorithm to compute the thick cuts which can be used in practice exists so far. In this paper, we propose how to fill this gap by introducing an algorithm to automatically compute the thick cuts on real-sized meshes, based on a belted tree and a tree–cotree decomposition. The belted tree is constructed by means of a homology computation by exploiting efficient reduction methods. A number of benchmarks are presented to demonstrate the generality and the robustness of the algorithm. A rigorous definition of thick cuts, which necessarily has to rely on cohomology, is presented in addition. [Copyright &y& Elsevier]