The design of intrinsically flat two-dimensional optical components, i.e., metasurfaces, generally requires an extensive parameter search to target the appropriate scattering properties of their constituting building blocks. Such design methodologies neglect important near-field interaction effects, playing an essential role in limiting the device performance. Optimization of transmission, phase-addressing and broadband performances of metasurfaces require new numerical tools. Additionally, uncertainties and systematic fabrication errors should be analysed. These estimations, of critical importance in the case of large production of metaoptics components, are useful to further project their deployment in industrial applications. Here, we report on a computational methodology to optimize metasurface designs. We complement this computational methodology by quantifying the impact of fabrication uncertainties on the experimentally characterized components. This analysis provides general perspectives on the overall metaoptics performances, giving an idea of the expected average behavior of a large number of devices.

Abstract-In this paper, electrothermal field phenomena in electronic components are considered. This coupling is tackled by multiphysical field simulations using the Finite Integration Technique (FIT). In particular, the design of bonding wires with respect to thermal degradation is investigated. Instead of resolving the wires by the computational grid, lumped element representations are introduced as point-to-point connections in the spatially distributed model. Fabrication tolerances lead to uncertainties of the wires' parameters and influence the operation and reliability of the final product. Based on geometric measurements, the resulting variability of the wire temperatures is determined using the stochastic electrothermal field-circuit model.

View the article online for updates and enhancements. AbstractIn this paper, we study a high-order finite element approach to simulate an ultrahigh finesse FabryPérot superconducting open resonator for cavity quantum electrodynamics. Because of its high quality factor, finding a numerically converged value of the damping time requires an extremely high spatial resolution. Therefore, the use of high-order simulation techniques appears appropriate. This paper considers idealized mirrors (no surface roughness and perfect geometry, just to cite a few hypotheses), and shows that under these assumptions, a damping time much higher than what is available in experimental measurements could be achieved. In addition, this work shows that both high-order discretizations of the governing equations and high-order representations of the curved geometry are mandatory for the computation of the damping time of such cavities.

The stochastic Galerkin and stochastic collocation method are two state-of-the-art methods for solving partial differential equations (PDE) containing random coefficients. While the latter method, which is based on sampling, can straightforwardly be applied to nonlinear stochastic PDEs, this is nontrivial for the stochastic Galerkin method and approximations are required. In this paper, both methods are used for constructing high-order solutions of a nonlinear stochastic PDE representing the magnetic vector potential in a ferromagnetic rotating cylinder. This model can be used for designing solid-rotor induction machines in various machining tools. A precise design requires to take ferromagnetic saturation effects into account and uncertainty on the nonlinear magnetic material properties. A numerical comparison of the computational cost and accuracy of both methods is performed. The stochastic Galerkin method requires in general less stochastic unknowns than the stochastic collocation approach to reach a certain level of accuracy, however at a higher computational cost. AbstractThe stochastic Galerkin and stochastic collocation method are two state-of-the-art methods for solving partial differential equations (PDE) containing random coefficients. While the latter method, which is based on sampling, can straightforwardly be applied to nonlinear stochastic PDEs, this is nontrivial for the stochastic Galerkin method and approximations are required. In this paper, both methods are used for constructing high-order solutions of a nonlinear stochastic PDE representing the magnetic vector potential in a ferromagnetic rotating cylinder. This model can be used for designing solid-rotor induction machines in various machining tools. A precise design requires to take ferromagnetic saturation effects into account and uncertainty on the nonlinear magnetic material properties. A numerical comparison of the computational cost and accuracy of both methods is performed. The stochastic Galerkin method requires in general less stochastic unknowns than the stochastic collocation approach to reach a certain level of accuracy, however at a higher computational cost.

No abstract

Purpose The purpose of this paper is to present the applicability of data-driven solvers to computationally demanding three-dimensional problems and their practical usability when using real-world measurement data. Design/methodology/approach 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 raw measurement data. The data-driven formulation results in a double minimization problem based on Lagrange multipliers, where the sought solution must conform to Maxwell’s equations while at the same time being as close as possible to the available measurement data. The data-driven solver is applied to a three-dimensional model of a direct current electromagnet. Findings Numerical results for data sets of increasing cardinality verify that the data-driven solver recovers the conventional solution. Additionally, the practical usability of the solver is shown by using real-world measurement data. This work concludes that the data-driven magnetostatic finite element solver is applicable to computationally demanding three-dimensional problems, as well as in cases where a prescribed material model is not available. Originality/value Although the mathematical derivation of the data-driven problem is well presented in the referenced papers, the application to computationally demanding real-world problems, including real measurement data and its rigorous discussion, is missing. The presented work closes this gap and shows the applicability of data-driven solvers to challenging, real-world test cases.

In many time-harmonic electromagnetic wave problems, the considered geometry exhibits an axial symmetry. In this case, by exploiting a Fourier expansion along the azimuthal direction, fully three-dimensional (3D) calculations can be carried out on a two-dimensional (2D) angular cross section of the problem, thus significantly reducing the computational effort. However, the transition from a full 3D problem to a 2D analysis introduces additional difficulties such as, among others, a singularity in the variational formulation. In this work, we compare and discuss different finite element formulations to deal with these obstacles. Particular attention is paid to spurious modes and to the convergence behavior when using high-order elements.

This work suggests an interpolation-based stochastic collocation method for the non-intrusive and adaptive construction of sparse polynomial chaos expansions (PCEs). Unlike pseudospectral projection and regression-based stochastic collocation methods, the proposed approach results in PCEs featuring one polynomial term per collocation point. Moreover, the resulting PCEs are interpolating, i.e., they are exact on the interpolation nodes/collocation points. Once available, an interpolating PCE can be used as an inexpensive surrogate model, or be postprocessed for the purposes of uncertainty quantification and sensitivity analysis. The main idea is conceptually simple and relies on the use of Leja sequence points as interpolation nodes. Using Newton-like, hierarchical basis polynomials defined upon Leja sequences, a sparse-grid interpolation can be derived, the basis polynomials of which are unique in terms of their multivariate degrees. A dimension-adaptive scheme can be employed for the construction of an anisotropic interpolation. Due to the degree uniqueness, a one-to-one transform to orthogonal polynomials of the exact same degrees is possible and shall result in an interpolating PCE. However, since each Leja node defines a unique Newton basis polynomial, an implicit one-to-one map between Leja nodes and orthogonal basis polynomials exists as well. Therefore, the in-between steps of hierarchical interpolation and basis transform can be discarded altogether, and the interpolating PCE can be computed directly. For directly computed, adaptive, anisotropic interpolating PCEs, the dimension-adaptive algorithm is modified accordingly. A series of numerical experiments verify the suggested approach in both low and moderately high-dimensional settings, as well as for various input distributions.