Search NASA⌕ Search

SEARCH · Search NASA

Results for “task decomposition”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗
DOE OSTI2020

Model-Free State Estimation Using Low-Rank Canonical Polyadic Decomposition

As electric grids experience high penetration levels of renewable generation, fundamental changes are required to address real-time situational awareness. Here, we utilize unique traits of tensors to devise a model-free situational awareness and energy forecasting framework for distribution networks. This work formulates the state of the network at multiple time instants as a three-way tensor; hence, recovering full state information of the network is tantamount to estimating all the values of the tensor. Given measurements received from µphasor measurement units and/or smart meters, the recovery of unobserved quantities is carried out using the low-rank canonical polyadic decomposition of the state tensor—that is, the state estimation task is posed as a tensor imputation problem utilizing observed patterns in measured (sampled) quantities. Two structured sampling schemes are considered, namely, asynchronous slab and fiber sampling. For both schemes, we present sufficient conditions on the number of sampled slabs and fibers that guarantee identifiability of the factors of the state tensor. Numerical results demonstrate the ability of the proposed framework to achieve high estimation accuracy in multiple sampling scenarios.

42 ENGINEERING↗
DOE OSTI2017

Pseudo-Spectral Methods for the Laplace-Beltrami Equation and the Hodge Decomposition on Surfaces of Genus One

The inversion of the Laplace-Beltrami operator and the computation of the Hodge decomposition of a tangential vector field on smooth surfaces arise as computational tasks in many areas of science, from computer graphics to machine learning to computational physics. In this work, we present a high-order accurate pseudo-spectral approach, applicable to closed surfaces of genus one in three-dimensional space, with a view toward applications in plasma physics and fluid dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Developing Uintah's Runtime System for Forthcoming Architectures

The need to solve ever-more complex science and engineering problems on computer architectures that are rapidly evolving poses considerable challenges for modern simulation frameworks and packages. While the decomposition of software into a programming model that generates a task-graph for execution by a runtime system make portability and performance possible, it also imposes considerable demands on that runtime system. Here, the challenge of meeting those demands for near-term and longer term systems in the context of the Uintah framework is considered in key areas such as support for data structures, tasks on heterogeneous architectures, performance portability, power management and designing for resilience by the use of replication based upon adaptive mesh refinement processes is addressed. Examples of techniques in these areas are used to illustrate performance improvements obtained for present large-scale systems and the needs of proposed systems considered.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

pyDRESCALk

Modern data scientists are tasked to analyze ever-growing data sets with increasingly complex relationships. Tensor decompositions have come to play a central role in identifying underlying latent structures in higher-order data. The problem of fitting tensor models to different distributions is complicated by the combinations of size, dimensionality, and sparsity present in real world data. The situation demands efficient algorithms designed for shared-memory and distributed systems. This work will present new research that tackles these challenges on several different fronts, leveraging optimizations in numerical algorithms and sparse tensor representations in heterogeneous high performance computing environments.

Bhattarai, Manish↗
DOE OSTI2017

MPACT Development Activities at University of Michigan

This report documents the efforts of general development tasks in MPACT performed primarily at the University of Michigan during FY17. These tasks included: 1. Unstructured CMFD - The unstructured CMFD supports the RIA and BWR challenge problems. It allows MPACT to simulate mixed lattice cores (e.g. 8x8 next to 9x9). This design feature is common to operating BWRs and also the SPERT experiments being used to validate VERA-CS for RIA. 2. Higher order spatial sources for MOC - The higher order sources are for improving the overall performance of MPACT. Higher order spatial sources in MOC provide accurate solutions with potentially significantly fewer mesh regions, thus speeding up every calculation. This method is also particularly important for BWRs. 3. Improving fine source region visualization - The improvement of the visualization of the flat source region mesh in MPACT is to support users and communication of models and results from MPACT. VERAView provides visualization of pin-wise information, however MPACT resolves the spatial solution to intra pin level. The capability provided here will let users visualize the full model geometry and components of the solution at the highest spatial resolution available from MPACT. 4. Automated spatial decomposition - The automated spatial decomposition removes the burden from the user to know how to spatially decompose the model for MPACT; a task that has been rather tricky in the past. Instead the user may give some number of processors that is a multiple of the axial mesh and MPACT will determine a nearly optimal decomposition that gives better load balance than most decompositions used currently. 5. Optimal relaxation factors for feedback - The development of optimal relaxation factor is to improve the stability and robustness of problems with feedback. Presently the default feedback values are 0.5, which may or may not be optimal. Without relaxation the fixed point iteration that is currently used is known to be unstable for large problems. The optimal relaxation factors are derived by utilizing a previous Fourier analysis. From the original milestone there was a scope change where the work on the Intel MIC was deferred for work on the automated spatial decomposition.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗
DOE OSTI2022

A Sparse and Low Rank Penalized Signal Decomposition Model with Constraints: Anomaly Detection in PV Systems

Recently, robust PCA has seen its wide application in various industries for its ability to perform the task of anomaly detection. The essence of robust PCA approach is to break down the signal into a low rank component and sparse component. In many applications, a simple breakdown of the signal without accounting for the signs of low rank components and sparse components would violate the physical constraints of the decomposed signal. In addition, often times, the signals in the real world collected for a long duration has smooth changes within a day and between days. As an example, the power signals collected in a photovoltaic (PV) system are cyclostationary, exhibiting these characteristics. Neglecting the smoothness of signals would result in miss detection of anomalous signals which are smooth within a day but non-smooth between days and vice versa. In this paper, we developed a signal decomposition approach for the purpose of anomaly detection based on the idea of low rank and sparse decomposition taking into consideration the signs of the decomposed low rank and sparse components and the within-day and between-day smooth changes in the original signals. The proposed unsupervised approach for fault detection eliminates the need for faulty samples required by other machine learning methods. It does not require the full I-V characteristics to work. Furthermore, there is no need for complex modelling of PV systems as in the case of power loss analysis. Using Monte Carlo simulations, we demonstrate the ability of our proposed approach for detecting anomalies of different duration and severity in PV systems.

14 SOLAR ENERGY↗
DOE OSTI2014

A decomposition‐based approach to uncertainty analysis of feed‐forward multicomponent systems

SUMMARY To support effective decision making, engineers should comprehend and manage various uncertainties throughout the design process. Unfortunately, in today's modern systems, uncertainty analysis can become cumbersome and computationally intractable for one individual or group to manage. This is particularly true for systems comprised of a large number of components. In many cases, these components may be developed by different groups and even run on different computational platforms. This paper proposes an approach for decomposing the uncertainty analysis task among the various components comprising a feed‐forward system and synthesizing the local uncertainty analyses into a system uncertainty analysis. Our proposed decomposition‐based multicomponent uncertainty analysis approach is shown to be provably convergent in distribution under certain conditions. The proposed method is illustrated on quantification of uncertainty for a multidisciplinary gas turbine system and is compared to a traditional system‐level Monte Carlo uncertainty analysis approach. Copyright © 2014 John Wiley & Sons, Ltd.

Amaral, Sergio↗
DOE OSTI2023

Facile Room-Temperature Electrodeposition of Rare Earth Metals in a Fluorine-Free Task-Specific Electrolyte

Electrochemical deposition of rare earth metals at room temperature has attracted increasing interest due to its advantage in energy efficiency over traditional hydrometallurgical and pyrometallurgical processes. Recent progress has been made with fluorinated electrolyte systems; however, the formation of an electrode-passivating fluoride layer by electrolyte decomposition is often overlooked. Such a passivation layer causes significant and rapid decay of the deposition current and significantly hinders practical application. To address this issue, we demonstrate a fluorine (F)-free task-specific electrolyte utilizing the borohydride anion for the efficient electrodeposition of rare earth metals. By eliminating the passivation effect, the deposition process exhibits a stable current and accumulates a thick neodymium deposit on the electrode. Raman spectroscopy of the electrolyte reveals a synergetic effect between rare earth borohydride and lithium borohydride which promotes the dissociation of both borohydride salts, resulting in significantly increased ionic conductivity and electrochemical performance. Cyclic voltammetry and in-depth X-ray photoelectron spectroscopy of the deposits suggest that the electrodeposition of rare earth metals could undergo a Li-mediated reduction process. Finally, quantitative analysis of the deposits reveals that the overall concentration of the rare earth elements reaches 75% which contains 40–48% metallic phase.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Parallel Nonnegative CP Decomposition of Dense Tensors

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensors that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the Matricized-Tensor Times Khatri-Rao Product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

Ballard, Grey↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Evaluation of data driven low-rank matrix factorization for accelerated solutions of the Vlasov equation

Low-rank methods have shown success in accelerating simulations of a collisionless plasma described by the Vlasov equation, but still rely on computationally costly linear algebra every time step. We propose a data-driven factorization method using artificial neural networks, specifically with convolutional layer architecture, that trains on existing simulation data. At inference time, the model outputs a low-rank decomposition of the distribution field of the charged particles, and we demonstrate that this step is faster than the standard linear algebra technique. Numerical experiments show that the method achieves comparable reconstruction accuracy for interpolation tasks, generalizing to unseen test data in a manner beyond just memorizing training data; patterns in factorization also inherently followed the same numerical trend as those within algebraic methods (e.g., truncated singular-value decomposition). However, when training on the first 70% of a time-series data and testing on the remaining 30%, the method fails to meaningfully extrapolate. Despite this limiting result, the technique may have benefits for simulations in a statistical steady-state or otherwise showing temporal stability. These results suggest that while the model offers a computationally efficient alternative for datasets with temporal stability, its current formulation is best suited for interpolation rather than for predicting future states in time-evolving systems. This study thus lays the groundwork for further refinement of neural network-based approaches to low-rank matrix factorization in high-dimensional plasma simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Extracting physics through deep data analysis

In recent decades humankind has become very apt at generating and recording enormous amounts of data, ranging from tweets and selfies on social networks, to financial transactions in banks and stores. The scientific community has not shunned this popular trend and now routinely produces hundreds of petabytes of data per year [1]. This is because materials and phenomena in the world around us exist in an interweaved, entangled form, which gives rise to the complexity of the Universe and determines the size and complexity of the data that describes it. Science and technology endeavor to unravel this convolution and extract pure components from the mixtures, be it in ore mining and metal smelting or separation of thermal conductivity into the electronic and phononic contributions. Decomposition of complex behavior is the key to understanding manifestations of Nature. However, tools to carry out this task are not readily available, and therefore, intricate systems often remain well-characterized experimentally, but still not well understood due to intricacy of the collected data. Lastly, in materials science, understanding and ultimately designing new materials with complex properties will require the ability to integrate and analyze data from multiple instruments, including computational models, designed to probe complementary ranges of space, time, and energy.

36 MATERIALS SCIENCE↗
DOE OSTI2017

DE-NE0000724 - Research Performance Final Report - Investigation of Thermal Aging Effects on the Evolution of Microstructure and Mechanical Properties of Cast Duplex Stainless Steels

This report details the research activities carried out under DOE-NEUP award number DE-NE0000724 concerning the evolution of structural and mechanical properties during thermal aging of CF–3 and CF–8 cast duplex stainless steels (CDSS). The overall objective of this project was to use state-of-the-art characterization techniques to elucidate trends and phenomena in the mechanical and structural evolution of cast duplex stainless steels (CDSS) during thermal aging. These steels are commonly used as structural materials in commercial light water nuclear power plants, undergoing aging for decades in operation as cooling water pipes, pump casings, valve bodies, etc. During extended exposure to these conditions, CDSS are known to undergo a change in mechanical properties resulting in a loss of ductility, i.e. embrittlement. While it is generally accepted that structural changes within the ferrite phase, such as decomposition into iron (Fe)-rich and chromium (Cr)-rich domains, lead to the bulk embrittlement of the steels, many questions remain as to the mechanisms of embrittlement at multiple length scales. This work is intended to shed insight into the atomic level composition changes, associated kinetic mechanisms, and effects of changing phase structure on micro- and nano-scale deformation that lead to loss of impact toughness and tensile ductility in these steels. In general, this project provides a route to answer some of these major questions using techniques such as 3-dimensional (3-D) atom probe tomography (APT) and real-microstructure finite element method (FEM) modeling, which were not readily available when these steels were originally selected for service in light water reactors. Mechanical properties evaluated by Charpy V-notch impact testing (CVN), tensile testing, and microhardness and nanohardness measurements were obtained for each condition and compared with the initial baseline properties to view trends in deformation behavior during aging. Concurrent analysis of the microstructure and nanostructure by atom probe tomography (APT) and transmission electron microscopy (TEM) provide mechanistic insight into the kinetic and mechanical behavior occurring on the nano-scale. The presence and morphology of the ferrite, austenite, and carbide phases have been characterized, and formation of new phases during aging, including spinodal decomposition products (α- and α'-ferrite) and G-phase, have been observed. The mechanical and structural characterization have been used to create accurate FEM models based on the real micro- and nano-structures of the systems. These models provide new insight into the local deformation behavior of these steels and the effects of each individual phase (including ferrite, austenite, carbides, and spinodal decomposition products) on the evolving bulk mechanical behavior of the system. The project was divided into three major tasks: 1. Initial Microstructure and Mechanical Property Survey and Initiate Heat Treatment; 2. Microstructural Characterization and Mechanical Property Testing During Aging; and 3. Microstructure-based Finite Element Modeling. Each of these tasks was successfully executed, resulting in reliable data and analysis that add to the overall body of work on the CDSS materials. Baseline properties and aging trends in mechanical data confirm prior observations and add new insights into the mechanical behavior of the steels. Structural characterization on multiple length scales provides new information on phase changes occurring during aging and sheds light on the kinetic processes occurring at the atomic scale. Furthermore, a combination of mechanical testing and microstructural characterization techniques was utilized to design FEM models of local deformation behavior of the ferrite and austenite phases, providing valuable new information regarding the effects of each of the microstructural components on the hardening and embrittlement processes. The data and analysis presented in this report and the publication associated with this project (§V) increase the understanding of aging and deformation in CF–3 and CF–8 steels. These results provide valuable information that can be utilized to aid in making informed decisions regarding the ongoing use of these steels in commercial nuclear infrastructure.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Tank 48H Phase 1 Initial Testing Using Sodium Permanganate to Decompose Tetraphenylborate: As-Received Characterization of HTF-48-25-1

This report provides results from a detailed characterization study of Tank 48H sample HTF-48-25-17 performed by the Savannah River National Laboratory (SRNL). The slurry sample was retrieved from Savannah River Site (SRS) Tank 48H on February 25, 2025, and received at the SRNL shielded cells on 02/25/2026. This effort completes the first task of a multi-phase approach, requested by Savannah River Mission Completion (SRMC), to study tetraphenylborate (TPB) decomposition in Tank 48H using sodium permanganate with radioactive waste.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

General-Purpose Bayesian Tensor Learning With Automatic Rank Determination and Uncertainty Quantification

A major challenge in many machine learning tasks is that the model expressive power depends on model size. Low-rank tensor methods are an efficient tool for handling the curse of dimensionality in many large-scale machine learning models. The major challenges in training a tensor learning model include how to process the high-volume data, how to determine the tensor rank automatically, and how to estimate the uncertainty of the results. While existing tensor learning focuses on a specific task, this paper proposes a generic Bayesian framework that can be employed to solve a broad class of tensor learning problems such as tensor completion, tensor regression, and tensorized neural networks. We develop a low-rank tensor prior for automatic rank determination in nonlinear problems. Our method is implemented with both stochastic gradient Hamiltonian Monte Carlo (SGHMC) and Stein Variational Gradient Descent (SVGD). We compare the automatic rank determination and uncertainty quantification of these two solvers. We demonstrate that our proposed method can determine the tensor rank automatically and can quantify the uncertainty of the obtained results. We validate our framework on tensor completion tasks and tensorized neural network training tasks.

Bayesian inference↗