Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hybrid 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 19 records

A reduced order sulfuric acid decomposition model for a nuclear-powered hybrid sulfur cycle

A reduced order model of sulfuric acid decomposition within a bayonet chemical reactor was developed to support the U. S. Department of Energy Integrated Energy System program, and address the lack of knowledge in scaling and integration for joint chemical and nuclear processes. Sulfuric acid decomposition within a bayonet reactor was modeled to provide chemical and thermodynamic data relevant to advanced nuclear reactor-driven integrated energy systems based on desired operational scale and operational conditions. The temperature range required for high-temperature advanced nuclear reactor integrated energy systems, 750-850 °C, was shown to produce reasonable agreement (within a few percent relative error) with past models and experimental data, and yielded good efficiency results for bayonet reactor operations. The results of the reduced order model agreed with previous work from Savannah River National Labs within a maximum of 3.4% error on the decomposition of sulfur trioxide, and on previous Hybrid Sulfur flowsheets from Gorensek and Summers that showed operational temperature, pressure, and composition ranges for efficiency which made the Hybrid Sulfur cycle competitive with water electrolysis. Here, the agreement with previous high-fidelity models provided a framework for future Integrated Energy System grid evaluations with an advanced nuclear reactor and large-scale hydrogen production using a mathematical model to represent chemical operations.

08 HYDROGEN↗

Hybrid Density Functional Theory Comparison of Oxygen Release and Solvent Decomposition Kinetics on Li x NiO 2 Surfaces

High-nickel-content layered oxides are among the most promising electric vehicle battery cathode materials. However, their interfacial reactivity with electrolytes and tendency toward oxygen release (possibly yielding reactive 1 O 2 ) remain degradation concerns. Elucidating the most relevant (i.e., fastest) interfacial degradation mechanism will facilitate future mitigation strategies. We apply screened hybrid density functional (HSE06) calculations to compare the reaction kinetics of Li x NiO 2 surfaces with ethylene carbonate (EC) with those of O 2 release. Further, on both the (001) and (104) facets, EC oxidative decomposition exhibits lower activation energies than O 2 release. Our calculations, coupled with previously computed liquid-phase reaction rates of 1 O 2 with EC, strongly question the role of “reactive 1 O 2 ” species in electrolyte oxidative degradation. The possible role of other oxygen species is discussed. To deal with the challenges of modeling Li x NiO 2 surface reactivity, we emphasize a “local structure” approach instead of pursuing the global energy minimum.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimization under uncertainty of a hybrid waste tire and natural gas feedstock flexible polygeneration system using a decomposition algorithm

Market uncertainties motivate the development of flexible polygeneration systems that are able to adjust operating conditions to favor production of the most profitable product portfolio. However, this operational flexibility comes at the cost of higher capital expenditure. A scenario-based two-stage stochastic nonconvex Mixed-Integer Nonlinear Programming (MINLP) approach lends itself naturally to optimizing these trade-offs. This work studies the optimal design and operation under uncertainty of a hybrid feedstock flexible polygeneration system producing electricity, methanol, dimethyl ether, olefins or liquefied (synthetic) natural gas. A recently developed C++ based software framework (named GOSSIP) is used for modeling the optimization problem as well as its efficient solution using the Nonconvex Generalized Benders Decomposition (NGBD) algorithm. Two different cases are studied: The first uses estimates of the means and variances of the uncertain parameters from historical data, whereas the second assesses the impact of increased uncertain parameter volatility. The value of implementing flexible designs characterized by the value of the stochastic solution (VSS) is in the range of 260–405 M$ for a scale of approximately 893 MW of thermal input. Increased price volatility around the same mean results in higher expected net present value and VSS as operational flexibility allows for asymmetric exploitation of price peaks.

42 ENGINEERING↗

Electromagnetic Energy-Assisted Thermal Conversion of Fossil-Based Hydrocarbons to Low-Cost Hydrogen

The goal of this project was to develop and optimize catalysts for methane decomposition, particularly focusing on regeneration via an electromagnetic energy-assisted mechanism, to produce hydrogen more cost-effectively compared to electrolysis routes. To achieve this goal, the project pursued several key objectives. The project began with the preparation and testing of various catalysts. A nickel-silica based catalyst was identified as the most promising material for the pyrolysis of methane into carbon and hydrogen. Kinetic parameters for methane decomposition were determined, aiding in computational modeling efforts. Structured catalysts were investigated, highlighting the need for frequent cleaning or regeneration to maintain performance, with methane conversion rates exceeding 70% in tube furnace tests. Computational fluid dynamics modeling was employed to optimize reactor designs and electrode angles, leading the project team to propose a multi-compartment thermal conversion system for larger setups. This modeling work was important in understanding reaction characteristics, carbon deposition rates, and temperature profiles under various conditions. A bench-scale reactor system was assembled to evaluate catalyst regeneration using electromagnetic energy-assisted mechanisms. Experiments demonstrated the potential for carbon removal, though further optimization is needed. The carbon produced from the methane conversion process was evaluated for potential use in lithium-ion battery electrodes. The carbon exhibited properties similar to commercially available high-purity multi-walled carbon nanotubes and nanofibers, with a carbon content greater than 95%. Coin cell batteries assembled with this carbon showed that lower replacement levels (10% to 33%) outperformed the control group, improving specific capacity density and stability. However, higher replacement levels (100%) demonstrated poorer performance, suggesting that excessive carbon substitution negatively impacts battery performance. These findings indicate the potential marketability of the produced carbon as a component in lithium-ion batteries, though further testing is necessary to confirm long-term advantages and disadvantages associated with the use of the carbon product. These results however justified further technoeconomic assessments to determine if the process can provide low-cost hydrogen. The economic feasibility and technical performance of methane decomposition for hydrogen production were assessed, focusing on three plant configurations: 100E (electrically heated), 100C (combustion heated using produced hydrogen), and PE-Hybrid (a combination of pyrolysis (indicating decomposition) and electrolysis). The Levelized Cost of Hydrogen (LCOH) for the pyrolysis configurations was found to be approximately 25% lower than that of electrolysis. The 100E configuration had the lowest LCOH at $\$$3.12/kg. Including carbon product sales significantly improved the economics, with the 100C configuration achieving a negative LCOH of -$\$$0.35/kg. The PE-Hybrid configuration was not economically advantageous compared to pure pyrolysis plants due to its complexity and additional equipment requirements. Ultimately, methane pyrolysis presents a viable method for near carbon dioxide-free hydrogen production, with significant economic advantages over electrolysis, especially when considering the sale of carbon byproducts. The 100E and 100C configurations showed the most promise, with the choice between them ultimately depending on the prices of power and natural gas. In conclusion, this technology has the potential to lower hydrogen production costs by leveraging the methane decomposition process with the sale of valuable carbon byproducts. By optimizing catalyst performance and integrating electromagnetic energy-assisted regeneration, the process can achieve higher efficiency and economic viability, making it a competitive alternative to traditional hydrogen production methods.

08 HYDROGEN↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗

Hybrid biological-chemical strategy for converting polyethylene into a recyclable plastic monomer using engineered Corynebacterium glutamicum

Converting polyethylene (PE) into valuable materials, particularly ones that are better for the environment than the incumbent plastics, not only helps mitigate environmental issues caused by plastic waste but also alleviates the long-standing problem of microbial fermentation competing with food supplies. However, the inherent robustness of PE due to its strong carbon-carbon bonds and high molecular weight necessitates harsh decomposition conditions, resulting in diverse decomposition outcomes that present significant challenges for downstream applications, especially for bioconversion. In this study, we demonstrate a hybrid biological-chemical conversion process for PE, converting its decomposition products, namely short-chain diacids, into a monomer, β-keto-δ-lactone (BKDL), for highly recyclable polydiketoenimine plastics using engineered Corynebacterium glutamicum. Since BKDL synthesis requires a substantial supply of malonyl-CoA, we employed an alternative biosynthesis pathway that leverages C. glutamicum's natural proficiency in amino acid production. We optimized this pathway in vivo by minimizing carbon loss to CO2 and byproducts, improving the transporter system, and maximizing co-factor regeneration. Furthermore, we co-optimized the PE deconstruction process to produce predominantly C4 to C6 diacids and integrated three catabolic pathways into the engineered strain to enhance diacid utilization, maximizing the carbon conversion from PE. Finally, an engineered polyketide synthase was introduced into C. glutamicum to enable BKDL synthesis. This work demonstrates the potential of a chemo-biological hybrid strategy for recycling plastic waste, highlighting its promise in addressing environmental challenges and promoting sustainable materials.

Zhan, Chunjun↗

Status of GPU capabilities within the Shift Monte Carlo radiation transport code

Shift is a general-purpose Monte Carlo (MC) radiation transport code for fission, fusion, and national security applications. Shift has been adapted to efficiently run on GPUs in order to leverage leadership-class supercomputers. This work presents Shift’s current GPU capabilities. These include core radiation transport capabilities for eigenvalue and fixed-source simulations, and support for non-uniform domain decomposition, Doppler broadening, free-gas elastic scattering, general-purpose geometry, hybrid MC/deterministic transport, and depletion. Transport results demonstrate a 2–5× GPU-to-CPU speedup on a per-node basis for an eigenvalue problem on the Frontier supercomputer and a 28× speedup for a fixed-source problem on the Summit supercomputer.

Biondo, Elliott [ORNL] (ORCID:0000000290881360)↗

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗

Collective neutrino oscillations on a quantum computer with hybrid quantum-classical algorithm

We simulate the time evolution of collective neutrino oscillations in two-flavor settings on a quantum computer. We explore the generalization of Trotter-Suzuki approximation to time-dependent Hamiltonian dynamics. The trotterization steps are further optimized using the Cartan decomposition of two-qubit unitary gates U ϵ SU(4) in the minimum number of controlled-NOT (CNOT) gates making the algorithm more resilient to the hardware noise. As a result, a more efficient hybrid quantum-classical algorithm is also explored to solve the problem on noisy intermediate-scale quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms

The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost .

Tomesh, Teague↗

Estimating Eigenenergies from Quantum Dynamics: A Unified Noise-Resilient Measurement-Driven Approach

Ground state energy estimation in physical, chemical, and materials sciences is one of the most promising applications of quantum computing. In this work, we introduce a new hybrid approach that finds the eigenenergies by collecting real-time measurements and post-processing them using the machinery of dynamic mode decomposition (DMD). From the perspective of quantum dynamics, we establish that our approach can be formally understood as a stable variational method on the function space of observables available from a quantum many-body system. We also provide strong theoretical and numerical evidence that our method converges rapidly even in the presence of a large degree of perturbative noise, and show that the method bears an isomorphism to robust matrix factorization methods developed independently across various scientific communities. Our numerical benchmarks on spin and molecular systems demonstrate an accelerated convergence and a favorable resource reduction over state-of-the-art algorithms. The DMD-centric strategy can systematically mitigate noise and stands out as a leading hybrid quantum-classical eigensolver.

Shen, Yizhi↗

Replace Human Intelligence with Fast and Smart Geometric Reasoning and Graph Neural Network to Accelerate Next Gen ModSim Workflows

We present an agent-guided approach to CAD geometry decomposition that automates hex/hybrid meshing with graph neural networks (GNNs) to accelerate next-generation ModSim workflows. Our end-to-end pipeline (i) reduces 3D boundary-representation (B-Rep) models to a 2D chordal axis skeleton (CAT) and then to a 1D bipartite graph of surface and curve nodes, (ii) assigns per node labels as Cubit® WebCut actions, (iii) trains a multi-action GNN under supervised learning, and (iv) predicts five surface-node and three curve-node actions on out-of-distribution test geometries. Each graph node carries geometric, topological, and meshing attributes drawn from the B-Rep “skin” and CAT “skeleton,” with two-way mappings across 3D↔2D↔1D representations to maintain traceability back to 3D CAD. The supervised learning model exhibits stable convergence of the binary cross-entropy loss and achieves 98.7% accuracy on unseen lattice models. To operationalize decision-making, we rank predicted commands by geometric significance and prototyped the agent-guided workflow through the Cubit® Meshing PowerTool GUI. As a stretch goal, we explore reinforcement learning (RL) to reduce or remove label requirements and to learn policies for action sequences that maximize total reward (e.g., size of hex-meshable regions and resulting hex mesh quality). When all-hex meshing is not feasible, the agent assists in producing hybrid meshes—prioritizing hex in critical regions and transitioning to tetrahedral elements (tets) elsewhere—maintaining fidelity while ensuring robustness. The overarching objective is to replace manual, heuristics-based decomposition with data-driven, reproducible automation, cutting meshing turnaround time by orders of magnitude. We anticipate direct impact on simulation workflows through intelligent, scalable decomposition of complex CAD models into hex-meshable subdomains.

97 MATHEMATICS AND COMPUTING↗