Modeling Adequacy of Droop-Controlled Grid-Forming Converters for Transient Studies: Singular Perturbation Analysis
Explore the source record for details and available documents.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
We report modular architectures that consist of several series-connected dc-ac converters have been a focal point of recent innovations in transformerless medium-voltage applications. In this paper, we consider an architecture consisting of dc-ac modules containing a quadruple active bridge dc-dc converter, which generates three floating dc links that feed grid-side dc-ac inverters. Practical implementation of such a converter module in PV systems requires a variety of controllers that collectively achieve maximum power point tracking, dc-link regulation, and ac-side power control. Design of such multi-loop systems is generally quite challenging due to the potential for destabilizing interactions among loops. Here we propose a design approach where singular perturbation theory is used to decompose the timescales at which each control loop operates and provides a systematic framework for parametric selection. Our approach also ensures system stability of multiple modules with identical controls connected in series across a grid. The paper concludes with experimental results of three 1000 W series-connected converter modules across a stiff grid.
Coordinate singularities are sometimes encountered in computational problems. An important example involves global atmospheric models used for climate and weather prediction. Classical spherical coordinates can be used to parameterize the manifold – that is, generate a grid for the computational spherical shell domain. This particular parameterization offers significant benefits such as orthogonality and exact representation of curvature and connection (Christoffel) coefficients. But it also exhibits two polar singularities and at or near these points typical continuity/integral constraints on dependent fields and their derivatives are generally inadequate and lead to poor model performance and erroneous results. Other parameterizations have been developed that eliminate polar singularities, but problems of weaker singularities and enhanced grid noise compared to spherical coordinates (away from the poles) persist. Here, in this study reparameterization invariance of geometric objects (scalars, vectors and the forms generated by their covariant derivatives) is utilized to generate asymptotic forms for dependent fields of interest valid in the neighborhood of a pole. The central concept is that such objects cannot be altered by the metric structure of a parameterization. The new boundary conditions enforce symmetries that are required for transformations of geometric objects. They are implemented in an implicit polar filter of a structured grid, nonhydrostatic global atmospheric model that is simulating idealized Held–Suarez flows. A series of test simulations using different configurations of the asymptotic boundary conditions are made, along with control simulations that use the default model numerics with no absorber, at three different grid sizes. Typically the test simulations are ~ 20% faster in wall clock time than the control—resulting from a decrease in noise at the poles in all cases. In the control simulations adverse numerical effects from the polar singularity are observed to increase with grid resolution. In contrast, test simulations demonstrate robust polar behavior independent of grid resolution.
Euler-Lagrange point-particle simulation has emerged as a premier methodology for studying dispersed particle-laden flows. This method's popularity stems from its ability to resolve fine-scale fluid structures while also tracking individual particles at reduced cost using an appropriate particle acceleration model. However, the point-particle model has known convergence issues in that refinement of the fluid grid can lead to changes in the predicted statistics. The reasons for non-convergence are twofold: the point-particle two-way coupling force in the Navier-Stokes equations requires a numerical regularization and, without careful implementation, yields a singular force on the fluid with grid refinement. The second factor that yields grid-dependent statistics is that the point-particle force model in general depends on the undisturbed fluid velocity. When the undisturbed fluid velocity is not robustly modeled in a grid-insensitive way, the calculated force for both particles and fluid will be grid-dependent, contaminating their respective statistics. While the first issue regarding regularizing the point-particle source term has received attention in the literature, the consequences of robustly modeling the undisturbed velocity in the context of grid refinement of turbulence has received little attention. Here, we consider decaying homogeneous isotropic turbulence laden with particles at different Stokes numbers. For a given Stokes number, we systematically refine the grid and demonstrate that explicitly modeling the undisturbed fluid velocity yields relative grid insensitivity for the energy of the particle and fluid phases, as well as acceleration of the particles. We also demonstrate that an appropriately defined dissipation rate is also grid-insensitive when an undisturbed fluid velocity correction is used. In contrast, when the undisturbed fluid velocity is modeled using the conventional approach of interpolating the local fluid velocity to the particle location, we show this procedure yields divergent statistics with grid refinement. In particular, we show that higher-order interpolation of the fluid velocity in two-way coupled problems is worse than lower-order interpolation, in the absence of a correction procedure to estimate the undisturbed fluid velocity. We also examine velocity derivative statistics of the fluid phase and demonstrate that these statistics are not in general convergent even when the undisturbed fluid velocity is explicitly modeled. Collectively, the observations in this paper are used to present a philosophy on the types of questions which are answerable with point-particle methods.
The new energy paradigm is altering the current power grid trend from synchronous generator reliant system toward power-electronics-based distributed energy resources (DERs). The resilient operation of modern power grid is highly dependent upon cyber and physical reliable operation of DERs. Power grid resilience broadly refers to the ability of the grid to be robust to eventualities and singularities that may disrupt the continuity of reliable power flow. This could involve resilience related to the physical system but more recently, the focus on cyber resilience has been evolving rapidly especially given the burgeoning growth of distributed generation and power-electronics-based DERs under smart grid and given that such threats to reliable operation do not have to evolve localized to where the physical asset is. Commonly, in power grids dominated by DERS, control and energy management are structured at a multitime scale multilayer fashion: (i) primary control layer at microseconds time scale, (ii) secondary control layer at millisecond time scale, and (iii) tertiary control layer at seconds to minutes time scale. The cyber-related issues that may affect the power grid resilience can be introduced in through primary, secondary, and tertiary control layers. The failure of each of these control layers may impact the reliable and resilient operation of the overall network and cause widespread failures which leads to unintended blackouts. As such, this chapter focuses on cyber-related resilience issues in primary control layer, secondary control layer, tertiary control layer, wide area/utility control, and anomaly detection and resilient communication.
Memory and network bandwidth are decisive bottlenecks when handling high-resolution multidimensional data sets in visualization applications, and they increasingly demand suitable data compression strategies. In this paper, we introduce a novel lossy compression algorithm for multidimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher, together with bit-plane, run-length and arithmetic coding to compress the HOSVD transform coefficients. Our scheme degrades the data particularly smoothly and achieves lower mean squared error than other state-of-the-art algorithms at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include very fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set.
In this study, we discuss a novel approach to modeling the near-wall region in the class of k – ω to models. The proposed methodology obviates the need for ad hoc boundary conditions of to omega on the wall as typically required in the k – ω model. The primary motivation of this work is to provide a formulation equivalent to the standard k – ω to and k – ω to SST models, but which at the same time overcomes their limitations in the context of their implementation in high-order methods. This is achieved by subtracting the asymptotically known singular behavior of omega at walls. Imposing a grid-dependent value of omega at walls in high-order codes is not straightforward as is demonstrated below and it causes instability as well as accuracy issues. The mathematical formulation of the two novel approaches, termed as the "regularized k – ω model" and the "regularized k – ω OJ SST model", is discussed in detail. A consistency and verification study for these two approaches is performed by proving that the regularized models recover the results of the standard models in various canonical problems, such as turbulent channel and pipe flows, and a systematic investigation of convergence, using both p- (polynomial order) as well as h- (grid) refinement is reported. Furthermore, comparisons highlighting the performance of the proposed methods in more complex configurations such as flow over a backward facing step and the turbulent mixing of fluid streams of different temperatures in a T-junction are also presented.
We explore a novel way to numerically resolve the scaling behavior of finite-time singularities in solutions of nonlinear parabolic PDEs. The Runge–Kutta–Legendre (RKL) and Runge–Kutta–Gegenbauer (RKG) super-time-stepping methods were originally developed for nonlinear complex physics problems with diffusion. These are multistage single step second-order, forward-in-time methods with no implicit solves. The advantage is that the time-step size for stability scales with stage number 𝑠 as $\mathcal{O}$(𝑠 2 ). Many interesting nonlinear PDEs have finite-time singularities, and the presence of diffusion often limits one to using implicit or semi-implicit time-step methods for stability constraints. Finite-time singularities are particularly challenging due to the large range of scales that one desires to resolve, often with adaptive spatial grids and adaptive time steps. Here, in this study, we show two examples of nonlinear PDEs for which the self-similar singularity structure has time and space scales that are resolvable using the RKL and RKG methods, without forcing even smaller time steps. Compared to commonly used implicit numerical methods, we achieve a significantly smaller run time while maintaining comparable accuracy. We also prove numerical monotonicity for both the RKL and RKG methods under their linear stability conditions for the constant coefficient heat equation, in the case of infinite domain and periodic boundary condition, leading to a theoretical guarantee of the superiority of the RKL and RKG methods over traditional super-time-stepping methods, such as the Runge-Kutta-Chebyshev and the orthogonal Runge-Kutta-Chebyshev methods. Code can be found at https://github.com/ZT220501/SRK-Singularity.
This paper considers the problem of recovering missing entries in a partially observed matrix from relatively few measurements (i.e., the so-called matrix completion problem) with the aim of increasing the presently limited observability of low-voltage distribution grids. To this end, the partially observed matrix is formed using scarce voltage magnitude measurements while accounting for their spatial information. Voltage readings are assumed to be collected from distribution utility sensors and/or geographically-distributed cable television network sensors located in immediate proximity to distribution grid nodes. A matrix completion approach built on the parameter-less singular value shrinkage technique is used to estimate voltage magnitudes at otherwise non-observable low-voltage nodes using a small number of single- or multiple-snapshot data. The effectiveness of the proposed approach is demonstrated using a U.S.-style distribution test system from the synthetic SMART- DS data set under very low- to moderate-observability conditions.
ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.
Magnetic materials host a wealth of nonlinear dynamics, textures, and topological defects. This is possible due to the competition between strong nonlinearity and dispersion, which act at the atomic scale, as well as long-range interactions. However, these features are difficult to study analytically and numerically because of the vastly different temporal and spatial scales involved. Here, in this work, we present a pseudospectral approach for the Landau-Lifshitz equation that invokes energy and momentum conservation embodied in the magnon dispersion relation to accurately describe both atomic and continuum limits. Furthermore, this approach enables analytical study at every scale. We show the applicability of this model in both the continuum and atomic limit by investigating modulational instability and ultrafast evolution of magnetization due to transient grating, respectively, in a one-dimensional ferromagnetic chain with perpendicular magnetic anisotropy. This model provides the possibility of grid-independent multiscale numerical approaches that will enable the description of singularities within a single framework.
Structures in tokamak plasmas are elongated along the direction of the magnetic field and short in the directions perpendicular to the magnetic field. Many tokamak simulation codes take advantage of this by using a field-aligned coordinate system. However, field-aligned coordinate systems have a coordinate singularity at magnetic X-points where the poloidal magnetic field vanishes, which makes it difficult to use field-aligned coordinate systems when simulating the core and scrape-off layer simultaneously. Here, we present an algorithm for grid generation and computing geometric quantities in a standard field-aligned coordinate system that avoids the singularity and allows one to conduct two-dimensional gyrokinetic axisymmetric simulations in X-point geometries. Convergence tests of advection, boundary value problems and geometric quantities all show greater than first-order convergence even in the vicinity of the X-point. We also demonstrate the geometric consistency of our algorithm with an example simulation of the spherical tokamak for energy production, which shows machine-precision particle conservation.
General relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a GPU-accelerated GRMHD code H-AMR with multifaceted optimizations that, collectively, accelerate computation by 2–5 orders of magnitude for a wide range of applications. First, it introduces a spherical grid with 3D adaptive mesh refinement that operates in each of the three dimensions independently. This allows us to circumvent the Courant condition near the polar singularity, which otherwise cripples high-resolution computational performance. Second, we demonstrate that local adaptive time stepping on a logarithmic spherical-polar grid accelerates computation by a factor of ≲10 compared to traditional hierarchical time-stepping approaches. Jointly, these unique features lead to an effective speed of ~10 9 zone cycles per second per node on 5400 NVIDIA V100 GPUs (i.e., 900 nodes of the OLCF Summit supercomputer). We illustrate H-AMR's computational performance by presenting the first GRMHD simulation of a tilted thin accretion disk threaded by a toroidal magnetic field around a rapidly spinning black hole. With an effective resolution of 13,440 × 4608 × 8092 cells and a total of ≲22 billion cells and ~0.65 × 10 8 time steps, it is among the largest astrophysical simulations ever performed. We find that frame dragging by the black hole tears up the disk into two independently precessing subdisks. The innermost subdisk rotation axis intermittently aligns with the black hole spin, demonstrating for the first time that such long-sought alignment is possible in the absence of large-scale poloidal magnetic fields.
There has been significant recent interest in studying multiscale characteristics of current and next-generation batteries, including lithium-metal and lithium-sulfur batteries. Advances in computing power make researchers believe that the detailed multiscale models can be efficiently simulated to arrive at the insights for the degradation and performance loss; however, this is not true and special attention needs to be paid to local singularities, boundary layers, moving boundaries, etc. This article presents 2D examples that illustrate the importance of grid convergence studies, provides well-defined detailed models to test the efficiency of numerical schemes, and discusses the associated simulation challenges.
The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.
Solving the Euler equations is a fundamental component of simulating many physical phenomena ranging from high explosives to astrophysics. An equation of state (EOS) is a required piece that relates any two thermodynamic quantities to all other thermodynamic values. The presence of multiple materials within a control volume further complicates the solution requiring additional equations to describe the interaction of materials at a sub-grid level. Equations of state themselves can also come in many forms ranging from simple algebraic relations to more complicated differential equation models that describe material interactions over a broad range of physical conditions. In the latter case, the EOS is often pre-computed at a given set of grid points and provided in a tabular form where additional properties can be derived from the interpolation functions.
Accurately predicting unsteady wakes and vortex-dominated flows is essential to a wide range of engineering applications, including aircraft, rotorcraft, shipboard operations, bio-inspired unsteady flight and propulsion, wind turbines, and urban flows. While current CFD software can model the complete flow field and wake system, the computational costs incurred in high Reynolds number unsteady turbulent flow simulations often remain prohibitive for routine engineering use, particularly for applications involving moving components. Prior work has demonstrated that by adopting a vorticity-velocity formulation in a grid-based off-body flow solver (VorTran-M and VorTran-M2) one can lower these costs by several orders of magnitude when compared to conventional approaches. This paper describes the extensions made to VorTran-M2 to support turbulent flows, and associated benchmarking activity to assess its performance for problems involving strong stretching and diffusion processes, whose competing contributions to the vorticity field are core drivers of turbulent flow evolution. Predictions are presented for: (i) the Kida-Pelz problem whose inviscid form is of mathematical interest due to its apparent formation of singular flow in finite time; and (ii) the Taylor Green vortex arrangement, which has been extensively studied as a fundamental simulation challenge in the turbulent modeling community. Here, the results are used to evaluate the overall predictive ability and performance of two sub-grid scale models incorporated into VorTran-M2. Results indicate that the computational cost savings seen previously for inviscid and convection dominated problems extend to turbulent flow simulations supporting the viability of VorTran-M2 as a low cost means for accurately modeling the far-field and background flow, particularly when long duration vorticity evolution is of interest.
The $k - ω$ Reynolds Averaged Navier Stokes (RANS) model is one of the industry standard approaches for modeling of turbulent flows. It performs better than the $k - ϵ$ model for low Reynolds number flows and is also more suitable for boundary layers with adverse pressure gradients. Major drawback of the model, however, is that the asymptotic value of $ω$ at the walls is singular, necessitating the use of a contrived “sufficiently” large value for $ω$ as the boundary condition for its transport equation. Here, this invariably leads to the solution being sensitive to near wall grid spacing. While an acceptable solution for low order (finite volume) methods, the excessive near wall gradients lead to persistent numerical stability issues in high order codes. To alleviate the problem, specifically in the context of the high order spectral element code Nek5000, a regularized $k - ω$ approach was formulated in our prior work (Tomboulides et al., 2018). The formulation, however, relies on the use of wall distance and its gradients for modeling the closure terms and can pose problems for simulations in complex geometries. This work presents a novel implementation of the $k - τ$ RANS model in Nek5000, where $τ = 1/ω$, eliminating the need for regularization, owing to the asymptotically bounded behavior of the source terms in the $τ$ transport equation, and also eliminating dependence on wall distance. Robustness and stability of the $k - τ$ model is ensured through implicit treatment of the source terms and their careful numerical implementation and demonstrated through several cases aimed at verification and validation. Studies include both canonical and engineering relevant problems, viz., turbulent channel flow, pipe flow, backward facing step, flow over NACA 0012 airfoil and flow in a T-junction. Results from the $k - τ$ model are shown to be consistent with regularized $k - ω$ model and also with the $k - ω$ SST model in OpenFOAM (for select studies). Comparison with experimental data is also shown, where available, to bolster validation efforts for the $k - τ$ model implementation through prediction of key turbulent quantities of interest.