SEARCH · Search NASA

Results for “Problem structuring methods”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

DOE OSTI2022

GAMSOR: Gamma Source Preparation and DIF3D Flux Solution (Rev. 2)

Nuclear reactors that rely upon the fission reaction have two modes of thermal energy deposition in the reactor system: neutron absorption and gamma absorption. The gamma rays are typically generated by neutron capture reactions or during the fission process which means the primary driver of energy production is of course the neutron interaction. In conventional reactor physics methods, the gamma heating component is ignored such that the gamma absorption is forced to occur at the gamma emission site. For experimental reactor systems like EBR-II and FFTF, the placement of structural pins and assemblies internal to the core leads to problems with power heating predictions because there is no fission power source internal to the assembly to dictate a spatial distribution of the power.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2026

Hydride and Seek: Comparing Crystallographic Hydride Placement Techniques with an Open-Shell Cobalt Complex

Locating hydrides is crucial in organometallic chemistry but difficult to do accurately using X-ray diffraction. Electron diffraction has been proposed as a way to overcome this problem but has not been systematically compared to neutron diffraction and to quantum crystallography (Hirshfeld atom refinement, HAR) to test this hypothesis. Here, we present a comparative analysis of methods for a terminal cobalt hydride complex by comparing a single-crystal neutron diffraction reference structure to results from single-crystal X-ray diffraction with and without Hirshfeld atom refinement (HAR, NoSpherA2), density functional theory (DFT), and electron diffraction (3D-ED/MicroED) refined under kinematical and dynamical formalisms. Conventional X-ray diffraction gives lower precision than neutron diffraction as expected. Despite expected improvements, HAR gives systematic deviation from the neutron benchmark. Interestingly, optimized DFT equilibrium geometries are closer to the neutron value than the value from HAR. On the other hand, electron diffraction with a high-quality data set coupled with dynamical refinement localizes the hydride in difference maps and gives excellent agreement with the neutron data. Dynamical refinement is crucial, as kinematical refinement does not allow assignment of a hydride peak. This cross-modal comparison defines the conditions under which 3D-ED/MicroED delivers high-precision metal–hydride distances for this open-shell cobalt hydride.

anions↗

DOE OSTI2024

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Monte Carlo control loops for cosmic shear cosmology with DES Year 1 data

Weak lensing by large-scale structure is a powerful probe of cosmology and of the dark universe. This cosmic shear technique relies on the accurate measurement of the shapes and redshifts of background galaxies and requires precise control of systematic errors. Monte Carlo control loops (MCCL) is a forward modeling method designed to tackle this problem. It relies on the ultra fast image generator (UFig) to produce simulated images tuned to match the target data statistically, followed by calibrations and tolerance loops. Here, we present the first end-to-end application of this method, on the Dark Energy Survey (DES) Year 1 wide field imaging data. We simultaneously measure the shear power spectrum $C_ℓ$ and the redshift distribution $n(z)$ of the background galaxy sample. The method includes maps of the systematic sources, point spread function (PSF), an approximate Bayesian computation (ABC) inference of the simulation model parameters, a shear calibration scheme, and a fast method to estimate the covariance matrix. We find a close statistical agreement between the simulations and the DES Y1 data using an array of diagnostics. In a nontomographic setting, we derive a set of $C_ℓ$ and $n(z)$ curves that encode the cosmic shear measurement, as well as the systematic uncertainty. Following a blinding scheme, we measure the combination of $Ω_m$, $σ_8$, and intrinsic alignment amplitude $A_{IA}$, defined as $S_8D_{IA}=σ_8(Ω_m/0.3)^{0.5}D_{IA}$, where $D_{IA}=1-0.11(A_{IA}-1)$. We find $S_8D_{IA}=0.8954_{-0.039}^{+0.054}$, where systematics are at the level of roughly 60% of the statistical errors. We discuss these results in the context of earlier cosmic shear analyses of the DES Y1 data. Our findings indicate that this method and its fast runtime offer good prospects for cosmic shear measurements with future wide-field surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗

DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Implicit and coupled fluid plasma solver with adaptive Cartesian mesh and its applications to non-equilibrium gas discharges

In this work, we present a new fluid plasma solver with adaptive Cartesian mesh (ACM) based on a full-Newton (nonlinear, implicit) scheme for non-equilibrium gas discharge plasma. The electrons and ions are described using drift-diffusion approximation coupled to Poisson equation for the electric field. The electron-energy transport equation is solved to account for electron thermal conductivity, Joule heating, and energy loss of electrons in collisions with neutral species. The rate of electron-induced ionization is a function of electron temperature and could also depend on electron density (important for plasma stratification). The ion and gas temperature are kept constant. The transport equations are discretized using a non-isothermal Scharfetter-Gummel scheme to resolve possible large temperature gradients in the sheaths. We demonstrate the new solver for simulations of direct current (DC) and radiofrequency (RF) discharges. The implicit treatment of the coupled equations allows using large time steps. The full-Newton method (FNM) enables fast nonlinear convergence at each time step, offering significantly improved simulation efficiency. We discuss the selection of time steps for solving different plasma problems. The new solver enables solving several problems we could not solve before with existing software: two- and three-dimensional structures of the entire DC discharges including cathode and anode regions, electric field reversals and double-layer formation, the normal cathode spot and an anode ring, moving striations in diffuse and constricted DC discharges, and standing striations in RF discharges. The developed FNM-ACM technique offers many benefits for tackling the disparity of gas discharge plasma systems' time scales and nonlinearity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

UNDERSTANDING THE SEMI-PROBABILISTIC APPROACHES IN STRUCTURAL RELIABILITY USED TO SET DESIGN RELIABILITY TARGETS FOR GRAPHITE COMPONENTS USING ASME BPVC METHODS

Graphite is a quasi-brittle material, resulting in random variability in tensile strength distributions. To account for the random variability in strength, HHA-3000 of the ASME BPVC provides two semi-probabilistic methods for qualifying nuclear graphite components in the design stage, the simplified and full assessments. The full and simplified assessments apply statistical methods to engineering-based design problems. This is often referred to as reliability-based design. Reliability-based design (RBD) is a method to develop reliable designs by accounting for uncertainties and result in small chances of failure when also considering safety factors. RBDs provide reliability targets using semi-probabilistic approaches. RBD is implemented in ASME BPVC HHA-3000 for nuclear graphite components, but is not specific to that application. There has been much confusion around the methods implemented in ASME BPVC HHA-3000 for qualifying nuclear graphite components. To address the confusion, this paper takes a hierarchical approach. First, the general RBD framework is presented. Then, the semi-probabilistic methods and the underlying assumptions implemented in the assessments are presented. The semi-probabilistic methods are separated from the engineering modifications that have been made to the assessments. After building the framework and underlying assumptions, the specific methods in the full and simplified assessments are explained in three steps: inputs, methods, outputs. The methods are applied to an H-451 reflector block. Tensile strength properties for other graphite grades are provided.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2022

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Adaptable SEC‐SAXS data collection for higher quality structure analysis in solution

Abstract The two major challenges in synchrotron size‐exclusion chromatography coupled in‐line with small‐angle x‐ray scattering (SEC‐SAXS) experiments are the overlapping peaks in the elution profile and the fouling of radiation‐damaged materials on the walls of the sample cell. In recent years, many post‐experimental analyses techniques have been developed and applied to extract scattering profiles from these problematic SEC‐SAXS data. Here, we present three modes of data collection at the BioSAXS Beamline 4–2 of the Stanford Synchrotron Radiation Lightsource (SSRL BL4‐2). The first mode, the High‐Resolution mode, enables SEC‐SAXS data collection with excellent sample separation and virtually no additional peak broadening from the UHPLC UV detector to the x‐ray position by taking advantage of the low system dispersion of the UHPLC. The small bed volume of the analytical SEC column minimizes sample dilution in the column and facilitates data collection at higher sample concentrations with excellent sample economy equal to or even less than that of the conventional equilibrium SAXS method. Radiation damage problems during SEC‐SAXS data collection are evaded by additional cleaning of the sample cell after buffer data collection and avoidance of unnecessary exposures through the use of the x‐ray shutter control options, allowing sample data collection with a clean sample cell. Therefore, accurate background subtraction can be performed at a level equivalent to the conventional equilibrium SAXS method without requiring baseline correction, thereby leading to more reliable downstream structural analysis and quicker access to new science. The two other data collection modes, the High‐Throughput mode and the Co‐Flow mode, add agility to the planning and execution of experiments to efficiently achieve the user's scientific objectives at the SSRL BL4‐2.

Matsui, Tsutomu↗

DOE OSTI2020

A Bayesian Approach for Estimating Uncertainty in Stochastic Economic Dispatch considering Wind Power Penetration

The increasing penetration of renewable energy resources in power systems, represented as random processes, converts the traditional deterministic economic dispatch problem into a stochastic one. To estimate the uncertainty in this stochastic economic dispatch problem for forecasting purposes, the conventional Monte-Carlo method is prohibitively time-consuming for practical applications. To overcome this problem, here we propose a novel Gaussian-process-emulator-based approach to quantify the uncertainty in the stochastic economic dispatch considering wind power penetration. Facing high-dimensional real-world data representing the correlated uncertainties from wind generation, a manifold-learning-based Isomap algorithm is proposed to efficiently represent the low-dimensional hidden probabilistic structure of the data. In this low-dimensional latent space, with Latin hypercube sampling as the computer experimental design, a Gaussian-process emulator is used, for the first time, to serve as a nonparametric, surrogate model for the original complicated stochastic economic dispatch model. This reduced-order representative allows us to evaluate the economic dispatch solver at sampled values with a negligible computational cost while maintaining a desirable accuracy. Simulation results conducted on the IEEE 118-bus test system reveal the impressive performance of the proposed method.

17 WIND ENERGY↗

DOE OSTI2024

A High-Performance Discrete-Element Framework for Simulating Flow and Jamming of Moisture Bearing Biomass Feedstocks

We developed and verified a high-performance open-source discrete element method (DEM) solver with simultaneously-supported feedstock-specific interaction models, including bonded-sphere, liquid bridge, cohesion, and non-linear contact models. Our solver uses parallel data structures on hybrid central and graphics processing unit (CPU/GPU) architectures, with favorable strong scaling performance observed for large problem sizes comprised of (100 M particles), and 4X single-node GPU speedup. The particles for corn stover feedstock were conceptualized and calibrated based on experimental measurements and results. Sensitivity analyses demonstrate that the mass flow rate from a wedge hopper is governed primarily by moisture content, friction coefficient, and cohesion energy density. The model is used to reproduce experimentally observed hopper jamming results, highlighting that the experimental no-flow trends can only be achieved by using non-spherical particles, liquid bridge and cohesion models, highlighting the importance of using concurrent feedstock specialized models for the effective representation of biomass material handling problems.

bioenergy↗

DOE OSTI2023

Analytical Large-Signal Modeling of Inverter-Based Microgrids With Koopman Operator Theory for Autonomous Control

The microgrid (MG) plays a crucial role in the energy transition, but its nonlinearity presents a significant challenge for large-signal power systems studies in the electromagnetic transient (EMT) time scale. In this paper, we develop a large-signal linear MG model that considers the detailed dynamics of the primary and zero-control levels based on the Koopman operator (KO) theory. Firstly, a set of observable functions is carefully designed to capture the nonlinear dynamics of the MG. The corresponding linear KO is then analytically derived based on these observables, resulting in the linear representation of the original nonlinear MG with observables as the new coordinate. The influence of external input on the system dynamics is also considered during the derivation, enabling control of the MG. We solve the voltage control problem using the traditional linear quadratic integrator (LQI) method to demonstrate that textbook linear control techniques can accurately control the original nonlinear MG via the developed KO-linearized MG model. Our proposed KO linearization method is generic and can be easily extended for different control objectives and MG structures using our analytical derivation procedure. Here, we validate the effectiveness of our methodology through various case studies.

25 ENERGY STORAGE↗

DOE OSTI2021

Accurate prediction of protein structures and interactions using a three-track neural network

DeepMind presented notably accurate predictions at the recent 14th Critical Assessment of Structure Prediction (CASP14) conference. We explored network architectures that incorporate related ideas and obtained the best performance with a three-track network in which information at the one-dimensional (1D) sequence level, the 2D distance map level, and the 3D coordinate level is successively transformed and integrated. The three-track network produces structure predictions with accuracies approaching those of DeepMind in CASP14, enables the rapid solution of challenging x-ray crystallography and cryo–electron microscopy structure modeling problems, and provides insights into the functions of proteins of currently unknown structure. The network also enables rapid generation of accurate protein-protein complex models from sequence information alone, short-circuiting traditional approaches that require modeling of individual subunits followed by docking. Here, we make the method available to the scientific community to speed biological research.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

A Filon-like integration strategy for calculating exact exchange in periodic boundary conditions: a plane-wave DFT implementation

An efficient and accurate approach for calculating exact exchange and other two-electron integrals has been developed for periodic electronic structure methods. Traditional approaches used for integrating over the Brillouin zone in band structure calculations, e.g. trapezoidal or Monkhorst-Pack, are not accurate enough for two-electron integrals. This is because their integrands contain multiple singularities over the double integration of the Brillouin zone, which with simple integration methods lead to very inaccurate results. A common approach to this problem has been to replace the Coulomb interaction with a screened Coulomb interaction that removes singularities from the integrands in the two-electron integrals, albeit at the inelegance of having to introduce a screening factor which must precomputed or guessed. Instead of introducing screened Coulomb interactions in an ad hoc way, the method developed in this work derives an effective screened potential using a Filon-like integration approach that is based only on the lattice parameters. This approach overcomes the limitations of traditionally defined screened Coulomb interactions for calculating two-electron integrals, and makes chemistry many-body calculations tractable in periodic boundary conditions. This method has been applied to several systems for which conventional DFT methods do not work well, including the reaction pathways for the addition of H 2 to phenol and Au$^{–}_{20}$ nanoparticle, and the electron transfer of a charge trapped state in the Fe(II) containing mica, annite.

36 MATERIALS SCIENCE↗

DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2022

Data-driven based coordinated smart inverter control for distributed energy resources

Smart inverters (SI) for distributed energy resources (DER) are becoming popular since they have the ability to stabilize as well as restore the voltage and frequency of power systems. Aiming at establishing the mathematical models combined with SI control methods, multiple optimization methods are developed. However, the computational complexity of solving such a mathematical model with various uncertainties limits the real-time application of the SI control. To conquer this challenge, a data-driven-based SI control approach is developed to achieve coordinated control in the high penetration DER system. First, an optimization problem for maximizing the active power generation and minimizing the power loss is designed using the Volt/VAR control. To reduce the time consumption, the recurrent neural network (RNN) is proposed to model the relationship between the uncertainties and control actions during the offline site. The RNN with different sub-structures such as the long short-term memory cell and gated recurrent unit cell are included to enrich the diversity of features. In the last stage, different experiment comparisons, including multiple uncertainties maps and stateof- art machine learning methods, are conducted to verify the effectiveness of the proposed method based on the IEEE 123 bus power system. The results demonstrate that the proposed method can effectively achieve a rapid and coordinated control with a lower error rate.

Qiu, Wei↗