SEARCH · Search NASA

Results for “decomposition algorithms”

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 757 records · Page 42

All sources NASA NTRS DOE OSTI

DOE OSTI2017

Adsorption of CO on Low-Energy, Low-Symmetry Pt Nanoparticles: Energy Decomposition Analysis and Prediction via Machine-Learning Models

We present a systematic analysis of CO adsorption on Pt nanoclusters in the 0.2–1.5 nm size range with the aim of unraveling size-dependent trends and developing predictive models for site-specific adsorption behavior. Using an empirical-potential-based genetic algorithm and density functional theory (DFT) modeling, we show that there exists a size window (40–70 atoms) over which Pt nanoclusters bind CO weakly, the binding energies being comparable to those on (111) or (100) facets. The size-dependent adsorption energy trends are, however, distinctly nonmonotonic and are not readily captured using traditional descriptors such as d-band energies or (generalized) coordination numbers of the Pt binding sites. Instead, by applying machine-learning algorithms, we show that multiple descriptors, broadly categorized as structural and electronic descriptors, are essential for qualitatively capturing the CO adsorption trends. Nevertheless, attaining quantitative accuracy requires further refinement, and we propose the use of an additional descriptors—the fully frozen adsorption energy—that is a computationally inexpensive probe of CO–Pt bond formation. With these three categories of descriptors, we achieve an absolute mean error in CO adsorption energy prediction of 0.12 eV, which is similar to the underlying error of DFT adsorption calculations. Our approach allows for building quantitatively predictive models of site-specific adsorbate binding on realistic, low-symmetry nanostructures, which is an important step in modeling reaction networks as well as for rational catalyst design in general.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Domain decomposition in the GPU-accelerated Shift Monte Carlo code

The GPU solver within the Shift continuous-energy Monte Carlo neutron transport code has been extended to provide domain decomposition in addition to domain replication to enable the solution of problems with memory requirements exceeding the capacity of a single GPU. The strategy follows the Multiple Set, Overlapping Domain (MSOD) approach that is used in Shift’s CPU solver and integrates into the event-based algorithm used for Shift’s GPU solver. Furthermore, the ability to assign processors to spatial domains non-uniformly has been maintained. In this work, two different approaches for communicating particle data between domains are considered, and multiple criteria for load balancing problems have been investigated. Numerical results are presented for both fresh and depleted small modular nuclear reactor (SMR) cores. A parallel efficiency of approximately 80% was achieved with up to 16 spatial domains measured relative to full domain replication. A scaling study on the Summit supercomputer demonstrates a weak scaling parallel efficiency of over 90% on over 24000 GPUs.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Predicting Thermal Response in a Li-ion Cell on a UAV Fight Profile

As the energy storage devices continue to "pack" more energy in a small space, any damage, battery component failure, manufacturing defect, or electrically abusing the battery can lead to catastrophic thermal runaway events. A catastrophic thermal event in a cell leads to high temperature, in some instances spewing of battery materials due to gas development from side reactions initiated due to high internal temperatures. Also, a thermal runaway event can propagate from a single "failed" cell to the pack in a battery pack, leading to a more significant event. Mitigating a thermal runaway event is important in the commercial and automotive sectors. However, preventing such events in an electric aircraft (or air taxis) is paramount due to the lack of alternatives in the event of a failure. Battery prognostics algorithms allow the prediction of state-of-charge (SOC) and end-of-life (EOL) of a Li-ion battery in a UAV (unmanned air vehicle) [1]. For this presentation, we will extend this two-level battery predictive algorithm to predict SOC, EOL, and estimated maximum temperature during a simulated flight. The model is extended by integrating a lumped physics-driven thermal model for high current densities [2]. The parameters used to control SOC and EOL are maximum storable charge, time constant for Li-ion diffusivity in the carbon particles, and internal cell resistance. Cycling leads to an increase in the heat generated by an aged Li-ion cell with a LiyCoO2 (LCO) cathode and a LixC6 (MCMB) anode. The aging of a cell leads to increase in SEI layer thickness, the diffusion time for the lithium ions inside the electrodes, and the local reaction rates, in addition to the thermodynamic abuse caused by fixed cycling voltages controlled by a Battery Management System. As the battery ages, the cell resistance increases, while the onset temperature of the thermal runaway decreases (depends on the cell chemistry and cell abuse history). Any large deviation of the cell temperature from the estimated (expected) value can identify a faulty cell. Since SEI decomposition has the lowest onset temperature in the series of reactions leading to thermal runaway, the model considers the self-heating rate of the SEI decomposition as onset temperature (similar to Ref. [3]). The parameters in the Arrhenius equation for the SEI heating rate depend on the number of cycles, the cell's operating temperature, and the cell's abuse history [4,5]. Coupling the electrochemical, thermal, and aging model allow the prognostic algorithm to estimate a typical cell voltage and temperature as a function of age (cycling and calendar), whose departure from measured values from the BMS is used to identify a safety event. In addition, we will present the results from two simulated flight scenarios for a UAV: typical and extreme, since the power requirements vary significantly during take-off, landing, and changing altitudes, while the power requirements remain low during the cruise. For this presentation, the power requirement for a battery pack in a UAV is scaled to a single cell. This cell is cycled through a simulated profile, and the data is collected and used to predict a safety event.

Li-ion↗

DOE OSTI2020

Comparison of time-frequency-analysis techniques applied in building energy data noise cancellation for building load forecasting: A real-building case study

Time-frequency analysis that disaggregates a signal in both time and frequency domain is an important supporting technique for building energy analysis such as noise cancellation in data-driven building load forecasting. There is a gap in the literature related to comparing various time–frequency-analysis techniques, especially discrete wavelet transform (DWT) and empirical mode decomposition (EMD), to guide the selection and tuning of time–frequency-analysis techniques in data-driven building load forecasting. This article provides a framework to conduct a comprehensive comparison among thirteen DWT/EMD techniques with various parameters in a load forecasting modeling task. A real campus building is used as a case study for illustration. The DWT and EMD techniques are also compared under various data-driven modeling algorithms for building load forecasting. The results in the case study show that the load forecasting models trained with noise-cancelled energy data have increased their accuracy to 9.6% on average tested under unseen data. This study also shows that the effectiveness of DWT/EMD techniques depends on the data-driven algorithms used for load forecasting modeling and the training data. Hence, DWT/EMD-based noise cancellation needs customized selection and tuning to optimize their performance for data-driven building load forecasting modeling.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

Reconstruction framework advancements to support streaming for the ePIC detector at the EIC

The ePIC collaboration adopted the JANA2 framework to manage its reconstruction algorithms. This framework has since evolved substantially in response to ePIC’s needs. There have been three main design drivers: integrating cleanly with the Podio-based data models and other layers of the key4hep stack, enabling external configuration of existing components, and supporting timeframe splitting for streaming readout. The result is a unified component model featuring a new declarative interface for specifying inputs, outputs, parameters, services, and resources. This interface enables the user to instantiate, configure, and wire components via an external file. One critical new addition to the component model is a hierarchical decomposition of data boundaries into levels such as Run, Timeframe, PhysicsEvent, and Subevent. Two new component abstractions, Folder and Unfolder, are introduced in order to traverse this hierarchy, e.g. by splitting or merging. The pre-existing components can now operate at different event levels, and JANA2 will automatically construct the corresponding parallel processing topology. This means that a user may write an algorithm once, and configure it at runtime to operate on timeframes or on physics events. Overall, these changes mean that the user requires less knowledge about the framework internals, obtains greater flexibility with configuration, and gains the ability to reuse the existing abstractions in new streaming contexts.

Brei, Nathan [Thomas Jefferson National Accelerato↗

DOE OSTI2025

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗

NASA NTRS1996

Schwarz Methods: To Symmetrize or not to Symmetrize

A preconditioning theory for Schwarz methods is presented. The theory establishes sufficient conditions for multiplicative and additive Schwarz algorithms to yield self-adjoint positive definite preconditioners. It allows for the analysis and use of non-variational and non-convergent linear methods as preconditioners for conjugate gradient methods, and it is applied to domain decomposition and multigrid. This paper illustrates why symmetrizing may be a bad idea for linear methods. Numerical examples are presented for a test problem.

Holst, Michael↗

DOE OSTI2022

Extension of the high-resolution thermal-hydraulics code ESCOT to hexagonal core geometries for multi-physics calculations

The extension of the capabilities of the pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT to analyze hexagonal fueled cores and its performance are presented. ESCOT is an accurate yet fast core thermal-hydraulics solution aiming at high-fidelity and high-resolution multi-physics core analysis in the framework of massively parallel computing platforms. Its algorithm solution is based on the four-equation drift-flux model for two-phase calculations, these are numerically solved by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models such as turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analysis. ESCOT is parallelized by a double (radial and axial) domain decomposition that enables its highly parallelized execution. The coupling of the code with the neutronics whole core solver for hexagonal geometries nTRACER is described. The newly implemented ESCOT features are validated by comparing single assembly and full core steady state nTRACER-ESCOT solutions with nTRACER standalone internal one-dimensional T/H solver results. The validation problems are based on the VVER 440 and VVER 1000 cores. ESCOT results show differences within an acceptable range with respect to the simple 1D nTRACER built-in solver. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2021

Streaming Generalized Canonical Polyadic Tensor Decompositions

In this paper, we develop a method which we call OnlineGCP for computing the Generalized Canonical Polyadic (GCP) tensor decomposition of streaming data. GCP differs from traditional canonical polyadic (CP) tensor decompositions as it allows for arbitrary objective functions which the CP model attempts to minimize. This approach can provide better fits and more interpretable models when the observed tensor data is strongly non-Gaussian. In the streaming case, tensor data is gradually observed over time and the algorithm must incrementally update a GCP factorization with limited access to prior data. In this work, we extend the GCP formalism to the streaming context by deriving a GCP optimization problem to be solved as new tensor data is observed, formulate a tunable history term to balance reconstruction of recently observed data with data observed in the past, develop a scalable solution strategy based on segregated solves using stochastic gradient descent methods, describe a software implementation that provides performance and portability to contemporary CPU and GPU architectures and integrates with Matlab for enhanced usability, and demonstrate the utility and performance of the approach and software on several synthetic and real tensor data sets.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Regularizing the satellite temperature-retrieval problem through singular-value decomposition of the radiative transfer physics

A new technique is derived for retrieving atmospheric temperature profiles from satellite-measured spectral radiance that appears, in first tests, to effectively circumvent certain difficulties of other well-known and implemented techniques. This method provides an effective manner to avoid numerical instability without having to force the algorithm toward adherence to a priori statistics not dependent on the radiance measurements. This provides the opportunity to obtain more information from satellite sounding instruments, without encountering instabilities owing to overlapping weighting functions.

Thompson, Owen E.↗

DOE OSTI2016

Dynamics from noisy data with extreme timing uncertainty

Imperfect knowledge of the times at which ‘snapshots’ of a system are recorded degrades our ability to recover dynamical information, and can scramble the sequence of events. In X-ray free-electron lasers, for example, the uncertainty—the so-called timing jitter—between the arrival of an optical trigger (‘pump’) pulse and a probing X-ray pulse can exceed the length of the X-ray pulse by up to two orders of magnitude, marring the otherwise precise time-resolution capabilities of this class of instruments. The widespread notion that little dynamical information is available on timescales shorter than the timing uncertainty has led to various hardware schemes to reduce timing uncertainty. These schemes are expensive, tend to be specific to one experimental approach and cannot be used when the record was created under ill-defined or uncontrolled conditions such as during geological events. Here we present a data-analytical approach, based on singular-value decomposition and nonlinear Laplacian spectral analysis, that can recover the history and dynamics of a system from a dense collection of noisy snapshots spanning a sufficiently large multiple of the timing uncertainty. In this work, the power of the algorithm is demonstrated by extracting the underlying dynamics on the few-femtosecond timescale from noisy experimental X-ray free-electron laser data recorded with 300-femtosecond timing uncertainty. Using a noisy dataset from a pump-probe experiment on the Coulomb explosion of nitrogen molecules, our analysis reveals vibrational wave-packets consisting of components with periods as short as 15 femtoseconds, as well as more rapid changes, which have yet to be fully explored. Our approach can potentially be applied whenever dynamical or historical information is tainted by timing uncertainty.

47 OTHER INSTRUMENTATION↗

DOE OSTI2026

Goated: goal-oriented tensor decompositions in python

SAND2026-20464O Goated performs goal-oriented tensor decompositions in Python, enabling efficient compression of multi-dimensional simulation data. It extends common tensor decomposition methods by incorporating domain-specific knowledge, such as conservation laws in physics, through a penalty term in the optimization process. This approach improves data compression and modeling accuracy across various applications, including physics simulations, by using specialized algorithms and structure-aware subroutines to accelerate solver performance. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

NASA NTRS1998

Modal Behavior of Hemispheric Sea Ice Covers

Recent papers have described 18-year trends and annual oscillations in the Arctic and Antarctic sea ice extents, areas, and enclosed open water areas based on a newly-formulated 18.2-year ice concentration time series. This time series includes data for the entire Arctic and Antarctic ice covers, as well as for previously defined subregions consisting of 5 sectors in the Antarctic and 9 regions in the Arctic. It was obtained by fine-tuning the sea ice algorithm tie points individually for each of the four sensors used to acquire the data. In this paper, we extend these analyses to an examination of the intrinsic modes of these time series, obtained by means of Empirical Mode Decomposition, with emphasis on periodicities greater than the annual cycle. Quasibiennial and quasiquadrennial oscillations observed with a different technique and reported earlier for the first 8.8 years of this time series were also observed in the present series. However, the intrinsic modes were not monochromatic; they feature frequency as well as amplitude modulation within their respective frequency bands. Modal periods of up to 18 years are observed, with important implications for the trend analyses published earlier. These results are compared with the oscillations in the Length-of-Day and North Atlantic Oscillation parameters similarly determined for the same 18.2-year period.

Gloersen, Per↗

NASA NTRS2000

Analytical and Computational Properties of Distributed Approaches to MDO

Historical evolution of engineering disciplines and the complexity of the MDO problem suggest that disciplinary autonomy is a desirable goal in formulating and solving MDO problems. We examine the notion of disciplinary autonomy and discuss the analytical properties of three approaches to formulating and solving MDO problems that achieve varying degrees of autonomy by distributing the problem along disciplinary lines. Two of the approaches-Optimization by Linear Decomposition and Collaborative Optimization-are based on bi-level optimization and reflect what we call a structural perspective. The third approach, Distributed Analysis Optimization, is a single-level approach that arises from what we call an algorithmic perspective. The main conclusion of the paper is that disciplinary autonomy may come at a price: in the bi-level approaches, the system-level constraints introduced to relax the interdisciplinary coupling and enable disciplinary autonomy can cause analytical and computational difficulties for optimization algorithms. The single-level alternative we discuss affords a more limited degree of autonomy than that of the bi-level approaches, but without the computational difficulties of the bi-level methods. Key Words: Autonomy, bi-level optimization, distributed optimization, multidisciplinary optimization, multilevel optimization, nonlinear programming, problem integration, system synthesis

Alexandrov, Natalia M.↗

DOE OSTI2019

Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system

Here, we develop a stochastic optimization model for scheduling a hybrid solar-battery storage system. Solar power in excess of the promise can be used to charge the battery, while power short of the promise is met by discharging the battery. We ensure reliable operations by using a joint chance constraint. Models with a few hundred scenarios are relatively tractable; for larger models, we demonstrate how a Lagrangian relaxation scheme provides improved results. To further accelerate the Lagrangian scheme, we embed the progressive hedging algorithm within the subgradient iterations of the Lagrangian relaxation. Lastly, we investigate several enhancements of the progressive hedging algorithm, and find bundling of scenarios results in the best bounds.

14 SOLAR ENERGY↗

DOE OSTI2021

Robust Importance Sampling for Bayesian Model Calibration with Spatio-Temporal Data

This paper addresses two challenges in Bayesian calibration: 1) computational speed of existing sampling algorithms, and 2) calibration with spatio-temporal responses. The commonly used Markov Chain Monte Carlo (MCMC) approaches require many sequential model evaluations making the computational expense prohibitive. This paper proposes an efficient sampling algorithm: iterative importance sampling with genetic algorithm (IISGA). While iterative importance sampling enables computational efficiency, the genetic algorithm enables robustness by preventing sample degeneration and avoids getting stuck in multimodal search spaces. An inflated likelihood further enables robustness in high-dimensional parameter spaces by enlarging the target distribution. Spatio-temporal data complicate both surrogate modeling, which is necessary for expensive computational models, and the likelihood estimation. In this work, singular value decomposition is investigated for reducing the high-dimensional field data to a lower-dimensional space prior to Bayesian calibration. Then the likelihood is formulated and Bayesian inference is performed in the lower-dimension, latent space. An illustrative example is provided to demonstrate IISGA relative to existing sampling methods, and then IISGA is employed to calibrate a thermal battery model with 26 uncertain calibration parameters and spatio-temporal response data.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Vibrations of Elastic Shells of Revolution Partially Filled with Ideal Liquid

We propose an algorithm for the numerical analyses of vibrations of elastic shells of revolution partially filled with ideal incompressible liquids. In the solution of this problem, the wave motions of liquid on its free surface are taken into account. The solution of the problem of hydroelasticity is based on the application of the method of decomposition of the domain of integration of equations of the theory of shells with the use of the variational statement of the problem and on the approximate construction of the operator inverse to the operator of the hydrodynamic part of the problem. We construct a generalized functional of displacements of the shell for which the role of conditions of matching for the solutions in different subdomains is played by the natural boundary conditions. The obtained numerical results are compared with the existing exact solutions of the analyzed problem for a shell in the form of a straight circular cylinder.

42 ENGINEERING↗

NASA NTRS1971

The estimation of the constituent densities of the upper atmosphere by means of a recursive filtering algorithm.

The structure of the upper atmosphere can be indirectly probed by light in order to determine the global density structure of ozone, aerosols, and neutral atmosphere. Scattered and directly transmitted light is measured by a satellite and is shown to be a nonlinear function of the state which is defined to be a point-wise decomposition of the density profiles. Dynamics are imposed on the state vector and a structured estimation problem is developed. The estimation of these densities is then performed using a linearized Kalman-Bucy filter and a linearized Kushner-Stratonovich filter.

Mcgarty, T. P.↗