Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm testing”

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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Nonlinear control of safety factor gradient in tokamaks using spatially variable electron cyclotron current drives

Active control of plasma properties may be necessary to achieve stable operation of next-generation tokamaks over large time scales. Such control algorithms can regulate the plasma properties to avoid the onset of magnetohydrodynamic (MHD) instabilities. For instance, the global and local properties of the safety factor profile are linked to the onset of neoclassical tearing modes (NTMs). This work proposes a model-based control approach for deterring/delaying NTMs through active modulation of one of the safety factor properties - the gradient of the safety factor profile at a particular rational safety factor surface. In particular, a novel control-oriented model for the local safety factor gradient is developed. The nonlinear control model is governed by a nonautonomous ordinary differential equation that accounts for a given rational safety factor surface’s spatial variation over time. Further, to improve the controllability of the spatially evolving parameter, the control model treats ECH&CD positions, along with noninductive powers, as controllable variables. A nonlinear control algorithm based on feedback linearization with optimization is synthesized to achieve the objective of regulating the safety factor gradient around a given target. The proposed algorithm allocates optimal ECH&CD positions, in addition to auxiliary powers, at each time instant as the rational safety factor surface drifts to locations with a low control authority. Stability guarantees of the proposed control law are also discussed in this work. The proposed algorithm is tested for a DIII-D tokamak scenario in nonlinear simulations carried out using the Control Oriented Transport SIMulator (COTSIM). Both fixed and moving ECH&CD cases are studied, and their outcomes are compared. Simulation results demonstrate that enthusiastic regulation of the safety factor gradient can be achieved during the ramp-up and flat-top phases of tokamak operation in both fixed and moving ECH&CD cases. However, real-time updates of ECH&CD positions can prevent the saturation of auxiliary powers.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Nonlinear control of the minimum safety factor in tokamaks by optimal allocation of spatially moving electron cyclotron current drive

The minimum value of the safety factor profile is related to the magnetohydrodynamic (MHD) stability of the plasma confined in a tokamak. Therefore, active control of the minimum safety factor may mitigate MHD instabilities that can degrade or even terminate plasma confinement. Typically, in most tokamak scenarios, the minimum safety factor evolves spatially with time, i.e., the location at which the safety factor achieves the minimum value changes with time. In addition to the inherent nonlinearities in the minimum safety factor evolution, its spatial variation makes the control design challenging. In particular, complexity in control design may arise from the need for time-dependent nonlinear models that account for spatial variation of the minimum safety factor. Furthermore, the minimum safety factor may drift to locations where the actuator authority is low. The problem of minimum safety factor control with target location tracking and moving electron cyclotron current drive (ECCD) is addressed in this work. A nonlinear time-dependent model that incorporates the spatial variation of the minimum safety factor is presented. A nonlinear controller based on optimal feedback linearization is developed to track a target minimum safety factor. The proposed controller treats the ECCD position as a controllable variable. In other words, the controller prescribes the ECCD position (in addition to the non-inductive powers) in real time based on an optimal criterion that is defined a priori. This work also presents the steps necessary to integrate the minimum safety factor controller with a total energy controller to achieve multiple control objectives simultaneously. In conclusion, the proposed integrated control algorithm is tested using nonlinear simulations in the Control Oriented Transport SIMulator (COTSIM) for a DIII-D tokamak scenario.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

A space-time smooth artificial viscosity method with wavelet noise indicator and shock collision scheme, Part 2: The 2-D case

This is the second part to our companion paper. Herein, we generalize to two space dimensions the C-method developed in for adding localized, space-time smooth artificial viscosity to nonlinear systems of conservation laws that propagate shock waves, rarefaction waves, and contact discontinuities. For gas dynamics, the C-method couples the Euler equations to scalar reaction-diffusion equations, which we call C-equations, whose solutions serve as space-time smooth artificial viscosity indicators for shocks and contacts. We develop a high-order numerical algorithm for gas dynamics in 2-D which can accurately simulate the Rayleigh-Taylor (RT) instability with Kelvin-Helmholtz (KH) roll-up of the contact discontinuity, as well as shock collision and bounce-back. Solutions to our C-equations not only indicate the location of the shocks and contacts, but also track the geometry of the evolving fronts. This allows us to implement both directionally isotropic and anisotropic artificial viscosity schemes, the latter adding diffusion only in directions tangential to the evolving front. We additionally produce a novel shock collision indicator function, which naturally activates during shock collision, and then smoothly deactivates. Moreover, we implement a high-frequency 2-D wavelet-based noise detector together with an efficient and localized noise removal algorithm. To test the methodology, we use a highly simplified WENO-based discretization scheme. We provide numerical results for some classical 2-D test problems, including the RT problem, the Noh problem, a circular explosion problem from the Liska & Wendroff [13] review paper, the Sedov blast wave problem, the double Mach 10 reflection test, and a shock-wall collision problem. In particular, we show that our artificial viscosity method can eliminate the wall-heating phenomenon for the Noh problem, and thereby produce an accurate, non-oscillatory solution, even though our simplified WENO-type scheme fails to run for this problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A coupled discontinuous Galerkin-Finite Volume framework for solving gas dynamics over embedded geometries

Herein, we present a computational framework for solving the equations of inviscid gas dynamics using structured grids with embedded geometries. The novelty of the proposed approach is the use of high-order discontinuous Galerkin (dG) schemes and a shock-capturing Finite Volume (FV) scheme coupled via an hp adaptive mesh refinement (hp-AMR) strategy that offers high-order accurate resolution of the embedded geometries. The hp-AMR strategy is based on a multi-level block-structured domain partition in which each level is represented by block-structured Cartesian grids and the embedded geometry is represented implicitly by a level set function. The intersection of the embedded geometry with the grids produces the implicitly-defined mesh that consists of a collection of regular rectangular cells plus a relatively small number of irregular curved elements in the vicinity of the embedded boundaries. High-order quadrature rules for implicitly-defined domains enable high-order accuracy resolution of the curved elements with a cell-merging strategy to address the small-cell problem. The hp-AMR algorithm treats the system with a second-order finite volume scheme at the finest level to dynamically track the evolution of solution discontinuities while using dG schemes at coarser levels to provide high-order accuracy in smooth regions of the flow. On the dG levels, the methodology supports different orders of basis functions on different levels. The space-discretized governing equations are then advanced explicitly in time using high-order Runge-Kutta algorithms. Numerical tests are presented for two-dimensional and three-dimensional problems involving an ideal gas. The results are compared with both analytical solutions and experimental observations and demonstrate that the framework provides high-order accuracy for smooth flows and accurately captures solution discontinuities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Generalizing the compressible pairwise interaction extended point-particle model

Ejecta physics plays an important role in material interfaces that are impacted by a strong shock wave. When a shock impacts a rough surface of solid material and melts it, the Richtmyer–Meshkov instability grows perturbations on the surface, which can eject particles. After release, the ejecta travel through the post-shock compressible flow. To accurately simulate a large number of ejecta particles, an Euler–Lagrange approach is preferred, which requires modeling the subgrid-scale physics involved with fluid–particle interactions. We generalize the previous work from Hsiao et al. (2023) to consider systems of moving particles subject to any loading shock. The following improvements were made: (1) Particles are allowed to move relative to each other (2) Non-planar shocks are accounted for along with allowing for variable shock speeds. As a result, the generalized algorithm was tested with particle-resolved simulations for canonical test cases. The results of these tests are discussed and analyzed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗
DOE OSTI2022

Seeking Repeating Anthropogenic Seismic Sources: Implications for Seismic Velocity Monitoring at Fault Zones

Abstract Seismic velocities in rocks are highly sensitive to changes in permanent deformation and fluid content. The temporal variation of seismic velocity during the preparation phase of earthquakes has been well documented in laboratories but rarely observed in nature. It has been recently found that some anthropogenic, high‐frequency (>1 Hz) seismic sources are powerful enough to generate body waves that travel down to a few kilometers and can be used to monitor fault zones at seismogenic depth. Anthropogenic seismic sources typically have fixed spatial distribution and provide new perspectives for velocity monitoring. In this work, we propose a systematic workflow to seek such powerful seismic sources in a rapid and straightforward manner. We tackle the problem from a statistical point of view, considering that persistent, powerful seismic sources yield highly coherent correlation functions (CFs) between pairs of seismic sensors. The algorithm is tested in California and Japan. Multiple sites close to fault zones show high‐frequency CFs stable for an extended period of time. These findings have great potential for monitoring fault zones, including the San Jacinto Fault and the Ridgecrest area in Southern California, Napa in Northern California, and faults in central Japan. However, extra steps, such as beamforming or polarization analysis, are required to determine the dominant seismic sources and study the source characteristics, which are crucial to interpreting the velocity monitoring results. Train tremors identified by the present approach have been successfully used for seismic velocity monitoring of the San Jacinto Fault in previous studies.

58 GEOSCIENCES↗
DOE OSTI2019

Fast and interpretable classification of small X-ray diffraction datasets using data augmentation and deep neural networks

X-ray diffraction (XRD) data acquisition and analysis is among the most time-consuming steps in the development cycle of novel thin-film materials. We propose a machine-learning-enabled approach to predict crystallographic dimensionality and space group from a limited number of thin-film XRD patterns. We overcome the scarce-data problem intrinsic to novel materials development by coupling a supervised machine learning approach with a model-agnostic, physics-informed data augmentation strategy using simulated data from the Inorganic Crystal Structure Database (ICSD) and experimental data. As a test case, 115 thin-film metal-halides spanning 3 dimensionalities and 7 space-groups are synthesized and classified. After testing various algorithms, we develop and implement an all convolutional neural network, with cross-validated accuracies for dimensionality and space-group classification of 93% and 89%, respectively. We propose average class activation maps, computed from a global average pooling layer, to allow high model interpretability by human experimentalists, elucidating the root-causes of misclassification. Finally, we systematically evaluate the maximum XRD pattern step size (data acquisition rate) before loss of predictive accuracy occurs, and determine it to be 0.16° 2θ, which enables an XRD pattern to be obtained and classified in 5.5 minutes or less.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Fused x-ray and fast neutron CT reconstruction for imaging large and dense objects

Megavolt x-ray computed tomography (CT) is a powerful tool for three-dimensional characterization. However, its utility is limited for large objects composed of high-atomic number (Z) materials, where x rays fail to penetrate. Information from fast neutron CT (FNCT) can complement x-ray CT reconstructions since fast neutrons can more readily penetrate high-Z objects. In this work, we demonstrate a method for combining FNCT and x-ray CT data to create a single reconstruction, more accurate than could be achieved with either x rays or fast neutrons alone. The algorithm was tested on an exemplar comprising multiple concentric, nested cylinders of different materials. Simulated and empirical x-ray CT data were acquired for the exemplar using a 9 MV bremsstrahlung spectrum. Additional simulated and empirical FNCT data were acquired using an accelerator based fast neutron source. The FNCT data were used to synthesize x-ray CT data and augment the x-ray CT data missing due to lack of penetration. This approach mitigates artifacts that would otherwise negatively affect the accuracy and resolution of a single-modality reconstructed volume.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

An Efficient Sweep-Based Solver for the S N Equations on High-Order Meshes

In this study, we propose a graph-based sweep algorithm for solving the steady-state, monoenergetic discrete ordinates on meshes of high-order (HO) curved mesh elements. Our spatial discretization consists of arbitrarily HO discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights. Once the set of removed edges is determined, transport sweeps are performed by lagging the upwind dependency associated with the removed edges. The proposed algorithm is tested on several two-dimensional and three-dimensional meshes composed of HO curved mesh elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Improving the accuracy and efficiency of quantum connected moments expansions

The still-maturing noisy intermediate-scale quantum technology faces strict limitations on the algorithms that can be implemented efficiently. In the realm of quantum chemistry, the variational quantum eigensolver (VQE) algorithm has become ubiquitous, with many variations. Alternatively, a promising new avenue has been unraveled by the quantum variants of techniques grounded on expansions of the moments of the Hamiltonian, notably the connected moments expansion (CMX) and the Peeters–Devreese–Soldatov (PDS) energy functional. Common to those approaches is that, upon preparing an approximate ground state used to compute the necessary moments, the accuracy of the estimated ground state energy depends on the degree of overlap between the prepared state and the true ground state. Thus, we use the ADAPT-VQE algorithm to test shallow circuit construction strategies for the purpose of increasing the overlap with the exact ground state, validated by the sizable accuracy improvement herein reported in the PDS and CMX ground state energies. We also show that we can take advantage of the fact that the terms to be measured are highly recurring in different moments, incurring a substantial reduction in the number of necessary measurements. Finally, by coupling this measurement caching with a threshold that determines whether a given term is to be measured based on its associated scalar coefficient, we observe a further reduction in the number of circuit implementations while allowing for tunable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Blind chemical tagging with DBSCAN: prospects for spectroscopic surveys

Abstract Chemical tagging has great promise as a technique to unveil our Galaxy’s history. Grouping stars based on their similar chemistry can establish details of the star formation and merger history of the Milky Way. With precise measurements of stellar chemistry, chemical tagging may be able to group together stars born from the same gas cloud, regardless of their current positions and kinematics. Successfully tagging these birth clusters requires high-quality chemical space information and a good cluster-finding algorithm. To test the feasibility of chemical tagging on data from current and upcoming spectroscopic surveys, we construct a realistic set of synthetic clusters, creating both observed spectra and derived chemical abundances for each star. We use Density-Based Spatial Clustering of Applications with Noise (DBSCAN) to group stars based on their spectra or abundances; these groups are matched to input clusters and are found to be highly homogeneous and complete. The percentage of clusters with more than 10 members recovered is 40 per cent when tagging on abundances with uncertainties achievable with current techniques. Based on our fiducial model for the Milky Way, we predict recovering over 600 clusters with at least 10 observed members and 70 per cent membership homogeneity in a sample similar to the Apache Point Observatory Galactic Evolution Experiment survey. Tagging larger surveys like the GALAH survey and the future Milky Way Mapper in Sloan Digital Sky Survey V could recover tens of thousands of clusters at high homogeneity. Access to so many unique co-eval clusters will transform how we understand the star formation history and chemical evolution of our Galaxy.

Price-Jones, Natalie↗
DOE OSTI2019

Measurement of the splashback feature around SZ-selected Galaxy clusters with DES, SPT, and ACT

We present a detection of the splashback feature around galaxy clusters selected using the Sunyaev-Zel'dovich (SZ) signal. Recent measurements of the splashback feature around optically selected galaxy clusters have found that the splashback radius, rsp, is smaller than predicted by N-body simulations. A possible explanation for this discrepancy is that rsp inferred from the observed radial distribution of galaxies is affected by selection effects related to the optical cluster-finding algorithms. We test this possibility by measuring the splashback feature in clusters selected via the SZ effect in data from the South Pole Telescope SZ survey and the Atacama Cosmology Telescope Polarimeter survey. The measurement is accomplished by correlating these cluster samples with galaxies detected in the Dark Energy Survey Year 3 data. The SZ observable used to select clusters in this analysis is expected to have a tighter correlation with halo mass and to be more immune to projection effects and aperture-induced biases, potentially ameliorating causes of systematic error for optically selected clusters. We find that the measured r sp for SZ-selected clusters is consistent with the expectations from simulations, although the small number of SZ-selected clusters makes a precise comparison difficult. In agreement with previous work, when using optically selected redMaPPer clusters with similar mass and redshift distributions, r sp is ~2σ smaller than in the simulations. These results motivate detailed investigations of selection biases in optically selected cluster catalogues and exploration of the splashback feature around larger samples of SZ-selected clusters. Additionally, we investigate trends in the galaxy profile and splashback feature as a function of galaxy colour, finding that blue galaxies have profiles close to a power law with no discernible splashback feature, which is consistent with them being on their first infall into the cluster.

Shin, T.↗
DOE OSTI2022

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Self-Security for Grid-Interactive Smart Inverters Using Steady-State Reference Model

Smart inverters exchange information with other devices through a shared communication link, making the inverters more prone to receive harmful commands from external parties. This erroneous data can be received due to an anomaly in the system, such as a device fault, unintentional utility operator action, or a cyber-attack. In this paper, a device-level self-security strategy is implemented using reference models for a grid-interactive inverter to examine the incoming power setpoints, detect the anomalies, and protect the system accordingly. The PQ setpoints received from the utility supervisory controller are autonomously examined using the inverter’s normal and stable operating regions before engaging the setpoints to the inverter’s local controller. Grid parameters are estimated in real-time during the examination process. The efficacy of the self-security algorithm is tested using a three-phase 3-kVA SiC-MOSFET inverter and a 12-kW NHR 9410 regenerative grid emulator. The results verify that the proposed method can detect harmful PQ setpoints that can cause abnormal or unstable inverter operation.

Gursoy, Mehmetcan↗
DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids

Increase in the proliferation of distributed energy resources require real-time situational awareness for efficient grid operations. State estimation plays an important role for the real-time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hier-archical spectral clustering-based network partitioning algorithm followed by a decentralized compressive sensing (DCS)-based state estimation. The applicability of the proposed network partitioning algorithm is tested on an IEEE 123-bus network, an IEEE 8,500-node system, and a 6,000+ node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum number of edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6,000+ node distribution network after dividing the network into 18 optimal partitions. Simulation results show that the DCS-based state estimation recovers the system states with high accuracy and low complexity.

alternating direction method of multipliers↗
DOE OSTI2024

Distributed Automatic Generation Control Considering DPV Using T&D Dynamic Co-Simulation

The increasing adoption of distributed energy resources (DERs) over the last decade warrants a reconsideration of control of generation resources. This paper proposes a distributed Automatic Generation Control (AGC) using transmission-and-distribution (T&D) dynamic co-simulation framework for the efficient DPV frequency regulation services. The co-simulation framework allows AGC units to exchange the information for distributed AGC, based on their adopted communication network topology. As a result, a cost-effective automatic generation control is achieved with DPV and conventional generators. The proposed distributed AGC is based on the gossip algorithm in which the neighboring AGC units share the relevant local information with each other and updates their share of AGC regulation signal. Distributed photovoltaics (DPV) unit contribute to AGC response based on their headroom capacity via DER aggregators. The algorithm is tested on IEEE-14 bus transmission system under conditions of generation failure and random load variation to observe effective frequency regulations service offered by DPVs and other AGC units. The study shows that DPV can effectively participate in AGC with the proposed distributed control framework.

automatic generation control↗