Search NASASearch

SEARCH · Search NASA

Results for “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 37 records · Page 2

Does manganese influence grass litter decomposition on a Hawaiian rainfall gradient?

Plant litter is a well-defined pool of organic matter (OM) in which the influence of manganese (Mn) on decomposition (both decomposition rate and the mix of compounds ultimately transferred to soil OM) has been clearly demonstrated in temperate forests. However, no similar study exists on grasslands and the effect of foliar Mn versus soil-derived Mn on litter decomposition is poorly known. We used a 5-month and 12-month field, and 10-month laboratory experiments to evaluate litter decomposition on the Kohala rainfall gradient (Island of Hawai‘i) in areas with different foliar and soil Mn abundances, and on which a single plant species (Pennisetum clandestinum) dominates primary production and the litter pool. The chemical imaging analyses of decomposed litter revealed that Mn 2+ oxidized to Mn 3+ and Mn 4+ on grass litter during decompositions—hallmarks of Mn-driven litter oxidation. However, these transformations and Mn abundance did not predict greater litter mass loss through decomposition. These observations demonstrate that the importance of Mn to an ecosystem’s C cycle does not rely solely on the metal’s abundance and availability.

54 ENVIRONMENTAL SCIENCES

Calcium is associated with specific soil organic carbon decomposition products at Blodgett Forest Research Center, Georgetown, California as analysed with scanning transmission X-ray microscopy carbon near-edge X-ray absorption fine structure spectroscopy

This data is from the paper calcium is associated with specific soil organic carbon decomposition products, published in SOIL. DOI: https://doi.org/10.5194/soil-11-381-2025, 2025.This file contains CSVs with spectral data and bulk soil data and there is no specific program required to open this data. The data includes Scanning transmission X-ray microscopy carbon near-edge X-ray absorption fine structure spectroscopy. data from the measurement of samples from the Whole-soil Warming project, run by the Belowground Biogeochemistry team at Blodgett Forest Research Center, Georgetown, California run by the University of California, Berkeley. It also includes bulk soil chemical properties. The University of California's Blodgett Forest Research Station (Forest) is situated in the Sierra Nevada foothills (1370 m a.s.l.) near Georgetown, California. The samples were collected from here: 38.912013, -120.661469, https://maps.app.goo.gl/291bCJ1zVqUhgktz6. The Forest soils were characterised as Alfisols, which are equivalent to Dystric Cambisols (IUSS Working Group WRB, 2015), and formed in granitic parent materials, in a temperate climate, under thinned, mixed-coniferous forest (Fig. S3; Gaudinski et al., 2009). With these analyses we aimed to answer the question, is calcium associated with a specific type of organic matter enriched in aromatic and phenolic carbon at the microscale in samples from Blodgett Forest Research Center? and how does this specific type of carbon respond to experiments targetted at removing and adding calcium to the soils, specifically cation exchange and incubation after calcium addition? Abstract from the paper can be found below: Calcium (Ca) may contribute to the preservation of soil organic carbon (SOC) in more ecosystems than previously thought. Here we provide evidence that Ca is co-located with SOC compounds that are enriched in aromatic and phenolic groups, across different acidic soil-types and locations with different ecosystem properties, differing in terms of climate, parent material, soil type, and vegetation. In turn, this co-localised fraction of Ca-SOC is removed through cation-exchange, and the association is then only re-established during decomposition in the presence of Ca (Ca addition incubation). Thus, highlighting a causative link between decomposition and the co-location of Ca with a characteristic fraction of SOC. Decomposition increases the relative proportion of negatively charged functional groups, which can increase the propensity for the association between SOC and Ca, and in turn, this association inhibits dissolved organic carbon export or further decomposition. We propose that this mechanism could be driven by Ca hotspots on the microscale shifting local decomposition processes and thereby explaining the colocation of Ca with SOC of a specific composition across different acidic soil environments. Incorporating this biogeochemical process into Earth System Models could improve our understanding, predictions, and management of carbon dynamics in soils, and account for their response to Ca-rich amendments.

54 ENVIRONMENTAL SCIENCES

THERMAL DECOMPOSITION OF HYDRAZINE

The Thermal Stability of Hydrazine has been studied in the temperature and pressure intervals of 175" to 250"C. and 300 to 430 p.s.i., Respectively. Previous studies of the decomposition of hydrazine indicated that several factors affect its stability (2, 5, 7). the rate of decomposition is increased by the presence of certain surfaces (especially metals and salts). pH, oxygen, and carbon dioxide. Further explosive decomposition Is attributable to the uncontrolled heterogeneous, gas-phase decomposition. These factors were considered in selecting the following experimental conditions: highly purified hydrazine was prepared in a nitrogen atmosphere, and this product was decomposed over triply distilled mercury in outgassed borosilicate glass tubes at ullages that were initially zero. This study also included the effects of added quantities of ammonia on the rate of decomposition and an investigation of the products of the decomposition.

Harold W. Lucien

Highly Scalable Matching Pursuit Signal Decomposition Algorithm

Matching Pursuit Decomposition (MPD) is a powerful iterative algorithm for signal decomposition and feature extraction. MPD decomposes any signal into linear combinations of its dictionary elements or atoms . A best fit atom from an arbitrarily defined dictionary is determined through cross-correlation. The selected atom is subtracted from the signal and this procedure is repeated on the residual in the subsequent iterations until a stopping criterion is met. The reconstructed signal reveals the waveform structure of the original signal. However, a sufficiently large dictionary is required for an accurate reconstruction; this in return increases the computational burden of the algorithm, thus limiting its applicability and level of adoption. The purpose of this research is to improve the scalability and performance of the classical MPD algorithm. Correlation thresholds were defined to prune insignificant atoms from the dictionary. The Coarse-Fine Grids and Multiple Atom Extraction techniques were proposed to decrease the computational burden of the algorithm. The Coarse-Fine Grids method enabled the approximation and refinement of the parameters for the best fit atom. The ability to extract multiple atoms within a single iteration enhanced the effectiveness and efficiency of each iteration. These improvements were implemented to produce an improved Matching Pursuit Decomposition algorithm entitled MPD++. Disparate signal decomposition applications may require a particular emphasis of accuracy or computational efficiency. The prominence of the key signal features required for the proper signal classification dictates the level of accuracy necessary in the decomposition. The MPD++ algorithm may be easily adapted to accommodate the imposed requirements. Certain feature extraction applications may require rapid signal decomposition. The full potential of MPD++ may be utilized to produce incredible performance gains while extracting only slightly less energy than the standard algorithm. When the utmost accuracy must be achieved, the modified algorithm extracts atoms more conservatively but still exhibits computational gains over classical MPD. The MPD++ algorithm was demonstrated using an over-complete dictionary on real life data. Computational times were reduced by factors of 1.9 and 44 for the emphases of accuracy and performance, respectively. The modified algorithm extracted similar amounts of energy compared to classical MPD. The degree of the improvement in computational time depends on the complexity of the data, the initialization parameters, and the breadth of the dictionary. The results of the research confirm that the three modifications successfully improved the scalability and computational efficiency of the MPD algorithm. Correlation Thresholding decreased the time complexity by reducing the dictionary size. Multiple Atom Extraction also reduced the time complexity by decreasing the number of iterations required for a stopping criterion to be reached. The Course-Fine Grids technique enabled complicated atoms with numerous variable parameters to be effectively represented in the dictionary. Due to the nature of the three proposed modifications, they are capable of being stacked and have cumulative effects on the reduction of the time complexity.

Christensen, Daniel

Variance Decomposition of MEDLI2 Reconstructed Heating Using Neural Networks

The Mars Entry, Descent, and Landing Instrumentation (MEDLI2) sensor suite collected data during entry of the Mars 2020 Perseverance rover into Mars’ atmosphere. This suite included a network of MEDLI2 Instrumented Sensor Plugs (MISPs). Each MISP was comprised of a cylinder made of Thermal Protection System (TPS) material with 1-3 embedded thermocouples (TCs), and it was flush mounted into the heatshield or backshell. Data from these in-depth TCs were used to reconstruct the aeroheating environment of the vehicle throughout entry. Surface heating was posed as an inverse problem, with the goal of estimating the surface heating by minimizing an objective function of the difference between MISP temperature measurements during flight and the temperature predictions derived from the Fully Implicit Ablation and Thermal response (FIAT) program. Given an aerothermal environment, FIAT calculates the material response and provides in-depth temperatures throughout the TPS material. To achieve the reverse, an internal tool called FIAT_Opt runs through multiple different environments until the output temperature at the TC depth closely matches the flight data. 95% confidence intervals on the reconstructed surface heating were obtained using Monte Carlo analysis, in which uncertainties in the thermocouple depth and the TPS material properties (e.g., density, thermal conductivity, heat capacity, emissivity) based on flight-lot material testing were included. A variance decomposition method using Sobol indices was employed to assess the sensitivity of the reconstructed peak heating to the TC placement and material property uncertainties. Variance decomposition was found to require tens of thousands of FIAT_Opt runs in order for the Sobol indices to converge. With a single FIAT_Opt run taking on the order of 40 minutes, the required number of computations would take months to complete, even if using multiple CPUs. To mitigate this problem, three machine learning models (ridge regression with cross-validation, random forest regression, and a deep neural network) were trained and tested using the 2000 Monte Carlo runs that were already completed. A subset of 1600 runs were used to train the model (i.e., training set), while the remaining 400 runs were used as the test set. The predictions from the deep neural network (DNN) on the test set showed nearly perfect agreement to the actual values computed with FIAT_Opt (R2 > 0.99). Using the DNN as a surrogate model, the variance decomposition using 50,000 runs was completed within minutes. The resulting Sobol indices showed that the reconstructed peak surface heating was most sensitive to the uncertainties in the thermal conductivity (ST = 0.37) and heat capacity (ST = 0.26). This method can be leveraged to provide requirements for material property measurements needed to improve the accuracy of surface heating prediction and ultimately lead to the reduction of design margins in the future. This presentation will include background on the MEDLI2 suite; the method used for inverse heating estimation; the way that material property uncertainties were accounted for using Monte Carlo analysis; a brief background on variance decomposition; the motivation for using machine learning in this context; how a neural network was trained on the data to enable variance decomposition in a fraction of the time; and the variance decomposition results for one of the MISPs.

Hannah Alpert

Active Thermography Based on Tensor Rank Decomposition

Principal Component Thermography applies Singular Value Decomposition (SVD) to post-process data that are derived from active thermographic inspections. SVD provides useful compression of the data and allows for better understanding of substructure and indications of potential damage. In the standard approach, SVD is applied to a certain reshaping of a three-dimensional data stack into a two-dimensional array. This work applies the CANDECOMP-PARAFAC (CP) tensor rank decomposition directly to the three-dimensional data to avoid the initial reshaping step in order to begin to develop an inspection method that can more accurately detect defects in non-homogeneous and anisotropic materials. Tests against simulated data that compare the CP decomposition method with traditional Principal Component Thermography based on SVD are described. Finally, the method of Proper Generalized Decomposition (PGD) is used to derive the CP decomposition, and its performance against other algorithms is also discussed.

Thermography

Deciphering decomposition pathways of high explosives with cryogenic X-ray Raman spectroscopy

We employed cryogenic X-ray Raman spectroscopy to investigate the early-stage decomposition of the high explosive molecule hexanitrohexaazaisowurtzitane (CL-20). By systematically varying the radiation dose under cryogenic conditions, we induced the decomposition of the molecule using ionizing radiation and observed the evolution of spectral features at the carbon, nitrogen, and oxygen K edges. Through extensive first-principles calculations, we identified key intermediates in the early stages of the decomposition process, resulting from C–C and C–N bond cleavage which leads to the opening of the internal cage structure. A detailed analysis of spectral trends and fingerprints provided evidence supporting N–NO 2 homolytic cleavage as the primary initial decomposition pathway. The combination of advanced core-level spectroscopy methods and state-of-the-art theoretical calculations enabled a comprehensive characterization of the molecular changes induced by controlled radiation dose exposures. In conclusion, our findings establish a benchmark for understanding the decomposition chemistry of high-explosive materials, offering important insights into their stability and reactivity under extreme conditions.

X-ray Raman spectroscopy

Assessment of Accelerated Stress Testing Data for Silicon Photovoltaics Using Tensor Decomposition Methods

In this work, we examine the use of high-order tensor decompositions to analyze degradation pathways emerging from accelerated stress testing of silicon photovoltaic (PV) modules. Matrix-based decompositions are powerful tools for studying two-dimensional data arrays and form the foundation of a host of classical data analysis techniques. Tensors are high-order extrapolations of matrices that are able to account for more parameter dimensions, and a variety of tensor decomposition methods have been developed that similarly seek to extend insights from matrix decompositions to higher dimensions. Applying and interpreting tensor decomposition methods to sequences of PV module image data, we seek to uncover and isolate different degradation modes occurring from accelerated stress testing procedures. Further, we consider the contributions of different modes to PV module performance degradations.

data analysis

Flexible User-Defined Domain Decomposition in Kilometer-Scale E3SM Land Model Simulation

The Energy Exascale Earth System Model (E3SM) Land Model (ELM) has been extended to kilometer-scale (km-ELM) resolutions, enabling high-fidelity simulations of terrestrial processes at 1 km x 1 km grid spacing. In ELM, domain decomposition partitions the computational domain across processors, ensuring efficient parallel execution. Currently, round-robin decomposition is applied, providing a straightforward way to distribute computational workload. As ELM continues evolving at the kilometer-scale (km-scale), particularly with integrating lateral flow modeling, decomposition strategies must also account for the increased workload and data movement. This paper introduces a flexible user-defined domain decomposition framework, allowing users to customize domain partitioning based on application requirements. The impact of different decomposition strategies is evaluated across various applications concerning computation, communication, and I/O. Results demonstrate that while 1D partitioning yields superior I/O performance, k-nearest neighbors (KNN) clustering effectively reduces inter-process communication overhead. This study lays the groundwork for scalable partitioning in large-scale land surface simulations, enhancing next-generation Earth system modeling.

Wang, Dali [ORNL] (ORCID:0000000168065108)

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

The cluster decomposition of the configurational energy of multicomponent alloys

Abstract The cluster expansion method (CEM) is a widely used lattice-based technique in the study of multicomponent alloys. Despite its prevalent use, a clear understanding of expansion terms is lacking. We present a modern mathematical formalism of the CEM and introduce thecluster decomposition—a unique and basis-independent decomposition for functions of the atomic configuration in a crystal. We identify the cluster decomposition as an invariant ANOVA decomposition; and demonstrate how functional analysis of variance and sensitivity analysis can be used to interpret interactions among species. Furthermore, we show how the mathematical structure of the cluster decomposition enables numerical evaluation that scales with the number of clusters and is independent of the number of species. Overall, our work enables rigorous interpretations of interactions among species, provides opportunities to explore parameter estimation beyond linear regression, introduces a numerical efficient implementation, and enables analysis of cluster expansions based on established mathematical and statistical principles.

Chemistry

Calcium is associated with specific soil organic carbon decomposition products

Abstract. Calcium (Ca) may contribute to the preservation of soil organic carbon (SOC) in more ecosystems than previously thought. Here, we provide evidence that Ca is co-located with SOC compounds that are enriched in aromatic and phenolic groups, across different acidic soil types and locations with different ecosystem properties, differing in terms of climate, parent material, soil type, and vegetation. In turn, this co-localised fraction of Ca–SOC is removed through cation exchange, and the association is then only re-established during decomposition in the presence of Ca (Ca addition incubation). Thus, this highlights a causative link between decomposition and the co-location of Ca with a characteristic fraction of SOC. Decomposition increases the relative proportion of negatively charged functional groups, which can increase the propensity for the association between SOC and Ca; in turn, this association can inhibit dissolved organic carbon export or further decomposition. We propose that this mechanism could be driven by Ca hotspots at the microscale shifting local decomposition processes and thereby explaining the co-location of Ca with SOC of a specific composition across different acidic soil environments. Incorporating this biogeochemical process into Earth system models could improve our understanding, predictions, and management of carbon dynamics in soils, as well as accounting for their response to Ca-rich amendments.

Rowley, Mike C. (ORCID:0000000224407855)

LU and Cholesky decomposition on an optical systolic array processor

Direct solutions of matrix-vector equations on an optical systolic array processor are considered. The solutions are discussed and a parallel algorithm for LU matrix decomposition that is very attractive for an optical realization is formulated. It is noted that when direct techniques are used, it is preferable to realize the matrix decomposition on an optical system and to utilize a digital processor for the solution of the simplified resultant matrix-vector problem. One method of realizing LU matrix decomposition on a new frequency-multiplexed optical systolic array matrix-matrix processor is described. A simple method for extending the process of LU decomposition to Cholesky decomposition on the optical processor is discussed.

Casasent, D.

TE/TM decomposition of electromagnetic sources

Three methods are given by which bounded EM sources can be decomposed into two parts radiating transverse electric (TE) and transverse magnetic (TM) fields with respect to a given constant direction in space. The theory applies source equivalence and nonradiating source concepts, which lead to decomposition methods based on a recursive formula or two differential equations for the determination of the TE and TM components of the original source. Decompositions for a dipole in terms of point, line, and plane sources are studied in detail. The planar decomposition is seen to match to an earlier result given by Clemmow (1963). As an application of the point decomposition method, it is demonstrated that the general exact image expression for the Sommerfeld half-space problem, previously derived through heuristic reasoning, can be more straightforwardly obtained through the present decomposition method.

Lindell, Ismo V.

Domain decomposition for aerodynamic and aeroacoustic analyses, and optimization

The overarching theme was the domain decomposition, which intended to improve the numerical solution technique for the partial differential equations at hand; in the present study, those that governed either the fluid flow, or the aeroacoustic wave propagation, or the sensitivity analysis for a gradient-based optimization. The role of the domain decomposition extended beyond the original impetus of discretizing geometrical complex regions or writing modular software for distributed-hardware computers. It induced function-space decompositions and operator decompositions that offered the valuable property of near independence of operator evaluation tasks. The objectives have gravitated about the extensions and implementations of either the previously developed or concurrently being developed methodologies: (1) aerodynamic sensitivity analysis with domain decomposition (SADD); (2) computational aeroacoustics of cavities; and (3) dynamic, multibody computational fluid dynamics using unstructured meshes.

Baysal, Oktay

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio

Arctic shrub and Eriophorum leaf and root decomposition, northern Alaska, 2017-2018

This data package contains litter decomposition data collected from 170 plots of rapidly expanding shrub genera (Alnus, Betula, and Salix) and a widespread sedge (Eriophorum vaginatum) along a latitudinal and temperature gradient in northern Alaska. These data were produced from a litter bag experiment that took place from July 2017 to July 2018 and include mass loss and nitrogen loss decomposition metrics for both leaf and root litters. These raw data support a submitted manuscript that examines the variability in decomposition between shrub and graminoid leaf and root litters across a 1-year experiment across the graminoid-dominated Arctic tundra and reveals how deciduous shrub expansion affects litter decomposition in tundra ecosystems. Data are presented by site (n=5) and patch (shrub or sedge plot) in csv files. The site and plot location data and environmental measurement data are provided in Fraterrigo and Chen (2020). Additional methods regarding plot distribution and environmental measurements are in Chen et al. (2020) and Fraterrigo et al. (2024).

54 ENVIRONMENTAL SCIENCES