Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal sizing method”

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

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗
DOE OSTI2023

Optimized purification methods for metallic contaminant removal from directly recycled Li-ion battery cathodes

Metallic contaminants pose a significant challenge to the viability of directly recycling Li-ion batteries. To date, few strategies exist to selectively remove metallic impurities from mixtures of shredded end-of-life material (black mass; BM) without concurrently damaging the structure and electrochemical performance of the target active material. We herein present tailored methods to selectively ionize two major contaminants—Al and Cu—while retaining a representative cathode (LiNi 0.33 Mn 0.33 Co 0.33 O 2 ; NMC-111) intact. This BM purification process is conducted at moderate temperatures in a KOH-based solution matrix. We rationally evaluate approaches to increase both the kinetic corrosion rate and the thermodynamic solubility of Al 0 and Cu 0 , and evaluate the impact of these treatment conditions on the structure, chemistry, and electrochemical performance of NMC. Specifically, we explore the impacts of chloride-based salts, a strong chelating agent, elevated temperature, and sonication on the rate and extent of contaminant corrosion, while concurrently evaluating the effects on NMC. The reported BM purification process is then demonstrated on samples of “simulated BM” containing a practically relevant 1 wt% concentration of Al or Cu. Increasing the kinetic energy of the purifying solution matrix through elevated temperature and sonication accelerates the corrosion of metallic Al and Cu, such that ∼100% corrosion of 75 μm Al and Cu particles is achieved within 2.5 hr. Further, we determine that effective mass transport of ionized species critically impacts the efficacy of Cu corrosion, and that saturated Cl – hinders rather than accelerates Cu corrosion by increasing solution viscosity and introducing competitive pathways for Cu surface passivation. The purification conditions do not induce bulk structural damage to NMC, and electrochemical capacity is maintained in half-cell format. Testing in full cells suggests that a limited quantity of residual surface species are present after treatment, which initially disrupt electrochemical behavior at the graphite anode but are subsequently consumed. Process demonstration on simulated BM suggests that contaminated samples—which prior to treatment show catastrophic electrochemical performance—can be recovered to pristine electrochemical capacity. The reported BM purification method offers a compelling and commercially viable solution to address contamination, particularly in the “fine” fraction of BM where contaminant sizes are on the same order of magnitude as NMC and where traditional separation approaches are unfeasible. Thus, this optimized BM purification technique offers a pathway towards viable direct recycling of BM feedstocks that would otherwise be unusable.

25 ENERGY STORAGE↗
DOE OSTI2024

Optimization on Manifolds via Graph Gaussian Processes

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Bayesian optimization↗
DOE OSTI2024

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

MedNAS: Multiscale Training-Free Neural Architecture Search for Medical Image Analysis

Deep neural networks have demonstrated impressive results in medical image analysis, but designing suitable architectures for each specific task is expertise dependent and time consuming. Neural architecture search (NAS) offers an effective means of discovering architectures. It has been highly successful in numerous applications, particularly in natural image classification. Yet, medical images possess unique characteristics, such as small regions and a wide variety of lesion sizes, that differentiate them from natural images. Furthermore, most current NAS methods struggle with high computational costs, especially when dealing with high-resolution image datasets. In this article, we present a novel evolutionary NAS method called multiscale training-free neural architecture search (MSTF-NAS) to address these challenges. Specifically, to accommodate the broad range of lesion region sizes in disease diagnosis, we develop a new reduction cell search space that enables the search algorithm to explicitly identify the optimal scale combination for multiscale feature extraction. Further, to overcome the issue of high computational costs, we utilize training-free indicators as performance measures for candidate architectures, which allows us to search for the optimal architecture more efficiently. More specifically, by considering the capability and simplicity of various networks, we formulate a multiobjective optimization problem that involves two training-free indicators and model complexity for candidate architectures. Extensive experiments on a large medical image benchmark and a publicly available breast cancer detection dataset are conducted. The empirical results demonstrate that our MSTF-NAS outperforms both human-designed architectures and current state-of-the-art NAS algorithms on both datasets, indicating the effectiveness of our proposed method.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

A method for convex black-box integer global optimization

Here we study the problem of minimizing a convex function on a nonempty, finite subset of the integer lattice when the function cannot be evaluated at noninteger points. We propose a new underestimator that does not require access to (sub)gradients of the objective; such information is unavailable when the objective is a blackbox function. Rather, our underestimator uses secant linear functions that interpolate the objective function at previously evaluated points. These linear mappings are shown to underestimate the objective in disconnected portions of the domain. Therefore, the union of these conditional cuts provides a nonconvex underestimator of the objective. We propose an algorithm that alternates between updating the underestimator and evaluating the objective function. We prove that the algorithm converges to a global minimum of the objective function on the feasible set. We present two approaches for representing the underestimator and compare their computational effectiveness. We also compare implementations of our algorithm with existing methods for minimizing functions on a subset of the integer lattice. We discuss the difficulty of this problem class and provide insights into why a computational proof of optimality is challenging even for moderate problem sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Application of thermal energy storage with electrified heating and cooling in a cold climate

Ground source heat pumps (GSHPs) have been shown to be an effective means of decarbonizing building heating and cooling, but the operation of these systems at scale presents challenges to sites and the grid due to increases in peak demand. Here, in this study, we investigate how the use of Thermal Energy Storage (TES), in the form of stratified water storage, could reduce the peak daily demand associated with GSHP systems and thus improve their cost effectiveness. This system was compared to a Combined Heat and Power (CHP) plant, to investigate the potential cost and emissions impacts of electrification on large energy users transitioning from high efficiency fossil fuel equipment. This study builds on previous research by using a significant campus area, and investigating the various impacts of an electrified system versus a state of the art fossil fuel system. An established method of TRNSYS modeling is used for the heat pumps and borehole heat exchangers (BHEs), along with the TES. The GSHP system with TES is modeled to follow industry standards and sized to provide an optimal balance of capital and operating costs. Costs were investigated for a unique large energy user rate structure, as well as for a more common generalized rate structure. The results show that the addition of TES to the GSHP system could reduce operating costs by 4.5%, but still incurs a 5.64% cost increase from the baseline CHP system. It is also shown, however, that a tactical integration of heat pumps into the CHP system is the most cost effective solution, only increasing the operating costs by 4.71%. Likewise, the impacts of different rate structures are highlighted, with the TES only resulting in 0.75% cost savings under the generalized utility rate. Furthermore, it is shown that thermal storage has great potential for demand reduction, with the addition of storage incurring a decrease of 7–22% in annual peak demand kW, dependent on the rate structure.

25 ENERGY STORAGE↗
DOE OSTI2020

FiXR : a framework to reconstruct fiber cross-sections from X-ray fiber diffraction experiments

Ab initio reconstruction methods have revolutionized the capabilities of small-angle X-ray scattering (SAXS), allowing the data-driven discovery of previously unknown molecular conformations, exploiting optimization heuristics and assumptions behind the composition of globular molecules. While these methods have been successful for the analysis of small particles, their impact on fibrillar assemblies has been more limited. The micrometre-range size of these assemblies and the complex interaction of their periodicities in their scattering profiles indicate that the discovery of fibril structures from SAXS measurements requires novel approaches beyond extending existing tools for molecular discovery. In this work, it is proposed to use SAXS measurements, together with diffraction theory, to infer the electron distribution of the average cross-section of a fiber. This cross-section is modeled as a discrete electron density with continuous support, allowing representations beyond binary distributions. Additional constraints, such as non-negativity or smoothness/connectedness, can also be added to the framework. The proposed approach is tested using simulated SAXS data from amyloid β fibril models and using measured data of Tobacco mosaic virus from SAXS experiments, recovering the geometry and density of the cross-sections in all cases. The approach is further tested by analyzing SAXS data from different amyloid β fibril assemblies, with results that are in agreement with previously proposed models from cryo-EM measurements. The limitations of the proposed method, together with an analysis of the robustness of the method and the combination with different experimental sources, are also discussed.

Biochemistry & Molecular Biology↗
DOE OSTI2024

Delta-Rice: A HDF5 Compression Plugin optimized for Digitized Detector Data

Delta-Rice is an HDF5 (The HDF Group et al., 2020) filter plugin that was developed to compress digitized detector signals recorded by the Nab experiment (Fry et al., 2019), a fundamental neutron physics experiment. This is a two-step process where incoming data is passed through a pre-processing filter and then compressed with Rice coding. A routine for determining the optimal pre-processing filter for a dataset is provided along with an example GPU deployment. When applied to data collected by the Nab data acquisition system, this method produced output files 29% their initial size, and was able to do so with an average read/write throughput in excess of 2 GB/s on a single CPU. Compared to the widely used Gzip compression routine, Delta-Rice reduces the file size by 33% more with over an order of magnitude increase in read/write throughput. Delta-Rice is available on CPU to users through the HDF5 library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Scalable and compact magnetocaloric heat pump technology

Magnetocaloric heat pumping (MCHP) promises to be more efficient than traditional vapor compression while also eliminating the deleterious effects of gaseous refrigerants. While MCHP devices have shown the temperature spans and efficiencies needed for different heating and cooling applications, they struggle to become commercially viable due to their large size and mass, and resultant high cost. This paper evaluates a baseline MCHP device and explores methods to boost its system power density (SPD). The key components of the baseline system are the gadolinium packed-particle bed active magnetic regenerator (AMR) and a magnetic source composed of permanent magnets and high permeability magnetic steel. To enhance the SPD, the paper evaluates maximizing the AMR volume, opting for first-order magnetocaloric materials, optimizing the magnet and AMR geometry, and reducing the size of magnets and magnetic steel parts. At larger thermal powers, increasing the AMR diameter and the number of magnetic poles were evaluated. Using finite element models, solid models, and estimates of magnetocaloric material performance, thermal powers ranging from 37 W to 44 kW at a nominal 10 K temperature span were projected, and SPD was estimated to improve from 6 W/kg to 81 W/kg. Neglecting end effects, an upper limit of 114 W/g is estimated. Compared to SPD of off-the-shelf compressors with similar environment temperatures, MCHP power density using gadolinium is competitive up to roughly 200 W of cooling power. This is extended to 1 kW when using LaFeSi alloys and up to 3 kW in the limiting case. In conclusion, these results indicate that the performance and mass of MCHP can match that of compressors, which is a critical step toward cost-competitive magnetocaloric technology.

42 ENGINEERING↗
DOE OSTI2021

Beyond single crystals: Imaging rubrene polymorphism across crystalline batches through lattice phonon Raman microscopy

Polymorphism is an issue troubling numerous scientific fields. A phenomenon where molecules can arrange in different orientations in a crystal lattice, polymorphism in the field of organic photovoltaic materials can dramatically change electronic properties of these materials. Rubrene is a benchmark photovoltaic material showing high carrier mobility in only one of its three polymorphs. To use rubrene in devices, it is important to quantify the polymorph distribution arising from a particular crystal growth method. However, current methods for characterizing polymorphism are either destructive or inefficient for batch scale characterization. Lattice phonon Raman spectroscopy has the ability to distinguish between polymorphs based on low frequency intermolecular vibrations. Here, we present here the addition of microscopy to lattice phonon Raman spectroscopy, which allows us to not only characterize polymorphs efficiently and nondestructively through Raman spectroscopy but also concurrently gain information on the size and morphology of the polymorphs. We provide examples for how this technique can be used to perform large, batch scale polymorph characterization for crystals grown from solution and physical vapor transport.We end with a case study showing how Raman microscopy can be used to efficiently optimize a green crystal growth method, selecting for large orthorhombic crystals desired for rubrene electronic device applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A Scalable Mixed-Integer Decomposition Method for Security-Constrained Optimal Power Flow with Complementarity Constraints

This project aimed to develop a scalable algorithm for security-constrained optimal power flow (SCOPF) under contingency scenarios. In particular, the SCOPF problem targeted in the GO Competition is challenging because of the nonconvexity, its nonsmoothness, and the problem size, which increases with the number of contingency events. Complementarity constraints imposed in post-contingency variables are particularly challenging because they lead to a violation of constraint qualifications at any feasible point.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Solutes that reduce yield strength anisotropies in magnesium from first principles

Using Labusch-type solid solution strengthening models parameterized with DFT-computed solute-dislocation interaction energies, we perform a computational search for 63 solutes across the periodic table to find those that lower anisotropy ratios (non-basal to basal CRSS) of magnesium potentially increasing its ductility per the von Mises criterion. For this purpose, we compute changes in strength for solutes as a function of composition and temperature, and compute anisotropy ratios for solutes that include both rare earth and non-rare earth elements. Here we specifically focus on solute-dislocation interaction energies in the following DFT-optimized dislocations as representative of three non-basal plastic deformation modes: $\langle c + a \rangle$ edge, (10$\bar1$2) tension twinning edge, and the (10$\bar{1}$1) compression twinning edge. We find that solute-induced changes in non-basal deformation modes can be approximated using a second-order polynomial in the size misfit of the solutes, which permits rapid screening of solutes. Our approach to identify solutes known to improve strengthening incorporates solute solubility, and suggests other solutes that not have been previously explored for strengthening. The 8 rare-earth solutes that our method suggests as the best, ordered by increasing anisotropy ratios at their optimal concentrations, are: Gd, Tb, Dy, Nd, Ho, Er, Tm, and Yb. The 12 non-rare-earth solutes that our method suggests as the best, ordered by increasing anisotropy ratios, are: Y, Mn, Sc, Pb, Ca, Ag, Bi, Tl, Zn, Li, Ga, and Al. Of these, Gd, Nd, Er, Yb, Y, Mn, Ca, Zn, Li, and Al are used in commercial Mg alloys.

36 MATERIALS SCIENCE↗
DOE OSTI2022

A numerical approach for detecting switch-like bistability in mass action chemical reaction networks with conservation laws

Theoretical analysis of signaling pathways can provide a substantial amount of insight into their function. One particular area of research considers signaling pathways capable of assuming two or more stable states given the same amount of signaling ligand. This phenomenon of bistability can give rise to switch-like behavior, a mechanism that governs cellular decision making. Investigation of whether or not a signaling pathway can confer bistability and switch-like behavior, without knowledge of specific kinetic rate constant values, is a mathematically challenging problem. Recently a technique based on optimization has been introduced, which is capable of finding example parameter values that confer switch-like behavior for a given pathway. Although this approach has made it possible to analyze moderately sized pathways, it is limited to reaction networks that presume a uniterminal structure. It is this limited structure we address by developing a general technique that applies to any mass action reaction network with conservation laws. In this paper we developed a generalized method for detecting switch-like bistable behavior in any mass action reaction network with conservation laws. The method involves (1) construction of a constrained optimization problem using the determinant of the Jacobian of the underlying rate equations, (2) minimization of the objective function to search for conditions resulting in a zero eigenvalue, (3) computation of a confidence level that describes if the global minimum has been found and (4) evaluation of optimization values, using either numerical continuation or directly simulating the ODE system, to verify that a bistability region exists. The generalized method has been tested on three motifs known to be capable of bistability. We have developed a variation of an optimization-based method for the discovery of bistability, which is not limited to uniterminal chemical reaction networks. Successful completion of the method provides an S-shaped bifurcation diagram, which indicates that the network acts as a bistable switch for the given optimization parameters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Optimizing bioenergy biofuel harvest: a comparative analysis of stepwise and integrated methods for economic and environmental sustainability

Switchgrass is a promising bioenergy feedstock due to its high biomass yield potential, adaptability to marginal lands, and low carbon intensity for feedstock production. However, accurate cost estimation and assessment of greenhouse gas (GHG) emissions for the energy-intensive harvesting process are essential for evaluating the sustainability of bioenergy. This study provides a comparative analysis of two harvesting methods: the Stepwise Method, which separates operations into multiple stages, and the Integrated Method, which combines mowing and raking into a single pass. The analysis was conducted under four scenarios based on field sizes and biomass yields. Using three years of field-scale switchgrass harvest data from 125 sites, GHG emissions, energy consumption, and harvesting costs were quantified using the GREET model and techno-economic analysis. Additionally, regression analysis identified key climate and operational factors affecting fuel consumption. The Stepwise method was the most cost-effective for large fields with high biomass yield, achieving the lowest harvesting costs ($37.70 per ton). In contrast, the Integrated Method performed better in small fields and low-yield conditions, reducing GHG emissions by 9 % and energy use by 5 %. Regression analysis confirmed that a larger field size reduced fuel consumption, while higher biomass yield and longer operational time increased fuel use. Maximum temperature also contributed to a slight increase in fuel consumption. Furthermore, these results provide actionable insights for optimizing harvesting strategies based on field-specific conditions and operational goals, contributing to the economic and environmental sustainability of bioenergy production.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

The persistence of large scale structures. Part I. Primordial non-Gaussianity

Abstract We develop an analysis pipeline for characterizing the topology of large scale structure and extracting cosmological constraints based on persistent homology . Persistent homology is a technique from topological data analysis that quantifies the multiscale topology of a data set, in our context unifying the contributions of clusters, filament loops, and cosmic voids to cosmological constraints. We describe how this method captures the imprint of primordial local non-Gaussianity on the late-time distribution of dark matter halos, using a set of N-body simulations as a proxy for real data analysis. For our best single statistic, running the pipeline on several cubic volumes of size 40 (Gpc/h) 3 , we detect f NL loc =10 at 97.5% confidence on ~ 85% of the volumes. Additionally wetest our ability to resolve degeneracies betweenthe topological signature of f NL loc and variation of σ 8 and argue that correctly identifying nonzero f NL loc in this case is possible via an optimal template method. Our method relies on information living at $\mathcal{O}$(10) Mpc/h, a complementary scale with respect to commonly used methods such as the scale-dependent bias in the halo/galaxy power spectrum. Therefore, while still requiring a large volume, our method does not require sampling long-wavelength modes to constrain primordial non-Gaussianity. Moreover, our statistics are interpretable: we are able to reproduce previous results in certain limits and we make new predictions for unexplored observables, such as filament loops formed by dark matter halos in a simulation box.

Astronomy & Astrophysics↗
DOE OSTI2024

A Method for Producing Hierarchical and Statistically Calibrated Predictions of Nuclear Material Properties from Existing Models

Computer vision-based analysis of micrographs of nuclear materials is an emerging technique for property prediction, synthetic route identification, and other material analysis tasks. These analysis tasks play a pivotal role in many material characterization applications such as signature development for treaty verification, process optimization, etc. The backbone in many of the recent computer vision-based techniques is a deep learning model, which takes a fixed-size set of pixels and provides a class prediction for that set of pixels. For example, previous work developed a deep convolutional neural network (CNN) to predict the synthetic route from a 256 px x 256 px patch taken from a larger image of uranium ore concentrates. In this work, we present several methods for first calibrating these models in a manner that they can provide accurate probabilities of their predictions’ veracity, and several methods of combining these probabilities. Overall, the combination of these two steps into a pipeline allows for full-image and even full-sample (where a sample has many images) predictions with associated confidence values. Finally, we show that one can also use the patch predictions and confidence to produce a visualization to map predicted constituents through the image. Results and examples for predicting and mapping uranium ore concentrates’ synthetic process from imagery will be presented.

artificial intelligence↗
DOE OSTI2021

hr-Adaptivity for nonconforming high-order meshes with the target matrix optimization paradigm

In this study, we present an \(hr\) -adaptivity framework for optimization of high-order meshes. This work extends the r -adaptivity method by Dobrev et al. (Comput Fluids, 2020), where we utilized the Target-Matrix Optimization Paradigm (TMOP) to minimize a functional that depends on each element’s current and target geometric parameters: element aspect-ratio , size , skew , and rotation . Since fixed mesh topology limits the ability to achieve the target size and aspect-ratio at each position, in this paper, we augment the r -adaptivity framework with nonconforming adaptive mesh refinement to further reduce the error with respect to the target geometric parameters. The proposed formulation, referred to as \(hr\) -adaptivity, introduces TMOP-based quality estimators to satisfy the aspect-ratio target via anisotropic refinements and size target via isotropic refinements in each element of the mesh. The methodology presented is purely algebraic, extends to both simplices and hexahedra/quadrilaterals of any order, and supports nonconforming isotropic and anisotropic refinements in 2D and 3D. Using a problem with a known exact solution, we demonstrate the effectiveness of \(hr\) -adaptivity over both r - and \(h\) -adaptivity in obtaining similar accuracy in the solution with significantly fewer mesh nodes. We also present several examples that show that \(hr\) -adaptivity can help satisfy geometric targets even when \(r\) -adaptivity fails to do so, due to the topology of the initial mesh.

42 ENGINEERING↗