Search

The simulation of electromagnetic devices with complex geometries and large-scale discrete systems benefits from advanced computational methods like IsoGeometric Analysis and Domain Decomposition. In this paper, we employ both concepts in an Isogeometric Tearing and Interconnecting method to enable the use of parallel computations for magnetostatic problems. We address the underlying non-uniqueness by using a graph-theoretic approach, the tree-cotree decomposition. The classical tree-cotree gauging is adapted to be feasible for parallelization, which requires that all local subsystems are uniquely solvable. Our contribution consists of an explicit algorithm for constructing compatible trees and combining it with a dual-primal approach to enable parallelization. The correctness of the proposed approach is proved and verified by numerical experiments, showing its accuracy, scalability and optimal convergence., Comment: Preprint submitted to Computer Methods in Applied Mechanics and Engineering

We present a fundamental improvement of a high polynomial degree time domain cell method recently introduced by the last three authors. The published work introduced a method featuring block-diagonal system matrices where the block size and conditioning scaled poorly with respect to polynomial degree. The issue is herein bypassed by the construction of new basis functions exploiting quadrature rule based mass lumping techniques for arbitrary polynomial degrees in two dimensions for the Maxwell equations and the acoustic wave equation in the first order velocity pressure formulation. We characterize the degrees of freedom of all new discrete approximation spaces we employ for differential forms and show that the resulting block diagonal (inverse) mass matrices have block sizes independent of the polynomial degree. We demonstrate on an extensive number of examples how the new technique is applicable and efficient for large scale computations.

The eddy current problem has many relevant practical applications in science, ranging from non-destructive testing to magnetic confinement of plasma in fusion reactors. It arises when electrical conductors are immersed in an external time-varying magnetic field operating at frequencies for which electromagnetic wave propagation effects can be neglected. Popular formulations of the eddy current problem either use the magnetic vector potential or the magnetic scalar potential. They have individual advantages and disadvantages. One challenge is related to differential geometry: Scalar potential based formulations run into trouble when conductors are present in non-trivial topology, as approximation spaces must be then augmented with generators of the first cohomology group of the non-conducting domain. For all existing algorithms based on lowest order methods it is assumed that the extension of the graph-based algorithms to high-order approximations requires hierarchical bases for the curl-conforming discrete spaces. However, building on insight on de Rham complexes approximation with splines, we will show in the present submission that the hierarchical basis condition is not necessary. Algorithms based on spanning tree techniques can instead be adapted to work on an underlying hexahedral mesh arising from isomorphisms between spline spaces of differential forms and de Rham complexes on an auxiliary control mesh.

We introduce a high-order spline geometric approach for the initial boundary value problem for Maxwell's equations. The method is geometric in the sense that it discretizes in structure preserving fashion the two de Rham sequences of differential forms involved in the formulation of the continuous system. Both the Ampere--Maxwell and the Faraday equations are required to hold strongly, while to make the system solvable two discrete Hodge star operators are used. By exploiting the properties of the chosen spline spaces and concepts from exterior calculus, a non-standard explicit in time formulation is introduced, based on the solution of linear systems with matrices presenting Kronecker product structure, rather than mass matrices as in the standard literature. These matrices arise from the application of the exterior (wedge) product in the discrete setting, and they present Kronecker product structure independently of the geometry of the domain or the material parameters. The resulting scheme preserves the desirable energy conservation properties of the known approaches. The computational advantages of the newly proposed scheme are studied both through a complexity analysis and through numerical experiments in three dimensions., Comment: 22 pages, 8 figures, 1 table

A new kind of spline geometric method approach is presented. Its main ingredient is the use of well established spline spaces forming a discrete de Rham complex to construct a primal sequence $\{X^k_h\}^n_{k=0}$, starting from splines of degree $p$, and a dual sequence $\{\tilde{X}^k_h\}_{k=0}^n$, starting from splines of degree $p-1$. By imposing homogeneous boundary conditions to the spaces of the primal sequence, the two sequences can be isomorphically mapped into one another. Within this setup, many familiar second order partial differential equations can be finally accommodated by explicitly constructing appropriate discrete versions of constitutive relations, called Hodge--star operators. Several alternatives based on both global and local projection operators between spline spaces will be proposed. The appeal of the approach with respect to similar published methods is twofold: firstly, it exhibits high order convergence. Secondly, it does not rely on the geometric realization of any (topologically) dual mesh. Several numerical examples in various space dimensions will be employed to validate the central ideas of the proposed approach and compare its features with the standard Galerkin approach in Isogeometric Analysis., Comment: Updated with revised version: 25 pages, 8 figures, 4 tables

In this work isogeometric mortaring is used for the simulation of a six pole permanent magnet synchronous machine. Isogeometric mortaring is especially well suited for the efficient computation of rotating electric machines as it allows for an exact geometry representation for arbitrary rotation angles without the need of remeshing. The appropriate B-spline spaces needed for the solution of Maxwell's equations and the corresponding mortar spaces are introduced. Unlike in classical finite element methods their construction is straightforward in the isogeometric case. The torque in the machine is computed using two different methods, i.e., Arkkio's method and by using the Lagrange multipliers from the mortaring.

When applying isogeometric analysis to engineering problems, one often deals with multi-patch spline spaces that have incompatible discretisations, e.g. in the case of moving objects. In such cases mortaring has been shown to be advantageous. This contribution discusses the appropriate B-spline spaces needed for the solution of Maxwell's equations in the functions space H(curl) and the corresponding mortar spaces. The main contribution of this paper is to show that in formulations requiring gauging, as in the vector potential formulation of magnetostatic equations, one can remove the discrete kernel subspace from the mortared spaces by the graph-theoretical concept of a tree-cotree decomposition. The tree-cotree decomposition is done based on the control mesh, it works for non-contractible domains, and it can be straightforwardly applied independently of the degree of the B-spline bases. Finally, the simulation workflow is demonstrated using a realistic model of a rotating permanent magnet synchronous machine.

A Discontinuous Galerkin (DG) Finite Element Method (FEM) approach for the 3D time dependent Maxwell equations in unbounded domains is presented. The method (implemented in the FEM library NGsolve) is based on the covariant transformation of a modal orthogonal polynomial basis, originally defined on a reference simplex. The approach leads to an explicit time stepping scheme for which the mass matrix to be inverted is at most $d\!\times\!d$ block-diagonal (in $d\!=\!2,3$ spatial dimensions) while the matrix which discretizes the curl operators on the right-hand side of the system is a small reference matrix, independent from geometric properties of mesh elements. Furthermore, we show that the introduced optimizations are preserved when unbounded domains are also included in the formulation through a complex-stretching based approach., Comment: 9 pages (double column), 7 figures

We introduce a new numerical method for the time-dependent Maxwell equations on unstructured meshes in two space dimensions. This relies on the introduction of a new mesh, which is the barycentric-dual cellular complex of the starting simplicial mesh, and on approximating two unknown fields with integral quantities on geometric entities of the two dual complexes. A careful choice of basis-functions yields cheaply invertible block-diagonal system matrices for the discrete time-stepping scheme. The main novelty of the present contribution lies in incorporating arbitrary polynomial degree in the approximating functional spaces, defined through a new reference cell. The presented method, albeit a kind of Discontinuous Galerkin approach, requires neither the introduction of user-tuned penalty parameters for the tangential jump of the fields, nor numerical dissipation to achieve stability. In fact an exact electromagnetic energy conservation law for the semi-discrete scheme is proved and it is shown on several numerical tests that the resulting algorithm provides spurious-free solutions with the expected order of convergence., Comment: 34 pages, 14 figures, submitted

This paper extends the $T$-$\Omega$ formulation for eddy currents based on higher order hierarchical basis functions so that it can deal with conductors of arbitrary topology. To this aim we supplement the classical hierarchical basis functions with non-local basis functions spanning the first de Rham cohomology group of the insulating region. Such non-local basis functions may be efficiently found in negligible time with the recently introduced D{\l}otko--Specogna (DS) algorithm.