Search NASA⌕ Search

SEARCH · Search NASA

Results for “Decomposition algorithm”

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 667 records · Page 37

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↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Mapping to Irregular Torus Topologies and Other Techniques for Petascale Biomolecular Simulation, In: SC '14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis

Currently deployed petascale supercomputers typically use toroidal network topologies in three or more dimensions. While these networks perform well for topology-agnostic codes on a few thousand nodes, leadership machines with 20,000 nodes require topology awareness to avoid network contention for communication-intensive codes. Topology adaptation is complicated by irregular node allocation shapes and holes due to dedicated input/output nodes or hardware failure. In the context of the popular molecular dynamics program NAMD, we present methods for mapping a periodic 3-D grid of fixed-size spatial decomposition domains to 3-D Cray Gemini and 5-D IBM Blue Gene/Q toroidal networks to enable hundred-million atom full machine simulations, and to similarly partition node allocations into compact domains for smaller simulations using multiple copy algorithms. Additional enabling techniques are discussed and performance is reported for NCSA Blue Waters, ORNL Titan, ANL Mira, TACC Stampede, and NERSC Edison.

Computer Science↗

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↗

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↗

A trust-region algorithm for the optimization of PSA processes using reduced-order modeling

The last few decades have seen a considerable increase in the applications of adsorptive gas separation technologies, such as pressure swing adsorption (PSA); the applications range from bulk separations to trace contaminant removal. PSA processes are based on solid-gas equilibrium and operate under periodic transient conditions [1]. Bed models for these processes are therefore defined by coupled nonlinear partial differential and algebraic equations (PDAEs) distributed in space and time with periodic boundary conditions that connect the processing steps together and high nonlinearities arising from non-isothermal effects and nonlinear adsorption isotherms. As a result, the optimization of such systems for either design or operation represents a significant computational challenge to current nonlinear programming algorithms. Model reduction is a powerful methodology that permits systematic generation of cost-efficient low-order representations of large-scale systems that result from discretization of such PDAEs. In particular, low-dimensional approximations can be obtained from reduced order modeling (ROM) techniques based on proper orthogonal decomposition (POD) and can be used as surrogate models in the optimization problems. In this approach, a representative ensemble of solutions of the dynamic PDAE system is constructed by solving a higher-order discretization of the model using the method of lines, followed by the application of Karhunen-Loeve expansion to derive a small set of empirical eigenfunctions (POD modes). These modes are used as basis functions within a Galerkin's projection framework to derive a low-order DAE system that accurately describes the dominant dynamics of the PDAE system. This approach leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization before and making optimization problem computationally efficient [2]. The ROM methodology has been successfully applied to a 2-bed 4-step PSA process used for separating a hydrogen-methane mixture in [3]. The reduced order model developed was successfully used to optimize this process to maximize hydrogen recovery within a trust-region. We extend this approach in this work to develop a rigorous trust-region algorithm for ROM-based optimization of PSA processes. The trust-region update rules and sufficient decrease condition for the objective is used to determine the size of the trust-region. Based on the decrease in the objective function and error in the ROM, a ROM updation strategy is designed [4, 5]. The inequalities and bounds are handled in the algorithm using exact penalty formulation, and a non-smooth trust-region algorithm by Conn et al. [6] is used to handle non-differentiability. To ensure that the first order consistency condition is met and the optimum obtained from ROM-based optimization corresponds to the optimum of the original problem, a scaling function, such as one proposed by Alexandrov et al. [7], is incorporated in the objective function. Such error control mechanism is also capable of handling numerical inconsistencies such as unphysical oscillations in the state variable profiles. The proposed methodology is applied to optimize a PSA process to concentrate CO{sub 2} from a nitrogen-carbon dioxide mixture. As in [3], separate ROMs are developed for each operating step with different POD modes for each state variable. Numerical results will be presented for optimization case studies which involve maximizing CO{sub 2} recovery, feed throughput or minimizing overall power consumption.

97 MATHEMATICS AND COMPUTING↗

Constructing efficient substructure-based preconditioners for BEM systems of equations

In this work, a generic substructuring algorithm is employed to construct global block-diagonal preconditioners for BEM systems of equations. In this strategy, the allowable fill-in positions are those on-diagonal block matrices corresponding to each BE subregion. As these subsystems are independently assembled, the preconditioner for a particular BE model, after the LU decomposition of all subsystem matrices, is easily formed. So as to highlight the efficiency of the preconditioning proposed, the Bi-CG solver, which presents a quite erratic convergence behavior, is considered. In the particular applications of this paper, 3D representative volume elements (RVEs) of carbon-nanotube (CNT) composites are analyzed. The models contain up to several tens of thousands of degrees of freedom. The efficiency and relevance of the preconditioning technique is also discussed in the context of developing general (parallel) BE codes.

36 MATERIALS SCIENCE↗

Lead Slowing-Down Spectrometry Time Spectral Analysis for Spent Fuel Assay: FY11 Status Report

Developing a method for the accurate, direct, and independent assay of the fissile isotopes in bulk materials (such as used fuel) from next-generation domestic nuclear fuel cycles is a goal of the Office of Nuclear Energy, Fuel Cycle R&D, Material Protection and Control Technology (MPACT) Campaign. To meet this goal, MPACT supports a multi-institutional collaboration, of which PNNL is a part, to study the feasibility of Lead Slowing Down Spectroscopy (LSDS). This technique is an active nondestructive assay method that has the potential to provide independent, direct measurement of Pu and U isotopic masses in used fuel with an uncertainty considerably lower than the approximately 10% typical of today's confirmatory assay methods. This document is a progress report for FY2011 PNNL analysis and algorithm development. Progress made by PNNL in FY2011 continues to indicate the promise of LSDS analysis and algorithms applied to used fuel. PNNL developed an empirical model based on calibration of the LSDS to responses generated from well-characterized used fuel. The empirical model, which accounts for self-shielding effects using empirical basis vectors calculated from the singular value decomposition (SVD) of a matrix containing the true self-shielding functions of the used fuel assembly models. The potential for the direct and independent assay of the sum of the masses of 239Pu and 241Pu to within approximately 3% over a wide used fuel parameter space was demonstrated. Also, in FY2011, PNNL continued to develop an analytical model. Such efforts included the addition of six more non-fissile absorbers in the analytical shielding function and the non-uniformity of the neutron flux across the LSDS assay chamber. A hybrid analytical-empirical approach was developed to determine the mass of total Pu (sum of the masses of 239Pu, 240Pu, and 241Pu), which is an important quantity in safeguards. Results using this hybrid method were of approximately the same accuracy as the pure empirical approach. In addition, total Pu with much better accuracy with the hybrid approach than the pure analytical approach. In FY2012, PNNL will continue efforts to optimize its empirical model and minimize its reliance on calibration data. In addition, PNNL will continue to develop an analytical model, considering effects such as neutron-scattering in the fuel and cladding, as well as neutrons streaming through gaps between fuel pins in the fuel assembly.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

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↗

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↗

Key predictors of soil organic matter vulnerability to mineralization differ with depth at a continental scale

Abstract Soil organic matter (SOM) is the largest terrestrial pool of organic carbon, and potential carbon-climate feedbacks involving SOM decomposition could exacerbate anthropogenic climate change. However, our understanding of the controls on SOM mineralization is still incomplete, and as such, our ability to predict carbon-climate feedbacks is limited. To improve our understanding of controls on SOM decomposition, A and upper B horizon soil samples from 26 National Ecological Observatory Network (NEON) sites spanning the conterminous U.S. were incubated for 52 weeks under conditions representing site-specific mean summer temperature and sample-specific field capacity (−33 kPa) water potential. Cumulative carbon dioxide respired was periodically measured and normalized by soil organic C content to calculate cumulative specific respiration (CSR), a metric of SOM vulnerability to mineralization. The Boruta algorithm, a feature selection algorithm, was used to select important predictors of CSR from 159 variables. A diverse suite of predictors was selected (12 for A horizons, 7 for B horizons) with predictors falling into three categories corresponding to SOM chemistry, reactive Fe and Al phases, and site moisture availability. The relationship between SOM chemistry predictors and CSR was complex, while sites that had greater concentrations of reactive Fe and Al phases or were wetter had lower CSR. Only three predictors were selected for both horizon types, suggesting dominant controls on SOM decomposition differ by horizon. Our findings contribute to the emerging consensus that a broad array of controls regulates SOM decomposition at large scales and highlight the need to consider changing controls with depth.

59 BASIC BIOLOGICAL SCIENCES↗

Eigensolver performance comparison on Cray XC systems

Summary Hermitian (symmetric) eigenvalue solvers are the core constituents of electronic structure, quantum‐chemistry, and other HPC applications such as Quantum ESPRESSO, VASP, CP2K, and NWChem to name a few. Our understanding of the performance of symmetric eigenvalue algorithms on various hardware is clearly important to the quantum chemistry or condensed matter physics community but in fact goes beyond that community. For instance, big data analytics is increasingly utilizing eigenvalues solvers, in the study of randomized singular value decomposition (SVD) or principal component analysis (PCA). Noise, vibration, and harshness (NVH) is another field where fast and efficient eigenvalue solvers are required. Most eigenvalue solver packages feature numerous different parameters which can be tuned for performance, eg, the number of nodes, number of total ranks, the decomposition of the matrix, etc. In this paper, we investigate the performance of different packages as well as the influence of these knobs on the solver performance.

Cook, Brandon↗