Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adapted Grids”

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.

At least 757 records · Page 42

SIMULATING MAGNETOHYDRODYNAMICAL FLOW WITH CONSTRAINED TRANSPORT AND ADAPTIVE MESH REFINEMENT: ALGORITHMS AND TESTS OF THE AstroBEAR CODE

A description is given of the algorithms implemented in the AstroBEAR adaptive mesh-refinement code for ideal magnetohydrodynamics. The code provides several high-resolution shock-capturing schemes which are constructed to maintain conserved quantities of the flow in a finite-volume sense. Divergence-free magnetic field topologies are maintained to machine precision by collating the components of the magnetic field on a cell-interface staggered grid and utilizing the constrained transport approach for integrating the induction equations. The maintenance of magnetic field topologies on adaptive grids is achieved using prolongation and restriction operators which preserve the divergence and curl of the magnetic field across collocated grids of different resolutions. The robustness and correctness of the code is demonstrated by comparing the numerical solution of various tests with analytical solutions or previously published numerical solutions obtained by other codes.

79 ASTRONOMY AND ASTROPHYSICS↗

Parallel Processing of Adaptive Meshes with Load Balancing

Many scientific applications involve grids that lack a uniform underlying structure. These applications are often also dynamic in nature in that the grid structure significantly changes between successive phases of execution. In parallel computing environments, mesh adaptation of unstructured grids through selective refinement/coarsening has proven to be an effective approach. However, achieving load balance while minimizing interprocessor communication and redistribution costs is a difficult problem. Traditional dynamic load balancers are mostly inadequate because they lack a global view of system loads across processors. In this paper, we propose a novel and general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication topology, and compare its performance with a successful global load balancing environment, called PLUM, specifically created to handle adaptive unstructured applications. Our experimental results on an IBM SP2 demonstrate that the SBN-based load balancer achieves lower redistribution costs than that under PLUM by overlapping processing and data migration.

Das, Sajal K.↗

Parallel 3D Mortar Element Method for Adaptive Nonconforming Meshes

High order methods are frequently used in computational simulation for their high accuracy. An efficient way to avoid unnecessary computation in smooth regions of the solution is to use adaptive meshes which employ fine grids only in areas where they are needed. Nonconforming spectral elements allow the grid to be flexibly adjusted to satisfy the computational accuracy requirements. The method is suitable for computational simulations of unsteady problems with very disparate length scales or unsteady moving features, such as heat transfer, fluid dynamics or flame combustion. In this work, we select the Mark Element Method (MEM) to handle the non-conforming interfaces between elements. A new technique is introduced to efficiently implement MEM in 3-D nonconforming meshes. By introducing an "intermediate mortar", the proposed method decomposes the projection between 3-D elements and mortars into two steps. In each step, projection matrices derived in 2-D are used. The two-step method avoids explicitly forming/deriving large projection matrices for 3-D meshes, and also helps to simplify the implementation. This new technique can be used for both h- and p-type adaptation. This method is applied to an unsteady 3-D moving heat source problem. With our new MEM implementation, mesh adaptation is able to efficiently refine the grid near the heat source and coarsen the grid once the heat source passes. The savings in computational work resulting from the dynamic mesh adaptation is demonstrated by the reduction of the the number of elements used and CPU time spent. MEM and mesh adaptation, respectively, bring irregularity and dynamics to the computer memory access pattern. Hence, they provide a good way to gauge the performance of computer systems when running scientific applications whose memory access patterns are irregular and unpredictable. We select a 3-D moving heat source problem as the Unstructured Adaptive (UA) grid benchmark, a new component of the NAS Parallel Benchmarks (NPB). In this paper, we present some interesting performance results of ow OpenMP parallel implementation on different architectures such as the SGI Origin2000, SGI Altix, and Cray MTA-2.

Feng, Huiyu↗

Adaptive controller for forced oscillation suppression in the grid

A control system and method for an inverter-based resource device provided in a synchronous power grid. The control system includes at least one inverter based resource device connected to an electrical power system, and a controller module. The inverter based resource device includes a reference power Pref, a combination module and a transfer function. The inverter based resource device injects modulated power into the power system. The power system (which is represented by a transfer function in the control system) receives an undesirable forced oscillation, which is connected to a measuring device. A controller module processes the measured output and provides a control signal to the inverter based resource device. The controller is arranged to suppress a forced oscillation detected in the power system.

Guttromson, Ross↗

Mesh quality control for multiply-refined tetrahedral grids

A new algorithm for controlling the quality of multiply-refined tetrahedral meshes is presented in this paper. The basic dynamic mesh adaption procedure allows localized grid refinement and coarsening to efficiently capture aerodynamic flow features in computational fluid dynamics problems; however, repeated application of the procedure may significantly deteriorate the quality of the mesh. Results presented show the effectiveness of this mesh quality algorithm and its potential in the area of helicopter aerodynamics and acoustics.

Biswas, Rupak↗

Kestrel Results at Liftoff Conditions for a Space Launch System Configuration in Proximity to the Launch Tower

Aerodynamic data books for Space Launch System vehicles require databases for the integrated forces and moments and section loads during liftoff and transition to the ascent phase of flight. While the force and moment database can be generated from wind tunnel results, computational analyses are necessary to provide the extensive surface information required to generate proper lineloads. Of the two flight regimes, the liftoff problem is the more costly and complex situation to simulate, as it requires modeling of the vehicle in proximity to the launch tower. The effects of massive separation on the leeward pressure fields of both the tower and vehicle are not well captured with RANS methods, necessitating the use of more advanced methods, such as Delayed Detached Eddy Simulation, in conjunction with computational grids sufficiently refined to resolve the wakes. Details on the computational setup for employing the Kestrel flow solver to address the liftoff problem are presented. The methodology involves the use of independent unstructured near-body grids for the vehicle and the tower, overset by a solution adaptive Cartesian off-body grid. Results from the simulations are compared to experimental results from a test in the NASA Langley Research Center 14- by 22-Foot Subsonic Tunnel.

Computational fluid dynamics↗

Adaptation of virtual synchronous generators to dynamic conditions in power grids

Virtual synchronous generators (VSGs) are widely adopted as grid-forming controls for inverter-based resources. However, when grid conditions vary significantly as characterized by changes in short-circuit ratio (SCR) and the reactance-to-resistance (X/R) ratio, fixed-gain designs and the commonly used P–Q decoupling assumption can become inaccurate. Such conditions can degrade transient power performance, leading to oscillations, prolonged settling, and overshoot, particularly in stiff-grid operating points. This paper quantifies how grid strength and impedance-dependent coupling affect the active–reactive power dynamics of a conventional VSG over a broad range of SCR and X/R values. An adaptive VSG tuning framework is then developed by combining (i) a coupling-explicit, impedance-parameterized state-space model to enable systematic controller synthesis, (ii) a full-state-feedback law designed via pole placement to meet prescribed damping and settling-time specifications, and (iii) a physics-informed neural network (PINN)–based online grid-impedance estimator that updates controller gains in real time as grid conditions vary. Offline simulations in MATLAB/Simulink and real-time validation on an OPAL-RT platform show that the proposed method preserves consistent damping and settling behavior with reduced overshoot across wide SCR and X/R ranges, compared with fixed-gain VSG baselines.

Adaptive control↗

A multigroup moment-accelerated deterministic particle solver for 1-D time-dependent thermal radiative transfer problems

We introduce an efficient, robust, Lagrangian (characteristic-based) transport solver for 1-D time-dependent thermal radiative transfer (TRT) applications within the context of a moment-accelerated (High-Order/Low-Order, HOLO) algorithm. This novel transport algorithm inherits the best features of both particle methods (e.g., time accuracy, phase-space adaptivity, positivity) and deterministic, grid-based methods (e.g., no stochastic noise). Particles are adapted by the method of characteristics, with a time-dependent weight that accounts for stiff absorption and reemission process self-consistently. As a result, this approach is able to obtain accurate results while employing large time steps and a moderate number of particles (compared to Implicit Monte Carlo).

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

High Performance Fortran for Aerospace Applications

This paper focuses on the use of High Performance Fortran (HPF) for important classes of algorithms employed in aerospace applications. HPF is a set of Fortran extensions designed to provide users with a high-level interface for programming data parallel scientific applications, while delegating to the compiler/runtime system the task of generating explicitly parallel message-passing programs. We begin by providing a short overview of the HPF language. This is followed by a detailed discussion of the efficient use of HPF for applications involving multiple structured grids such as multiblock and adaptive mesh refinement (AMR) codes as well as unstructured grid codes. We focus on the data structures and computational structures used in these codes and on the high-level strategies that can be expressed in HPF to optimally exploit the parallelism in these algorithms.

Mehrotra, Piyush↗

Three-Dimensional Convective–Stratiform Echo-Type Classification and Convectivity Retrieval from Radar Reflectivity

The Echo Classification from COnvectivity (ECCO) algorithm identifies convective and stratiform types of radar echo in three dimensions. It is based on the calculation of reflectivity texture—a combination of the intensity and the heterogeneity of the radar echoes on each horizontal plane in a 3D Cartesian volume. Reflectivity texture is translated into convectivity, which is designed to be a quantitative measure of the convective nature of each 3D radar grid point. It ranges from 0 (100% stratiform) to 1 (100% convective). By thresholding convectivity, a more traditional qualitative categorization is obtained, which classifies radar echoes as convective, mixed, or stratiform. In contrast to previous algorithms, these echo-type classifications are provided on the full 3D grid of the reflectivity field. The vertically resolved classifications, in combination with temperature data, allow for subclassifications into shallow, mid-, deep, and elevated convective features, and low, mid-, and high stratiform regions—again in three dimensions. The algorithm was validated using datasets collected over the U.S. Great Plains during the PECAN field campaign. An analysis of lightning counts shows ~90% of lightning occurring in regions classified as convective by ECCO. A statistical comparison of ECCO echo types with the well-established GPM radar precipitation-type categories show 84% (88%) of GPM stratiform (convective) echo being classified as stratiform (convective) or mixed by ECCO. ECCO was applied to radar grids for the continental United States, the United Arab Emirates, Australia, and Europe, illustrating its robustness and adaptability to different radar grid characteristics and climatic regions.

Radars/Radar observations↗

A chimera grid scheme

A mesh system composed of multiple overset body-conforming grids is described for adapting finite-difference procedures to complex aircraft configurations. In this so-called 'chimera mesh,' a major grid is generated about a main component of the configuration and overset minor grids are used to resolve all other features. Methods for connecting overset multiple grids and modifications of flow-simulation algorithms are discussed. Computational tests in two dimensions indicate that the use of multiple overset grids can simplify the task of grid generation without an adverse effect on flow-field algorithms and computer code complexity.

Steger, J. L.↗

Three-Dimensional Multiscale MHD Model of Cometary Plasma Environments

First results of a three-dimensional multiscale MHD model of the interaction of an expanding cometary atmosphere with the magnetized solar wind are presented. The model starts with a supersonic and super-Alfvenic solar wind far upstream of the comet (25 Gm upstream of the nucleus) with arbitrary interplanetary magnetic field orientation. The solar wind is continuously mass loaded with cometary ions originating from a 10-km size nucleus. The effects of photoionization, electron impact ionization, recombination, and ion-neutral frictional drag are taken into account in the model. The governing equations are solved on an adaptively refined unstructured Cartesian grid using our new multiscale upwind scalar conservation laws-type numerical technique (MUSCL). We have named this the multiscale adaptive upwind scheme for MHD (MAUS-MHD). The combination of the adaptive refinement with the MUSCL-scheme allows the entire cometary atmosphere to be modeled, while still resolving both the shock and the diamagnetic cavity of the comet. The main findings are the following: (1) Mass loading decelerates the solar wind flow upstream of the weak cometary shock wave (M approximately equals 2, M(sub A) approximately equals 2), which forms at a subsolar standoff distance of about 0.35 Gm. (2) A cometary plasma cavity is formed at around 3 x 10(exp 3) km from the nucleus. Inside this cavity the plasma expands outward due to the frictional interaction between ions and neutrals. On the nightside this plasma cavity considerably narrows and a relatively fast and dense cometary plasma beam is ejected into the tail. (3) Inside the plasma cavity a teardrop-shaped inner shock is formed, which is terminated by a Mach disk on the nightside. Only the region inside the inner shock is the 'true' diamagnetic cavity. (4) The model predicts four distinct current systems in the inner coma: the density peak current, the cavity boundary current, the inner shock current, and finally the cross-tail current. (5) The calculated plasma parameters (magnetic field, plasma density, speed, and temperature) are in very good agreement with published Giotto observations.

Gombosi, Tamas I.↗

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗

Scenario generation for stochastic optimization problems via the sparse grid method

We study the use of sparse grids in the scenario generation (or discretization) problem in stochastic programming problems where the uncertainty is modeled using a continuous multivariate distribution. We show that, under a regularity assumption on the random function involved, the sequence of optimal objective function values of the sparse grid approximations converges to the true optimal objective function values as the number of scenarios increases. The rate of convergence is also established. We treat separately the special case when the underlying distribution is an affine transform of a product of univariate distributions, and show how the sparse grid method can be adapted to the distribution by the use of quadrature formulas tailored to the distribution. We numerically compare the performance of the sparse grid method using different quadrature rules with classic quasi-Monte Carlo (QMC) methods, optimal rank-one lattice rules, and Monte Carlo (MC) scenario generation, using a series of utility maximization problems with up to 160 random variables. The results show that the sparse grid method is very efficient, especially if the integrand is sufficiently smooth. In such problems the sparse grid scenario generation method is found to need several orders of magnitude fewer scenarios than MC and QMC scenario generation to achieve the same accuracy. As a result, it is indicated that the method scales well with the dimension of the distribution--especially when the underlying distribution is an affine transform of a product of univariate distributions, in which case the method appears scalable to thousands of random variables.

97 MATHEMATICS AND COMPUTING↗

MAGNETO-FRICTIONAL MODELING OF CORONAL NONLINEAR FORCE-FREE FIELDS. I. TESTING WITH ANALYTIC SOLUTIONS

We report our implementation of the magneto-frictional method in the Message Passing Interface Adaptive Mesh Refinement Versatile Advection Code (MPI-AMRVAC). The method aims at applications where local adaptive mesh refinement (AMR) is essential to make follow-up dynamical modeling affordable. We quantify its performance in both domain-decomposed uniform grids and block-adaptive AMR computations, using all frequently employed force-free, divergence-free, and other vector comparison metrics. As test cases, we revisit the semi-analytic solution of Low and Lou in both Cartesian and spherical geometries, along with the topologically challenging Titov–Démoulin model. We compare different combinations of spatial and temporal discretizations, and find that the fourth-order central difference with a local Lax–Friedrichs dissipation term in a single-step marching scheme is an optimal combination. The initial condition is provided by the potential field, which is the potential field source surface model in spherical geometry. Various boundary conditions are adopted, ranging from fully prescribed cases where all boundaries are assigned with the semi-analytic models, to solar-like cases where only the magnetic field at the bottom is known. Our results demonstrate that all the metrics compare favorably to previous works in both Cartesian and spherical coordinates. Cases with several AMR levels perform in accordance with their effective resolutions. The magneto-frictional method in MPI-AMRVAC allows us to model a region of interest with high spatial resolution and large field of view simultaneously, as required by observation-constrained extrapolations using vector data provided with modern instruments. The applications of the magneto-frictional method to observations are shown in an accompanying paper.

79 ASTRONOMY AND ASTROPHYSICS↗

On Projection of Safe Operation for Grid-Following Inverters - Grid Parameter Estimation

This work investigates the projection of safe operation for grid-following inverters using a reference model. This work applies recursive-least square and model reference adaptive estimation techniques to estimate the unknown grid parameters. The estimated grid parameters are used in a dynamic reference model to project the safe operation of the inverter. This work also demonstrates that the controller nonlinearity and parameter variations can cause unsafe operations, such as unexpected instability at low power levels, namely hidden mode of instability. This instability issue in the nominal operating range may occur for given control parameters in a weak-grid condition. The dynamic reference model for PQ-controlled inverters is applied to analyze this instability issue using the estimated grid parameters. Both adaptive identification techniques can estimate the unknown parameters accurately, and the dynamic reference model can safeguard inverters from an unsafe operation, i.e., hidden instability, by examining the incoming new power setpoints before engaging them to the local controller. The findings are experimentally verified using a small-scale two-level 208 V, 5 kVA inverter feeding a 12 kW NHR 9410 power grid emulator.

Hossen, Tareq↗

Prediction of Power Measurements Using Adaptive Filters

With the advent of smart grid concept, Internet of Things (IoT) and the deployment of smart meters, the cyberattack threats on power networks have increased due to the use of communication systems that can be accessed by adversaries. Attackers will have the ability to manipulate the outcomes of smart meters which in turn influence the core application of Energy Management System 9EMS): State Estimation (SE). Bad data analytic tools may fail to detect some attacks into measurements. Meanwhile, Machine Learning (ML) solutions have been proposed for detecting False Data Injection (FDI) attacks. However, there is a lack of ML time-series solutions presented in the state-of-the-art that is yet to be complex. In signal processing, time-series solutions do not only consider the signal, but also the statistics of the signal over time. Therefore, in this paper, a machine learning for time-series solutions is presented as an application to model the measurements of the power grid that are used in SE. The presented model takes into account adaptive linear and non-linear filters: Finite Impulse Response (FIR), and Infinite Impulse Response (IIR). The presented models are implemented and performed on the IEEE-118 bus system. The results indicate the advantage of applying those filters over the state-of-the-art machine learning solutions.

Hamad, Khaled↗