Searcharxiv⌕ Search

arXiv subjects

Herbert De Gersem

Publications and source records attributed to Herbert De Gersem.

At least 55 records · Page 3Linked to original sources

Power Module Heat Sink Design Optimization with Ensembles of Data-Driven Polynomial Chaos Surrogate Models

We consider the problem of optimizing the design of a heat sink used for cooling an insulated gate bipolar transistor (IGBT) power module. The thermal behavior of the heat sink is originally estimated using a high-fidelity computational fluid dynamics (CFD) simulation, which renders numerical optimization too computationally demanding. To enable optimization studies, we substitute the CFD simulation model with an inexpensive polynomial surrogate model that approximates the relation between the device's design features and a relevant thermal quantity of interest. The surrogate model of choice is a data-driven polynomial chaos expansion (DD-PCE), which learns the aforementioned relation by means of polynomial regression. Advantages of the DD-PCE include its applicability in small-data regimes and its easily adaptable model structure. To address the issue of model-form uncertainty and model robustness in view of limited training and test data, ensembles of DD-PCEs are generated based on data re-shuffling. Then, using the full ensemble of surrogate models, the surrogate-based predictions are accompanied by uncertainty metrics such as mean value and variance. Once trained and tested in terms of accuracy and robustness, the ensemble of DD-PCE surrogates replaces the high-fidelity simulation model in optimization algorithms aiming to identify heat sink designs that optimize the thermal behavior of the IGBT under geometrical and operational constraints. Optimized heat sink designs are obtained for a computational cost much smaller than utilizing the original model in the optimization procedure. Due to ensemble modeling, the optimization results can also be assessed in terms of uncertainty and robustness. Comparisons against alternative surrogate modeling techniques illustrate why the DD-PCE should be preferred in the considered setting.

cs.CE↗

Assessing the Performance of Leja and Clenshaw-Curtis Collocation for Computational Electromagnetics with Random Input Data

We consider the problem of quantifying uncertainty regarding the output of an electromagnetic field problem in the presence of a large number of uncertain input parameters. In order to reduce the growth in complexity with the number of dimensions, we employ a dimension-adaptive stochastic collocation method based on nested univariate nodes. We examine the accuracy and performance of collocation schemes based on Clenshaw-Curtis and Leja rules, for the cases of uniform and bounded, non-uniform random inputs, respectively. Based on numerical experiments with an academic electromagnetic field model, we compare the two rules in both the univariate and multivariate case and for both quadrature and interpolation purposes. Results for a real-world electromagnetic field application featuring high-dimensional input uncertainty are also presented.

cs.CE↗

Electromagnetic Quasistatic Field Formulations of Darwin Type

Electromagnetic quasistatic (EMQS) fields, where radiation effects are neglected, while Ohmic losses and electric and magnetic field energies are considered, can be modeled using Darwin-type field models as an approximation to the full Maxwell equations. Commonly formulated in terms of magnetic vector and electric scalar potentials, these EMQS formulations are not gauge invariant. Several EMQS formulations resulting from different gauge equations are considered and analyzed in terms of their structural properties and their modeling capabilities and limitations. Associated discrete field formulations in the context of the Maxwell-grid equations of the Finite Integration Technique are considered in frequency and time domain and are studied with respect to their algebraic properties. A comparison of numerical simulation results w.r.t. reference solutions obtained with established formulations for the full Maxwell equations are presented.

cs.CE↗

Tensor train based isogeometric analysis for PDE approximation on parameter dependent geometries

This work develops a numerical solver based on the combination of isogeometric analysis (IGA) and the tensor train (TT) decomposition for the approximation of partial differential equations (PDEs) on parameter-dependent geometries. First, the discrete Galerkin operator as well as the solution for a fixed geometry configuration are represented as tensors and the TT format is employed to reduce their computational complexity. Parametric dependencies are included by considering the parameters that control the geometry configuration as additional dimensions next to the physical space coordinates. The parameters are easily incorporated within the TT-IGA solution framework by introducing a tensor product basis expansion in the parameter space. The discrete Galerkin operators are accordingly extended to accommodate the parameter dependence, thus obtaining a single system that includes the parameter dependency. The system is solved directly in the TT format and a low-rank representation of the parameter-dependent solution is obtained. The proposed TT-IGA solver is applied to several test cases which showcase its high computational efficiency and tremendous compression ratios achieved for representing the parameter-dependent IGA operators and solutions.

math.NA↗

A Neural Solver for Variational Problems on CAD Geometries with Application to Electric Machine Simulation

This work presents a deep learning-based framework for the solution of partial differential equations on complex computational domains described with computer-aided design tools. To account for the underlying distribution of the training data caused by spline-based projections from the reference to the physical domain, a variational neural solver equipped with an importance sampling scheme is developed, such that the loss function based on the discretized energy functional obtained after the weak formulation is modified according to the sample distribution. To tackle multi-patch domains possibly leading to solution discontinuities, the variational neural solver is additionally combined with a domain decomposition approach based on the Discontinuous Galerkin formulation. The proposed neural solver is verified on a toy problem and then applied to a real-world engineering test case, namely that of electric machine simulation. The numerical results show clearly that the neural solver produces physics-conforming solutions of significantly improved accuracy.

cs.CE↗

Three-Dimensional Data-Driven Magnetostatic Field Computation using Real-World Measurement Data

This paper presents a practical case study of a data-driven magnetostatic finite element solver applied to a real-world three-dimensional problem. Instead of using a hard-coded phenomenological material model within the solver, the data-driven computing approach reformulates the boundary value problem such that the field solution is directly computed on the measurement data. The data-driven formulation results in a minimization problem with a Lagrange multiplier, where the sought solution must conform to Maxwell's equations while at the same time being closest to the available measurement data. The data-driven solver is applied to a three-dimensional model of an inductor excited by a DC-current. Numerical results for data sets of increasing cardinality verify that the data-driven solver recovers the conventional solution. Furthermore, this work concludes that the data-driven magnetostatic finite element solver is applicable to computationally demanding three-dimensional problems. Simulations with real world measurement data further show the practical usability of the solver.

cs.CE↗

Quasi-3-D Spectral Wavelet Method for a Thermal Quench Simulation

The finite element method is widely used in simulations of various fields. However, when considering domains whose extent differs strongly in different spatial directions a finite element simulation becomes computationally very expensive due to the large number of degrees of freedom. An example of such a domain are the cables inside of the magnets of particle accelerators. For translationally invariant domains, this work proposes a quasi-3-D method. Thereby, a 2-D finite element method with a nodal basis in the cross-section is combined with a spectral method with a wavelet basis in the longitudinal direction. Furthermore, a spectral method with a wavelet basis and an adaptive and time-dependent resolution is presented. All methods are verified. As an example the hot-spot propagation due to a quench in Rutherford cables is simulated successfully.

cs.CE↗

Tensor-train approximation of the chemical master equation and its application for parameter inference

In this work, we perform Bayesian inference tasks for the chemical master equation in the tensor-train format. The tensor-train approximation has been proven to be very efficient in representing high dimensional data arising from the explicit representation of the chemical master equation solution. An additional advantage of representing the probability mass function in the tensor train format is that parametric dependency can be easily incorporated by introducing a tensor product basis expansion in the parameter space. Time is treated as an additional dimension of the tensor and a linear system is derived to solve the chemical master equation in time. We exemplify the tensor-train method by performing inference tasks such as smoothing and parameter inference using the tensor-train framework. A very high compression ratio is observed for storing the probability mass function of the solution. Since all linear algebra operations are performed in the tensor-train format, a significant reduction of the computational time is observed as well.

stat.CO↗

Local field reconstruction from rotating coil measurements in particle accelerator magnets

In this paper a general approach to reconstruct three dimensional field solutions in particle accelerator magnets from distributed magnetic measurements is presented. To exploit the locality of the measurement operation a special discretization of the Laplace equation is used. Extracting the coefficients of the field representations yields an inverse problem which is solved by Bayesian inversion. This allows not only to pave the way for uncertainty quantification, but also to derive a suitable regularization. The approach is applied to rotating coil measurements and can be extended to any other measurement procedure.

physics.acc-ph↗

Convergence of classical optimized non-overlapping Schwarz method for Helmholtz problems in closed domains

In this paper we discuss the convergence of state-of-the-art optimized Schwarz transmission conditions for Helmholtz problems defined on closed domains (i.e. setups which do not exhibit an outgoing wave condition), as commonly encountered when modeling cavities. In particular, the impact of back-propagating waves on the Dirichlet-to-Neumann map is analyzed. Afterwards, the performance of the well-established optimized 0th-order, evanescent modes damping, optimized 2nd-order and Padé-localized square-root transmission conditions is discussed.

math.NA↗

Pickup concepts for ultra-low charged short bunches in X-Ray Free-Electron Lasers

The all-optical synchronization systems used in various X-ray free-electron lasers (XFEL) such as the European XFEL observe the transient fields of passing electron bunches coupled into one or more pickups in the Bunch Arrival Time Monitors (BAM). The extracted signal is then amplitude modulated on reference laser pulses in a Mach-Zehnder type electro-optical modulator. With the emerging demand for future experiments with ultra-short FEL shots, fs precision is required for the synchronization systems even with 1 pC bunches. Since the sensitivity of the BAM depends in particular on the slope of the bipolar signal at the zero-crossing and thus, also on the bunch charge, a redesign with the aim of a significant increase by optimized geometry and bandwidth is inevitable. In this contribution the theoretical foundations of the pickup signal are aggregated and treated with a focus on ultra-short bunches as well as a general formulation. A possible new pickup concept is simulated and its performance is compared to the previous concept. A significant improvement of slope and voltage is found. The improvement is mainly achieved by the reduced distance to the beam and a higher bandwidth.

physics.ins-det↗

Broadband Finite-Element Impedance Computation for Parasitic Extraction

Parasitic extraction is a powerful tool in the design process of electromechanical devices, specifically as part of workflows that check electromagnetic compatibility. A novel scheme to extract impedances from CAD device models, suitable for a finite element implementation, is derived from Maxwell's equations in differential form. It provides a foundation for parasitic extraction across a broad frequency range and is able to handle inhomogeneous permittivities and permeabilities, making it more flexible than existing integral equation approaches. The approach allows for the automatic treatment of multi-port models of arbitrary conductor geometry without requiring any significant manual user interaction. This is achieved by computing a connecting source current density that supplies current to the model's terminals, whatever their location in the model, subsequently using this current density to compute the electric field, and finally calculating the impedance via a scalar potential. A mandatory low-frequency stabilization scheme is outlined, ensuring a stable evaluation of the model at low frequencies as well. Two quasistatic approximations and the special case of perfect electric conductors are treated theoretically. The magnetoquasistatic approximation is validated against an analytical model in a numerical experiment. Moreover, the intrinsic capability of the method to treat inhomogeneous permittivities and permeabilities is demonstrated with a simple capacitor-coil model including dielectric insulation and magnetic core materials.

cs.CE↗

Data-Driven Solvers for Strongly Nonlinear Material Response

This work presents a data-driven magnetostatic finite-element solver that is specifically well-suited to cope with strongly nonlinear material responses. The data-driven computing framework is essentially a multiobjective optimization procedure matching the material operation points as closely as possible to given material data while obeying Maxwell's equations. Here, the framework is extended with heterogeneous (local) weighting factors - one per finite element - equilibrating the goal function locally according to the material behavior. This modification allows the data-driven solver to cope with unbalanced measurement data sets, i.e. data sets suffering from unbalanced space filling. This occurs particularly in the case of strongly nonlinear materials, which constitute problematic cases that hinder the efficiency and accuracy of standard data-driven solvers with a homogeneous (global) weighting factor. The local weighting factors are embedded in the distance-minimizing data-driven algorithm used for noiseless data, likewise for the maximum entropy data-driven algorithm used for noisy data. Numerical experiments based on a quadrupole magnet model with a soft magnetic material show that the proposed modification results in major improvements in terms of solution accuracy and solver efficiency. For the case of noiseless data, local weighting factors improve the convergence of the data-driven solver by orders of magnitude. When noisy data are considered, the convergence rate of the data-driven solver is doubled.

physics.comp-ph↗

Magnetic Field Simulation with Data-Driven Material Modeling

This paper developes a data-driven magnetostatic finite-element (FE) solver which directly exploits measured material data instead of a material curve constructed from it. The distances between the field solution and the measurement points are minimized while enforcing Maxwell's equations. The minimization problem is solved by employing the Lagrange multiplier approach. The procedure wraps the FE method within an outer data-driven iteration. The method is capable of considering anisotropic materials and is adapted to deal with models featuring a combination of exact material knowledge and measured material data. Thereto, three approaches with an increasing level of intrusivity according to the FE formulation are proposed. The numerical results for a quadrupole-magnet model show that data-driven field simulation is feasible and affordable and overcomes the need of modeling the material law.

physics.comp-ph↗

Approximation and Uncertainty Quantification of Systems with Arbitrary Parameter Distributions using Weighted Leja Interpolation

Approximation and uncertainty quantification methods based on Lagrange interpolation are typically abandoned in cases where the probability distributions of one or more {system} parameters are not normal, uniform, or closely related {distributions}, due to the computational issues that arise when one wishes to define interpolation nodes for general distributions. This paper examines the use of the recently introduced weighted Leja nodes for that purpose. Weighted Leja interpolation rules are presented, along with a dimension-adaptive sparse interpolation algorithm, to be employed in the case of high-dimensional input uncertainty. The performance and reliability of the suggested approach is verified by four numerical experiments, where the respective models feature extreme value and truncated normal parameter distributions. Furthermore, the suggested approach is compared with a well-established polynomial chaos method and found to be either comparable or superior in terms of approximation and statistics estimation accuracy.

math.NA↗

A Coupled A-H Formulation for Magneto-Thermal Transients in High-Temperature Superconducting Magnets

The application of high-temperature superconductors to accelerator magnets for future particle colliders is under study. Numerical methods are crucial for an accurate evaluation of the complex dynamical behavior of the magnets, especially concerning the magnetic field quality and thermal behavior. We present a coupled $\textbf{A}$-$\textbf{H}$ field formulation for the analysis of magneto-thermal transients in accelerator magnets. The magnetic field strength $\textbf{H}$ accounts for the eddy current problem in the source regions containing the superconducting domains, while the magnetic vector potential $\textbf{A}$ represents the magnetoquasistatic problem in the normal and non-conducting domains. Furthermore, we include a slab approximation for the source regions, making the formulation suitable for large scale models composed of thousands of tapes. In this work, the relevant equations are derived and discussed, with emphasis on the coupling conditions. The weak formulation is derived, and numerical results are provided in order to both, verify the formulation and scale it to the size of an accelerator magnet.

physics.acc-ph↗

Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications

We present an algorithm for computing sparse, least squares-based polynomial chaos expansions, incorporating both adaptive polynomial bases and sequential experimental designs. The algorithm is employed to approximate stochastic high-frequency electromagnetic models in a black-box way, in particular, given only a dataset of random parameter realizations and the corresponding observations regarding a quantity of interest, typically a scattering parameter. The construction of the polynomial basis is based on a greedy, adaptive, sensitivity-related method. The sequential expansion of the experimental design employs different optimality criteria, with respect to the algebraic form of the least squares problem. We investigate how different conditions affect the robustness of the derived surrogate models, that is, how much the approximation accuracy varies given different experimental designs. It is found that relatively optimistic criteria perform on average better than stricter ones, yielding superior approximation accuracies for equal dataset sizes. However, the results of strict criteria are significantly more robust, as reduced variations regarding the approximation accuracy are obtained, over a range of experimental designs. Two criteria are proposed for a good accuracy-robustness trade-off.

cs.CE↗