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 145 records · Page 8

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

Comparison between explicit and implicit discretization strategies for a dissipative thermal environment

We investigate strategies for simulating open quantum systems coupled to dissipative baths by comparing explicit wave function-based discretization [via multi-layer multi-configuration time-dependent Hartree (ML-MCTDH)] and the implicit density matrix-based master equation method [via tree tensor network hierarchical equations of motion (TTN-HEOM)]. For dissipative baths characterized by exponentially decaying bath correlation functions, the implicit discretization approach of HEOM—rooted in bath correlation function decompositions—proves significantly more efficient than explicit discretization of the bath into discrete harmonic modes. Explicit methods, like ML-MCTDH, require extensive mode discretization to approximate continuum baths, leading to computational bottlenecks. Case studies for two-level systems and a Fenna–Matthews–Olson complex model highlight TTN-HEOM’s superiority in capturing dissipative dynamics with relaxations with a minimal number of auxiliary modes, while the explicit methods are as exact as the HEOM in pure dephasing regimes. This comparison is enabled by the TENSO package, which has both ML-MCTDH and TTN-HEOM implemented using the same computational structure and propagation strategy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Third-body stabilization of supercritical CO 2 in CO oxidation: development and application of a ReaxFF force field for the CO/O/CO 2 system

Supercritical CO 2 (scCO 2 ) plays a crucial role as a solvent in separation processes, advanced power cycles, and materials processing. Nonetheless, the atomistic comprehension of how the dense scCO 2 matrix influences the fundamental reaction of carbon monoxide (CO) is still insufficiently explored. Experimental studies and molecular dynamics (MD) simulations frequently fail to detect the highly reactive, transient intermediates, such as atomic oxygen (O), that drive these reactions. Here, to address this issue, we have developed a novel ReaxFF reactive force field for the CO 2 /CO/O system. The force field parameters were calibrated using density functional theory and second-order Møller-Plesset calculations to model CO 2 crystal properties, intermolecular interactions, bond dissociation curves, and reaction energy barriers. The force field reproduces the cohesive energy of the CO 2 crystal, the pressure characteristics of bulk scCO 2 , the equation-of-state behavior over a wide pressure–density range, the pressure dependence of the C–O bond length under compression, and the structural properties of liquid and scCO 2 , as documented by experiments, ab-initio MD, and prominent non-reactive models. The force field was subsequently applied to study the CO + O → CO 2 reaction. In a dilute environment, the reaction is inefficient as the newly formed CO 2 rapidly dissociates due to excess kinetic and potential energy acquired from the exothermic reaction. Conversely, in a dense scCO 2 environment, the surrounding matrix acts as an efficient third body, stabilizing the emerging CO2 product via molecular collisions. Statistical analysis confirms an average excess energy dissipation of 133.9 ± 3.6 kcal/mol over 112.4 ± 17.9 ps. Kinetic energy decomposition reveals that ∼ 92% of the excess kinetic energy is stored in internal (rotational and vibrational) degrees of freedom. This ReaxFF force field establishes a mechanistic foundation for third-body stabilization in dense reactive environments.

Chowdhury, Emdadul Haque [Pennsylvania State Univ.↗

Thermal Decomposition of Cyclic, Oxygenated Hydrocarbons

This final technical report describes experimental and theoretical studies of the pyrolysis of molecules relevant to the production of biofuels from biomass. The primary goal of the project was to study how chemical structure affects the thermal decomposition mechanism of a series of cyclic, oxygenated hydrocarbons. To accomplish this, the products of thermal decomposition must first be identified. A pulsed hyperthermal nozzle was used to induce gas-phase pyrolysis of the samples at temperatures up to 1600 K. Product detection was accomplished with a matrix-isolation FTIR spectrometer.

09 BIOMASS FUELS↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

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↗

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗

GPU acceleration of all-electron electronic structure theory using localized numeric atom-centered basis functions

We present an implementation of all-electron density-functional theory for massively parallel GPU-based platforms, using localized atom-centered basis functions and real-space integration grids. Special attention is paid to domain decomposition of the problem on non-uniform grids, which enables compute- and memory-parallel execution across thousands of nodes for real-space operations, e.g. the update of the electron density, the integration of the real-space Hamiltonian matrix, and calculation of Pulay forces. To assess the performance of our GPU implementation, we performed benchmarks on three different architectures using a 103-material test set. We find that operations which rely on dense serial linear algebra show dramatic speedups from GPU acceleration: in particular, SCF iterations including force and stress calculations exhibit speedups ranging from 4.5 to 6.6. For the architectures and problem types investigated here, this translates to an expected overall speedup between 3–4 for the entire calculation (including non-GPU accelerated parts), for problems featuring several tens to hundreds of atoms. Additional calculations for a 375-atom Bi2Se3 bilayer show that the present GPU strategy scales for large-scale distributed-parallel simulations.

42 ENGINEERING↗

Metastable formation and disordering kinetics of body-centered orthorhombic CrNi 2 laths in a Cr-Ni binary alloy

Chromium (Cr) alloys combine low density with high-temperature strength but suffer from brittleness and rapid softening. Body-centered orthorhombic (BCO) CrNi 2 laths have been shown to improve Cr-alloy high-temperature strength retention, yet their thermal stability and transformation behavior remain unclear. CrNi 2 conventionally forms through long-range ordering from a face-centered cubic (FCC) phase. Using multiscale microscopy and neutron diffraction, we show that CrNi 2 instead nucleates from a body-centered cubic (BCC) matrix, in a binary Cr 85 Ni 15 alloy. Despite aging above the equilibrium ordering temperature, CrNi 2 persists for ∼220 h at 760 °C before fully disordering, indicating sluggish transformation kinetics. The formation and decomposition follow differing transformation pathways (BCC → CrNi 2 → FCC), revealing kinetic asymmetry not captured by equilibrium Cr-Ni phase diagrams. In conclusion, these findings redefine the transformation behavior of CrNi 2 , establish its metastable kinetic window, and suggest alloying strategies to stabilize CrNi 2 for precipitation strengthening of high-temperature Cr-alloys.

CrNi2 transformation kinetics↗

Pyrolysis Reactions of (2-Chloroethyl)benzene

Pyrolysis of polyvinyl chloride (PVC) is considered an alternative to traditional, mechanical methods of recycling. However, there is insufficient research conducted on the thermal decomposition pathways of PVC, particularly the fate of chlorinated hydrocarbons generated during the chemical recycling process. One significant product from the pyrolysis of PVC is (2- chloroethyl)benzene. Using a hyperthermal tubular reactor and matrix-isolation FTIR techniques, the pyrolysis products of gasphase (2-chloroethyl)benzene were identified. Following pyrolysis at 1400 K, the FTIR spectra indicated the formation of HCl, styrene, phenylacetylene, benzene, vinylacetylene, acetylene, propyne, ethylene, and propargyl radical.

Aromatic compounds↗

Perspectives on Quenching and Tempering 4340 Steel

Steels are ubiquitous due to their affordability and the landscape of useful properties that can be generated for engineering applications. But to further expand the performance envelope, one must be able to understand and control microstructure development by alloying and processing. In this paper we use multiscale, advanced characterization to better understand the structural and chemical evolution of AISI 4340 steel after quenching and tempering (Q&T), including the role of quench rate and short-time, isothermal tempering below 573 K (300 °C), with an emphasis on carbide formation. We compare the microstructure and/or property changes produced by conventional tempering to those produced by higher temperature, short-time “rapid” tempering. We underscore that no single characterization technique can fully capture the subtle microstructure changes like carbon redistribution, transition carbide and/or cementite formation, and retained austenite decomposition that occur during Q&T. Only the use of multiple techniques begins to unravel these complexities. After controlled fast or slow quenching, η transition carbides clearly exist in the microstructure, likely associated with autotempering of this high martensite start temperature (Ms) steel. Isothermal tempering below 598 K (325 °C) results in the relief of carbon supersaturation in the martensite, primarily by the formation of η transition carbides that exhibit a range of carbon levels, seemingly without substitutional element partitioning between the carbide and matrix phases. Hägg transition carbide is present between 300 °C and 325 °C. After conventional tempering at or above 598 K (325 °C) for 2 h, cementite is predominant, but small amounts of cementite are also present in other conditions, even after quenching. Previous work has indicated that silicon (Si) and substitutional elements partition between the cementite, which initially forms under paraequilibrium conditions, and the matrix. Phosphorous (P) may also be preferentially located at cementite/matrix interfaces after high temperature tempering. Slower quench rates result in greater amounts of retained austenite compared to those after fast quenching, which we attribute to increased austenite stability resulting from “autopartitioning”. Rapid, high temperature tempering is also found to diminish tempered martensite embrittlement (TME) believed to be associated with the extent of austenite decomposition, resulting in mechanical properties not attainable by conventional tempering, which may have important implications with respect to industrial heat treatment processes like induction tempering. Controlling the amount and stability of retained austenite is not only relevant to the properties of Q&T steels, but also next-generation advanced high strength steels (AHSS) with austenite/martensite mixtures.

36 MATERIALS SCIENCE↗

Software for the frontiers of quantum chemistry: An overview of developments in the Q-Chem 5 package

This article summarizes technical advances contained in the fifth major release of the Q-Chem quantum chemistry program package, covering developments since 2015. A comprehensive library of exchange-correlation functionals, along with a suite of correlated many-body methods, continues to be a hallmark of the Q-Chem software. The many-body methods include novel variants of both coupled-cluster and configuration-interaction approaches along with methods based on the algebraic diagrammatic construction and variational reduced density-matrix methods. Methods highlighted in Q-Chem 5 include a suite of tools for modeling core-level spectroscopy, methods for describing metastable resonances, methods for computing vibronic spectra, the nuclear-electronic orbital method, and several different energy decomposition analysis techniques. High-performance capabilities including multithreaded parallelism and support for calculations on graphics processing units are described. Q-Chem boasts a community of well over 100 active academic developers, and the continuing evolution of the software is supported by an "open teamware" model and an increasingly modular design.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Local Structural Disorder in Metavanadates MV 2 O 6 (M = Zn and Cu) Synthesized by the Deep Eutectic Solvent Route: Photoactive Oxides with Oxygen Vacancies

Metavanadates MV 2 O 6–δ (M = Zn and Cu) are synthesized by using a deep eutectic solvent (DES), a mixture of hydrogen bond donor and acceptor, as a reaction medium. Dissolution of stable binary metal oxides in a DES followed by a heat treatment yields phase-pure vanadates. According to in situ powder X-ray diffraction, ternary phases (α-Zn 2 V 2 O 7 and β-Cu 2–x V 2 O 7 , x ~ 0.27) are intermediates in the reaction pathway taken. Identifying a polymorphic phase transformation temperature for CuV 2 O 6 as well as the narrow temperature range between formation and decomposition for both metavanadates allows for tackling the challenge of the synthesis of these materials. The oxygen vacancy introduced by the DES route is accompanied by the formation of reduced V 4+ and Cu + in the oxide matrix, based on X-ray photoelectron spectroscopy. These oxygen vacancies modify the vibrational modes in the corresponding Raman spectra and are also responsible for broad optical absorptions in the 1.8–1.1 eV range. The optical band gaps of the materials are found at 1.8 eV (CuV 2 O 6 ) and 2.2 eV (ZnV 2 O 6 ), approximately 0.1–0.3 eV below the values reported in the literature. The reduced band gaps and sub-band gap photon absorption are key features of the oxygen-deficient metavanadates. Surface photovoltage spectroscopy reveals that all the synthesized vanadates are n-type materials with electrons as the majority charge carriers, and photoelectrochemical measurements confirm photoanodic currents for methanol oxidation. Furthermore, these results provide insight into the synthesis and structure–property relationship of the metavanadates for their potential use as photoanodes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

nuclear-score-maximization v1.0

This software library presents efficient and multithreaded implementations of matrix low rank approximation via column selection in C++17 code. The algorithms are described in Fornace, Mark, and Michael Lindsey. "Column and row subset selection using nuclear scores: algorithms and theory for Nystro m approximation, CUR decomposition, and graph Laplacian reduction." arXiv preprint arXiv:2407.01698 (2024). The presented methods are by-and-large ver novel, have provable approximation guarantees, multiple use-cases, and exhibit higher quality approximations on a variety of studied examples.

Fornace, Mark↗

Chemical recycling of polymer composites induced by selective variable frequency microwave heating

Abstract The application of variable frequency microwave (VFM) heating to achieve rapid thermal depolymerization of polymer composites is reported for the first time. The thermal and chemical influence of composite additives on polymer decomposition has been studied for a set of chemically recyclable polymers, including polyphthalaldehyde, polypropylene carbonate, two polyhydroxyalkanoates, and nylon 6. Carbon‐based additives, specifically nanocarbon particles, were used as effective microwave absorbers to controllably degrade the surrounding polymer matrix into valuable, monomeric compounds. Depolymerization and byproduct confirmation were quantified by gel permeation chromatography and nuclear magnetic resonance spectroscopy. Synergistic effects can be leveraged from pre‐treating composite samples to further reduce the total microwave energy required to depolymerize composite samples. This study establishes the use of VFM heating for chemical recycling of polymer composites that can be leveraged toward a plastic circular economy.

Polymer Science↗

Quantum Many-Body Theory from a Solution of the N -Representability Problem

Here, in this study, we present a many-body theory based on a solution of the N-representability problem in which the ground-state two-particle reduced density matrix (2-RDM) is determined directly without the many-particle wave function. We derive an equation that re-expresses physical constraints on higher-order RDMs to generate direct constraints on the 2-RDM, which are required for its derivation from an N-particle density matrix, known as N-representability conditions. The approach produces a complete hierarchy of 2-RDM constraints that do not depend explicitly upon the higher RDMs or the wave function. By using the two-particle part of a unitary decomposition of higher order constraint matrices, we can solve the energy minimization by semidefinite programming in a form where the low-rank structure of these matrices can be potentially exploited. We illustrate by computing the ground-state electronic energy and properties of the H 8 ring.

74 ATOMIC AND MOLECULAR PHYSICS↗

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗