Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Dimensionality reduction”

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 OSTI2025

LUNA: LUT-Based Neural Architecture for Fast and Low-Cost Qubit Readout

Qubit readout is a critical operation in quantum computing systems, which maps the analog response of qubits into discrete classical states. Deep neural networks (DNNs) have recently emerged as a promising solution to improve readout accuracy . Prior hardware implementations of DNN-based readout are resource-intensive and suffer from high inference latency, limiting their practical use in low-latency decoding and quantum error correction (QEC) loops. This paper proposes LUNA, a fast and efficient superconducting qubit readout accelerator that combines low-cost integrator-based preprocessing with Look-Up Table (LUT) based neural networks for classification. The architecture uses simple integrators for dimensionality reduction with minimal hardware overhead, and employs LogicNets (DNNs synthesized into LUT logic) to drastically reduce resource usage while enabling ultra-low-latency inference. We integrate this with a differential evolution based exploration and optimization framework to identify high-quality design points. Our results show up to a 10.95x reduction in area and 30% lower latency with little to no loss in fidelity compared to the state-of-the-art. LUNA enables scalable, low-footprint, and high-speed qubit readout, supporting the development of larger and more reliable quantum computing systems.

Farooq, M. A. [Arizona State U., Tempe]↗
DOE OSTI2024

Reduce-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which usually consists of a database of tabulated values, used to calculate the cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of micro cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. To address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multi-group cross section data across isotopes, reaction types and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs for have been trained for all isotopes in this work and systematic Griffin testing is ongoing at this moment to ensure the feasibility of this ROM technique for cross section predictions.

42 - ENGINEERING↗
DOE OSTI2024

Reduced-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗
DOE OSTI2024

Advanced Cross Section Library Generation using Reduced Order Models

Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗
DOE OSTI2025

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗
DOE OSTI2024

Efficient Dimension Reduction of Complex Three-dimensional CO2 Saturation using Deep Learning Models

In the domain of deep learning (DL), dimension reduction is crucial for enhancing training efficiency and mitigating overfitting, particularly when managing complex data such as three-dimensional (3D) saturation data. The 3D saturation data in the context of geological carbon storage (GCS) presents unique challenges due to its inherent sparsity and the abrupt transitions at plume boundaries, known as shock fronts. To address the challenges, we proposed a novel DL framework that integrates dimension reduction with advanced 3D reconstruction techniques. Our model leveraged latent variables derived from 2D average saturation data, offering a robust and efficient solution tailored to the intricate dynamics of 3D saturation fields. The proposed framework can extract the critical features of the high-dimensional data while reducing the variable numbers, which is more tractable for DL models and enhances the model robustness and accuracy. Therefore, it provides a novel approach for modeling and analyses in complex geological scenarios, which finds great potential applications in environmental monitoring and energy storage.

Wang, Hongsheng↗
DOE OSTI2025

Dimensional Evolution Guides Property Control in the A n Cu 4– n TiS 4 Semiconductor Series

Through progressive reduction of the three-dimensional (3D) covalent network of Cu 4 TiS 4 , we isolate seven new members of the A n Cu 4–n TiS 4 family (A = alkali metal; n = 0–4), spanning 3D, 2D, 1D, and 0D structural fragments. The dimensional reduction is rational, as it preserves the edge-sharing connectivity between [CuS 4 ] 7– and [TiS 4 ] 4– tetrahedra across the series. This structural evolution is driven by the stepwise substitution of Cu with alkali metals, guiding the formation of fragments with reduced dimensionality. The effects of “n” and “A” on the crystal structures, stabilities, electronic structures, and optoelectronic properties are profound, demonstrating that the manipulation of alkali metal size and A n Cu 4–n TiS 4 stoichiometry enables predictable variations in structure and properties. For example, the n = 0 and n = 4 end members of the A n Cu 4–n TiS 4 family set the range of achievable band gaps with 2.00 eV for Cu 4 TiS 4 , 2.60 eV for Na 4 TiS 4 , and intermediate values for the n = 1–3 members. Notably, CsCu 3 TiS 4 exhibits exceptional air stability and congruent melting, with density functional theory (DFT) calculating moderate hole and electron effective masses in specific crystallographic directions (mh = 1.24m 0 , me = 0.87m 0 ). Additionally, A 3 CuTiS 4 (A = Na, K, Rb) displays direct band gap behavior and long photoluminescence lifetimes of 2.3–8.6 μs, and K 3 CuTiS 4 has a PLQY of 5.19%. These findings underscore the potential of the A n Cu 4–n TiS 4 family for applications in optoelectronics and demonstrate widely applicable design concepts that unveil rational stoichiometries within a given composition space to generate a series of crystal structures related through an evolving covalent dimensionality that corresponds to a predictable electronic structure and property progression.

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

Anisotropic 2D van der Waals Magnets Hosting 1D Spin Chains

Abstract The exploration of 1D magnetism, frequently portrayed as spin chains, constitutes an actively pursued research field that illuminates fundamental principles in many‐body problems and applications in magnonics and spintronics. The inherent reduction in dimensionality often leads to robust spin fluctuations, impacting magnetic ordering and resulting in novel magnetic phenomena. Here, structural, magnetic, and optical properties of highly anisotropic 2D van der Waals antiferromagnets that uniquely host spin chains are explored. First‐principle calculations reveal that the weakest interaction is interchain, leading to essentially 1D magnetic behavior in each layer. With the additional degree of freedom arising from its anisotropic structure, the structure is engineered by alloying, varying the 1D spin chain lengths using electron beam irradiation, or twisting for localized patterning, and spin textures are calculated, predicting robust stability of the antiferromagnetic ordering. Comparing with other spin chain magnets, these materials are anticipated to bring fresh perspectives on harvesting low‐dimensional magnetism.

1D magnetism↗
DOE OSTI2024

Bayesian reduced-order deep learning surrogate model for dynamic systems described by partial differential equations

We propose a reduced-order deep-learning surrogate model for dynamic systems described by time-dependent partial differential equations. This method employs space–time Karhunen–Loève expansions (KLEs) of the state variables and space-dependent KLEs of space-varying parameters to identify the reduced (latent) dimensions. Subsequently, a deep neural network (DNN) is used to map the parameter latent space to the state variable latent space. An approximate Bayesian method is developed for uncertainty quantification (UQ) in the proposed KL-DNN surrogate model. The KL-DNN method is tested for the linear advection–diffusion and nonlinear diffusion equations, and the Bayesian approach for UQ is compared with the deep ensembling (DE) approach, commonly used for quantifying uncertainty in DNN models. It was found that the approximate Bayesian method provides a more informative distribution of the PDE solutions in terms of the coverage of the reference PDE solutions (the percentage of nodes where the reference solution is within the confidence interval predicted by the UQ methods) and log predictive probability. The DE method is found to underestimate uncertainty and introduce bias. For the nonlinear diffusion equation, we compare the KL-DNN method with the Fourier Neural Operator (FNO) method and find that KL-DNN is 10% more accurate and needs less training time than the FNO method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Genetic programming for the nuclear many-body problem: a guide

Genetic Programming (GP) is an evolutionary algorithm that generates computer programs, or mathematical expressions, to solve complex problems. In this Guide, we demonstrate how to use GP to develop surrogate models to mitigate the computational costs of modeling atomic nuclei with ever increasing complexity. The computational burden escalates when uncertainty quantification is pursued, or when observables must be globally computed for thousands of nuclei. By studying three models in which the mean field depends on the total particle density self-consistently, we show that by constructing reduced order models supported by GP one can speed up many-body computations by several orders of magnitude with a negligible loss in accuracy.

dimensionality reduction↗
DOE OSTI2024

Excited-state downfolding using ground-state formalisms

Downfolding coupled cluster (CC) techniques are powerful tools for reducing the dimensionality of many-body quantum problems. This work investigates how ground-state downfolding formalisms can target excited states using non-Aufbau reference determinants, paving the way for applications of quantum computing in excited-state chemistry. This study focuses on doubly excited states for which canonical equation-of-motion CC approaches struggle to describe unless one includes higher-than-double excitations. The downfolding technique results in state-specific effective Hamiltonians that, when diagonalized in their respective active spaces, provide ground- and excited-state total energies (and therefore excitation energies) comparable to high-level CC methods. The performance of this procedure is examined with doubly excited states of H 2 , Methylene, Formaldehyde, and Nitroxyl.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

TensorID v1.0

This Python software package includes new and efficient algorithms for satellite and core interpolative decomposition of tensor data. In general, these algorithms target high-dimensional data reduction and compression. The software is purely numerical and can be applied by others to many important sources of tensor data generated by computation or experiment.

Zhang, Yifan [Lawrence Berkeley National Laborator↗
DOE OSTI2025

Unraveling Dimensional Tuning: From 2D to 3D in Covalent Organic Frameworks for Enhanced 2e – Oxygen Reduction Reaction

Covalent organic frameworks (COFs) with a two-dimensional (2D) topology have recently emerged as promising catalyst systems for the electrosynthesis of hydrogen peroxide (H 2 O 2 ) from oxygen (O 2 ). However, designing 2D catalysts to achieve higher H 2 O 2 selectivity presents a significant challenge because of the extensive layer stacking and the aggregated active sites located in the basal planes. It results in lower atom utilization, which requires attention. In this study, we present two functionally similar COFs: one with a 2D rhombus topology (2D@BT_TPA-COF) and another with a three-dimensional (3D) noninterpenetrated pts topology (3D@BT_TPA-COF). Both COFs were utilized for the 2e – oxygen reduction reaction (2e – ORR). Tunning the dimensionality from 2D to 3D resulted in an increase in H 2 O 2 selectivity from approximately ~56% to approximately ~96% (at 0.4 V) and a rise in the turnover frequency (TOF) from 0.05 to 0.08 s –1 at 0.3 V. Nonaggregated active site distribution over 3D topology, featuring higher active site exposure, provides better access to the O 2 /electrolyte and facilitates electron transfer leading to higher 2e – ORR activity and selectivity compared to the 2D counterpart.

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

ML-based Dimension Reduction Strategies

Deep learning (DL)--based surrogate models have achieved success in various applications in carbon capture and storage (CCS). However, the model training on high-dimensional spaces is computationally expensive and impractical for large-scale and complex geological models, because the models usually contain hundreds of thousands to millions of grid cells, each with a set of parameters. Furthermore, the high cost of generating training data with sufficient variation is another limitation of model training on high-dimensional spaces, which may result in overfitting and reduce the model efficiency and prediction performance. We proposed the workflow incorporating dimension reduction methods and deep learning models, which aim to extract the latent variables of input parameters and output state variables, and then build the mapping function at the latent spaces. The proposed workflow can significantly reduce the computational complexity in solving both forward and inverse problems compared to models trained on high-dimensional spaces. Dimensionality reduction models showed great potential in workflows for fast reservoir simulation, history matching, prior model generation, visualization, and more, ultimately enhancing DL model performance in related SMART Work Packages.

Hosseini, Seyyed↗
DOE OSTI2025

A Phenazine‐Based Two‐Dimensional Covalent Organic Framework for Photochemical CO 2 Reduction with Increased Selectivity for Two‐Carbon Products

Abstract The reduction of carbon dioxide (CO₂) into valuable products will contribute to sustainable carbon use. Here we report the photocatalytic reduction of CO₂ to carbon monoxide, formate, and oxalate ions using a redox‐active phenazine‐based 2D covalent organic framework (Phen‐COF) and its phenazine monomer. Under similar irradiation conditions,Phen‐COFproduced 2.9 times more CO, 11 times more formate, and 13 times more oxalate compared to equimolar amounts of the monomeric phenazine, demonstrating that the COF architecture enhances catalytic performance (TOF COF : 10 −7 s −1 CO, 10 −8 s −1 formate, and 10 −11 s −1 oxalate). Structural analysis, including X‐ray diffraction and N₂ porosimetry, confirmed the COF's long‐range order and porosity. Mechanistic studies suggest a sequential formate‐to‐oxalate pathway, with CO and formate acting as intermediates. These results demonstrate the potential of the COF architecture to improve the performance of metal‐free, redox‐active aromatic systems such as phenazines to facilitate efficient and selective CO₂ conversion under mild conditions.

Chemistry↗
DOE OSTI2025

Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems

Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.

97 MATHEMATICS AND COMPUTING↗