Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “matrix 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Role of phosphorus impurities in decomposition of La 2 NiO 4 –La 0.5 Ce 0.5 O 2-δ oxygen electrode in a solid oxide electrolysis cell

This study explored the decomposition mechanism of a La 2 NiO 4 (LNO) phase in the La 2 NiO 4 –La 0.5 Ce 0.5 O 2-δ (LNO-LDC) oxygen electrode in a solid oxide electrolysis cell (SOEC) after testing at 800 °C. Scanning electron microscopy and scanning transmission electron microscopy examinations of the LNO-LDC oxygen electrode before and after testing were undertaken. Other than phosphorus contamination in the form of P-rich grains and P-rich deposits along all grain boundaries (GBs), LNO and LDC phases were intact without degradation in the as-fabricated electrode. However, mild to aggressive LNO phase decomposition triggered by the phosphorus poisoned GBs was observed after testing at 800 °C for 900 h. The evolution of the LNO phase decomposition was noted beginning with the exsolution of Ni into the surrounding LNO matrix and GBs, forming La-rich and Ni-rich phases correspondingly, in the LNO. Importantly, this study illustrates a detailed decomposition progress of the LNO phase at the atomic level under an SOEC operation condition, and sheds light on how to ameliorate the fabrication process of SOECs to enhance their performance and durability.

25 ENERGY STORAGE↗
DOE OSTI2024

Hot Hydrogen Testing of W-Coated UN Kernels in a Mo30W Matrix

Ceramic uranium mononitride (UN) is being considered as a reactor fuel for nuclear thermal propulsion. To avoid or reduce the dissociation of UN at the high temperatures needed, embedding it in a metallic matrix (cermet) has been proposed. To assess the viability of this concept, hot hydrogen testing of tungsten-coated UN kernels embedded in a Mo-30 wt% W (Mo30W) alloy matrix has been performed at temperatures from 1800°C to 2300°C. Both the isolated kernels and kernels consolidated by spark plasma sintering in the Mo30W matrix were tested. In addition to direct observations and mass loss measurements, the samples were analyzed by X-ray diffraction (XRD) and scanning electron microscopy (SEM)/energy dispersive X-ray spectroscopy (EDS) after each run. The decomposition of UN started at 1800°C despite the coating and matrix, and increased at 2000°C. Uranium seeped through the tungsten grain boundaries of the coating at all temperatures. The consolidated sample expanded irregularly at 2000°C through the formation of voids, and SEM/EDS analysis showed uranium-containing veins in the matrix consisting of U 2 Mo according to the XRD data. The observed pore generation at 2000°C was explained by the formation of water vapor from residual oxides and diffused hydrogen. At 2200°C and above, both the kernels and the consolidated samples melted through the formation of uranium or low–melting point uranium-molybdenum alloys.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

Jacobian-based model diagnostics and application to equation oriented modeling of a carbon capture system

It can be difficult to identify the specific variables or equations responsible for convergence issues in large mathematical programming models. The Institute for the Design of Advanced Energy Systems Integrated Platform (IDAES-IP) contains a tool to identify poorly scaled constraints and variables by searching for rows and columns of the Jacobian matrix with small L2-norms. A singular value decomposition is then performed to identify degenerate sets of equations and remaining scaling issues. Here, this work presents a flowsheet developed for post-combustion carbon capture using a monoethanolamine (MEA) solvent system as a case study. This work takes the reader through the entire process of model diagnostics and reformulation, from a basic introduction to the mathematics behind these model diagnostics to the reformulations necessary to make the model numerically robust, including a significantly modified enhancement factor model.

IDAES↗
DOE OSTI2022

Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods

Studying QCD and other gauge theories on quantum hardware requires the preparation of physically interesting states. The variational quantum eigensolver provides a way of performing vacuum state preparation on quantum hardware. Here in this work, variational quantum eigensolver is applied to pure SU(3) lattice Yang-Mills on a single plaquette and one dimensional plaquette chains. Bayesian optimization and gradient descent were investigated for performing the classical optimization. Ansatz states for plaquette chains are constructed in a scalable manner from smaller systems using domain decomposition and a stitching procedure analogous to the density matrix renormalization group. Small examples are performed on IBM’s superconducting Manila processor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Sylvester-preconditioned adaptive-rank implicit time integrators for advection-diffusion equations with variable coefficients

Here, we consider the adaptive-rank integration of multi-dimensional time-dependent advection-diffusion partial differential equations (PDEs) with variable coefficients. We employ a standard finite-difference method for spatial discretization coupled with high-order diagonally implicit Runge-Kutta temporal schemes. The discrete equation is a generalized Sylvester equation (GSE), which we solve with a projection-based adaptive-rank algorithm structured around two key strategies: (i) constructing dimension-wise subspaces using a novel atypical extended Krylov strategy, and (ii) efficiently solving the basis coefficient matrix with a preconditioned GMRES solver. The low-rank decomposition is performed in 2D using SVD and with high-order SVD (HOSVD) in 3D to represent the tensor in a compressed Tucker format. For d-dimensional problems (here, d = 2 or 3), the computational complexity and memory storage of the approach are found numerically to scale as and $\mathscr{O}(Nr^2) + \mathscr{O} (r^{d+1})$ and $\mathscr{O}(Nr) + \mathscr{O} (r^{d})$, respectively, with the one-dimensional resolution and the maximal rank during the Krylov iteration (which we find to be largely independent of on our numerical examples). We present numerical examples that illustrate the advertised properties of the algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Getting to the Core of PARAFAC2, A Nonnegative Approach

In this paper, the authors present a novel method of performing PARAFAC2 factorization of three-way data using a compact representation of that data. In the standard PARAFAC2 algorithm, two modes of the data are recovered directly during the decomposition while the third mode is returned as a transformation matrix, which is then used to rotate sets of orthogonal third-mode basis factors into interpretable factors. In our new method, the data are first decomposed into a core matrix and orthogonal factor loading matrices in the first two modes as well as sets of orthogonal factors in the third mode (as in standard PARAFAC2). The core matrix is then decomposed using a the standard PARAFAC2 strategy to produce transformation matrices in all three modes. The algorithm is particularly useful for very large data sets and essentially permits imposition of nonnegativity in all three modes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this article, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Fully Homomorphic Encryption

This code implements a Fully Homomorphic Encryption (FHE) system, enabling secure computation on encrypted data without requiring decryption. It supports encryption, decryption, and homomorphic operations like matrix multiplication and addition. This code is adaptable for integrating FHE into linear-time invariant (LTI) systems, including digital control and filtering. With proper configuration from subject matter expertise, encrypted system parameters and signals can be manipulated to perform tasks like state updates, output calculations, and convolution in the encrypted domain. By preserving the structure of LTI systems while ensuring privacy, the framework facilitates secure applications in areas such as autonomous systems, signal processing, and industrial automation. The code initializes the encryption system using parameters provided in the env dictionary. These parameters include the ciphertext modulus, key dimension, plaintext fixed-point scaling factor, and noise bound. During initialization, a secret key is generated, which is essential for encrypting and decrypting data securely. The modular design allows users to tailor these parameters to specific use cases or security requirements. The code implements multiple cryptographic schemes. The learning with errors (LWE) encryption method encodes cleartext message to their plaintext fixed-point representation then encrypted into ciphertext space with additive noise. This noise ensures the security of the scheme, relying on the computational hardness of the LWE problem. The code also includes the Gentry-Sahai-Waters (GSW) scheme based off the LWE problem. Homomorphic matrix multiplication is performed between the LWE and GSW to encrypted data. This is achieved using a decomposition function on the LWE ciphertext during the multiplication operation. For higher-dimensional data, the code includes a method to encrypt entire matrices (GSWMat) using GSW encryption. These encrypted matrices can then be used for homomorphic matrix multiplications (MatMult). The decryption function uses the secret key to recover the original plaintext, removing the added noise and scaling that was originally applied during encryption.

Lois, Roberts [Idaho National Laboratory (INL), Id↗
DOE OSTI2022

Final Technical Report for "Cloud-based Low-Scaling Quantum Chemistry Simulations for Materials"

The objective of phase I was to develop the basic infrastructure for performing efficient hybrid DFT calculations on solid materials with a turnaround time amenable to the use in large-scale data-driven approaches. To fulfill the goal we have developed a novel algorithm that significantly reduces the cost of exchange matrix formation. The algorithm does so by making use of three ingredients (a) interpolative decomposition of the electron integrals (b) robust pseudospectral method and (c) occ-RI approach. Our published work demonstrates that the algorithm is orders of magnitude faster than any other hybrid-DFT method and is on the order of only 3-4 times slower than pure DFT. All steps of the algorithm developed during phase I can be accelerated to the point that, for large enough systems, the diagonalization of the Fock matrix will become the most expensive step. To treat such large systems we have created an interface to the ASCR-funded PEXSI library. The PEXSI method is used to compute the density matrix directly from the Fock matrix in a manner that preserves the sparsity of the local representation.

Shiozaki, Toru↗
DOE OSTI2022

Maximum Likelihood Spectrum Decomposition for Isotope Identification and Quantification

A spectral decomposition method has been implemented to identify and quantify isotopic source terms in high-resolution gamma-ray spectroscopy in static geometry and shielding scenarios. Monte Carlo simulations were used to build the response matrix of a shielded high-purity germanium detector monitoring an effluent stream with a Marinelli configuration. The decomposition technique was applied to a series of calibration spectra taken with the detector using a multi-nuclide standard. These results are compared with decay-corrected values from the calibration certificate. For most nuclei in the standard ( 241 Am, 109 Cd, 137 Cs, and 60 Co), the deviations from the certificate values were generally no more than 6% with a few outliers as high as 10%. Furthermore, for 57 Co, the radionuclide with the lowest activity, the deviations from the standard reached as high as 25%, driven by the meager statistics in the calibration spectra. In addition, a complete treatment of error propagation for the technique is presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

A non‐intrusive domain‐decomposition model reduction method for linear steady‐state partial differential equations with random coefficients

Abstract Domain decomposition methods have been proved to be an effective strategy to reduce the dimension of parametric partial differential equations (PDEs). However, existing domain decomposition methods for parametric PDEs are usually intrusive, which means domain decomposition based solvers need to be implemented from scratch for each target parametric PDE. To address this issue, we develop a new non‐intrusive domain‐decomposition model reduction method for linear steady‐state PDEs with random‐field coefficients. As a variant of our previous work by Mu and Zhang, the new method only needs access to the final linear system, that is, the global stiffness matrix and the right hand side, of a deterministic PDE solver, in order to build a domain‐decomposition‐based reduced model without intrusive implementation from scratch. The key idea is to remove the interface condition between sub‐domains and rely on the correlation between columns of the linear system to couple the sub‐domains. The non‐intrusive feature enables the applicability of the proposed method to a broader class of uncertainty quantification problems, where many legacy codes/solvers can be fully reused by our method. Two numerical examples including diffusion equations with random diffusivity and convection‐dominated transport with random velocity, are provided to demonstrate the effectiveness and efficiency of our method.

Zhang, Guannan↗
DOE OSTI2022

Implementing the three-particle quantization condition for π + π + K + and related systems

Recently, the formalism needed to relate the finite-volume spectrum of systems of nondegenerate spinless particles has been derived. In this work we discuss a range of issues that arise when implementing this formalism in practice, provide further theoretical results that can be used to check the implementation, and make available codes for implementing the three-particle quantization condition. Specifically, we discuss the need to modify the upper limit of the cutoff function due to the fact that the left-hand cut in the scattering amplitudes for two nondegenerate particles moves closer to threshold; we describe the decomposition of the three-particle amplitude K df,3 into the matrix basis used in the quantization condition, including both s and p waves, with the latter arising in the amplitude for two nondegenerate particles; we derive the threshold expansion for the lightest three-particle state in the rest frame up to O(1/L 5 ); and we calculate the leading-order predictions in chiral perturbation theory for K df,3 in the π + π + K + and π + K + K + systems. We focus mainly on systems with two identical particles plus a third that is different (“2+1” systems). We describe the formalism in full detail, and present numerical explorations in toy models, in particular checking that the results agree with the threshold expansion, and making a prediction for the spectrum of π + π + K + levels using the two- and three-particle interactions predicted by chiral perturbation theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Polymer-Based Thermally Stable Chemiresistive Sensor for Real-Time Monitoring of NO 2 Gas Emission

Here, we present a thermally stable, mechanically compliant, and sensitive polymer-based NO 2 gas sensor design. Interconnected nanoscale morphology driven from spinodal decomposition between conjugated polymers tethered with polar side chains and thermally stable matrix polymers offers judicious design of NO 2 -sensitive and thermally tolerant thin films. The resulting chemiresitive sensors exhibit stable NO 2 sensing even at 170 °C over 6 h. Controlling the density of polar side chains along conjugated polymer backbone enables optimal design for coupling high NO 2 sensitivity, selectivity, and thermal stability of polymer sensors. Lastly, thermally stable films are used to implement chemiresistive sensors onto flexible and heat-resistant substrates and demonstrate a reliable gas sensing response even after 500 bending cycles at 170 °C. Such unprecedented sensor performance as well as environmental stability are promising for real-time monitoring of gas emission from vehicles and industrial chemical processes.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Exploring Hilbert space on a budget: Novel benchmark set and performance metric for testing electronic structure methods in the regime of strong correlation

This work explores the ability of classical electronic structure methods to efficiently represent (compress) the information content of full configuration interaction (FCI) wave functions. We introduce a benchmark set of four hydrogen model systems of different dimensionalities and distinctive electronic structures: a 1D chain, a 1D ring, a 2D triangular lattice, and a 3D close-packed pyramid. To assess the ability of a computational method to produce accurate and compact wave functions, we introduce the accuracy volume, a metric that measures the number of variational parameters necessary to achieve a target energy error. Using this metric and the hydrogen models, we examine the performance of three classical deterministic methods: (i) selected configuration interaction (sCI) realized both via an a posteriori (ap-sCI) and variational selection of the most important determinants, (ii) an a posteriori singular value decomposition (SVD) of the FCI tensor (SVD-FCI), and (iii) the matrix product state representation obtained via the density matrix renormalization group (DMRG). We find that the DMRG generally gives the most efficient wave function representation for all systems, particularly in the 1D chain with a localized basis. For the 2D and 3D systems, all methods (except DMRG) perform best with a delocalized basis, and the efficiency of sCI and SVD-FCI is closer to that of DMRG. For larger analogs of the models, the DMRG consistently requires the fewest parameters but still scales exponentially in 2D and 3D systems, and the performance of SVD-FCI is essentially equivalent to that of ap-sCI.

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

Evidence for the existence and ecological relevance of fast-cycling mineral-associated organic matter

Longstanding theories and models classify mineral-associated organic matter as the large ( ~ 60%) but slow-cycling and persistent portion of soil organic matter. Strong physico-chemical interactions and diffusion limitations restrict the turnover of mineral-associated organic matter, allowing carbon and nitrogen bound therein to persist in soil for as long as centuries to millennia. However, mineral-associated organic matter is a chemically and functionally diverse pool with a substantial portion cycling at relatively fast (i.e., minutes to years) timescales. Despite a growing body of evidence for the heterogenous and multi-pool nature of mineral-associated organic matter, we lack consensus on how to conceptualize and directly quantify fast-cycling mineral-associated organic matter and its ecological significance. We demonstrate that the dynamic qualities of fast-cycling mineral-associated organic matter vary based on 1) the chemistry of the mineral particles and organic matter, 2) the complex set of interactions between organic matter and the mineral matrix, and 3) the presence and strength of destabilizing forces that lead to decomposition or loss of mineral-associated organic matter (i.e., plant-microbe interactions, agricultural intensification, and climate change). Finally, we discuss potential implications and research opportunities for how we measure, manage, and model the dynamic subfraction of this otherwise persistent pool of soil organic matter.

Biological and medical sciences↗
DOE OSTI2020

Modeling Aerial Gamma-Ray Backgrounds Using Non-negative Matrix Factorization

Airborne gamma-ray surveys are useful for many applications, ranging from geology and mining to public health and nuclear security. In all these contexts, the ability to decompose a measured spectrum into a linear combination of background source terms can provide useful insights into the data and lead to improvements in the techniques that use spectral energy windows. Multiple methods for the linear decomposition of spectra exist but are subject to various drawbacks, such as allowing negative photon fluxes or requiring detailed Monte Carlo modeling. In this work, we propose using non-negative matrix factorization (NMF) as a data-driven approach to spectral decomposition. Using aerial surveys that include flights over water, we demonstrate that the mathematical approach of NMF finds physically relevant structure in the aerial gamma-ray background, namely, that measured spectra can be expressed as the sum of nearby terrestrial emission, distant terrestrial emission, and radon and cosmic emission. Furthermore, these NMF background components are compared with the background components obtained by noise-adjusted singular value decomposition (NASVD), which contain negative photon fluxes and, thus, do not represent the emission spectra in as straightforward a way. Finally, we comment on the potential areas of research that are enabled by NMF decompositions, such as new approaches to spectral anomaly detection and data fusion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A Micro-Mechanical Constitutive Model to Predict Hygrothermal Aging of Cross-Linked Polymers

Abstract A multi-physics material model is presented to describe the effects of temperature, oxygen, and humidity on the constitutive response of cross-linked polymers. The effect of hygrothermal damage on the mechanical integrity of the polymer matrix can be considered as the result of damage accumulation of two independent aging mechanism namely, i) thermo-oxidative, and ii) hydrolytic aging. In order to capture the mutual effects of thermo-oxidative and hydrolytic aging, an assumption has been made that each of the aging phenomenon can be superposed to each other. In fact, each of them works independently and as a result, they can compete with each other. Utilizing the theory of network decomposition, all phenomena and their correlation were modeled and thus, the strain energy function of the polymer matrix is written with respect to four independent mechanisms, i) the shrinking original matrix that has neither been attacked by water nor oxygen, ii) conversion of the first network to two new network due to the reduction and formation of cross-links, and iii) energy loss from network degradation due to attack of the water molecules to polymer active agents. Moreover, the proposed model is micro-mechanically based and is mainly relevant on thin samples due to our underlying assumption of homogeneous diffusion of oxygen and water throughout the matrix. The model has been validated against extensive data-sets obtained from experiments we specifically designed for concept validation.

Bahrololoumi, Amir↗