Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “singular value 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 OSTI2025

A 28 nm multiply-accumulate ASIC architecture for on-chip data compression in MHz frame rate X-ray and electron pixel detectors

Modern X-ray detector systems urgently require compact, efficient, and fast data compression schemes to handle the transmission of big data from pixel arrays, enabling frame rates in the MHz regime. Here, in this work, a data compression ASIC that implements a streaming fixed-length lossy compression scheme is introduced and analyzed, proving the feasibility and benefits of on-chip compression. The compression scheme utilizes a vector matrix product logic, which performs a number of floating-point multiplications, additions, and accumulations. The logic is verified, synthesized, and shown to fit in the area resource available for the X-ray detector under study, which comprises 192 × 168 pixels each of 12-bit width, and having a total area of 20 mm× 20 mm, about 2 mm× 20 mm of which are available for the digital logic. Several system architectures, precisions, and compression ratios ranging from 100 to 250 were analyzed to pave the way for on-chip fixed-length compression (e.g., principal component analysis, singular value decomposition) and data reduction (e.g., azimuthal integration) for X-ray and electron detectors.

Data compression↗
DOE OSTI2024

Distance preserving machine learning for uncertainty aware accelerator capacitance predictions

Abstract Accurate uncertainty estimations are essential for producing reliable machine learning models, especially in safety-critical applications such as accelerator systems. Gaussian process models are generally regarded as the gold standard for this task; however, they can struggle with large, high-dimensional datasets. Combining deep neural networks with Gaussian process approximation techniques has shown promising results, but dimensionality reduction through standard deep neural network layers is not guaranteed to maintain the distance information necessary for Gaussian process models. We build on previous work by comparing the use of the singular value decomposition against a spectral-normalized dense layer as a feature extractor for a deep neural Gaussian process approximation model and apply it to a capacitance prediction problem for the High Voltage Converter Modulators in the Oak Ridge Spallation Neutron Source. Our model shows improved distance preservation and predicts in-distribution capacitance values with less than 1% error.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗
DOE OSTI2024

GLAD-M35: a joint P and S global tomographic model with uncertainty quantification

We present our third and final generation joint P and S global adjoint tomography (GLAD) model, GLAD-M35, and quantify its uncertainty based on a low-rank approximation of the inverse Hessian. Starting from our second-generation model, GLAD-M25, we added 680 new earthquakes to the database for a total of 2160 events. New P-wave categories are included to compensate for the imbalance between P- and S-wave measurements, and we enhanced the window selection algorithm to include more major-arc phases, providing better constraints on the structure of the deep mantle and more than doubling the number of measurement windows to 40 million. Two stages of a Broyden–Fletcher–Goldfarb–Shanno (BFGS) quasi-Newton inversion were performed, each comprising five iterations. With this BFGS update history, we determine the model’s standard deviation and resolution length through randomized singular value decomposition.

58 GEOSCIENCES↗
DOE OSTI2020

Retrieval of energy spectra for all flavours of neutrinos from core-collapse supernova with multiple detectors

ABSTRACT We present a new method by which to retrieve energy spectrum for all falvours of neutrinos from core-collapse supernova (CCSN). In the retrieval process, we do not assume any analytic formulas to express the energy spectrum of neutrinos but rather take a direct way of spectrum reconstruction from the observed data; the singular value decomposition algorithm with a newly developed adaptive energy-gridding technique is adopted. We employ three independent reaction channels having different flavour sensitivity to neutrinos. Two reaction channels, inverse beta decay on proton and elastic scattering on electrons, from a water Cherenkov detector such as Super-Kamiokande (SK) and Hyper-Kamiokande (HK), and a charged current reaction channel with Argon from the Deep Underground Neutrino Experiment (DUNE) are adopted. Given neutrino oscillation models, we iteratively search the neutrino energy spectra at the CCSN source until they provide the consistent event counts in the three reaction channels. We test the capability of our method by demonstrating the spectrum retrieval to a theoretical neutrino data computed by our recent three-dimensional CCSN simulation. Although the energy spectrum with either electron-type or electron-type antineutrinos at the CCSN source has relatively large error compared to that of other species, the joint analysis with HK + DUNE or SK + DUNE will provide precise energy spectrum of all flavours of neutrinos at the source. Finally, we discuss perspectives for improvements of our method by using neutrino data of other detectors.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Quantum state preparation and nonunitary evolution with diagonal operators

Realizing nonunitary transformations on unitary-gate-based quantum devices is critically important for simulating a variety of physical problems, including open quantum systems and subnormalized quantum states. Here, we present a dilation-based algorithm to simulate nonunitary operations using probabilistic quantum computing with only one ancilla qubit. We utilize the singular-value decomposition (SVD) to decompose any general quantum operator into a product of two unitary operators and a diagonal nonunitary operator, which we show can be implemented by a diagonal unitary operator in a one-qubit dilated space. While dilation techniques increase the number of qubits in the calculation, and thus the gate complexity, our algorithm limits the operations required in the dilated space to a diagonal unitary operator, which has known circuit decompositions. We use this algorithm to prepare random subnormalized two-level states on a quantum device with high fidelity. Furthermore, we present the accurate nonunitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude-damping channel computed on a quantum device. The algorithm presented will be most useful for implementing general nonunitary operations when the SVD can be readily computed, which is the case for most operators in the noisy intermediate-scale quantum computing era.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

New method for fitting coefficients in standard model effective theory

We present an alternative method for carrying out a principal-component analysis of Wilson coefficients in standard model effective field theory (SMEFT). The method is based on singular-value decomposition (SVD). The SVD method provides information about the sensitivity of experimental observables to physics beyond the standard model that is not accessible in the Fisher-information method. In principle, the SVD method can also have computational advantages over diagonalization of the Fisher information matrix. We demonstrate the SVD method by applying it to the dimension-6 coefficients for the process of top-quark decay to a b quark and a W boson and use this example to illustrate some pitfalls in widely used fitting procedures. We also outline an iterative procedure for applying the SVD method to dimension-8 SMEFT coefficients.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Deep learning for in situ data compression of large turbulent flow simulations

As the size of turbulent flow simulations continues to grow, in situ data compression is becoming increasingly important for visualization, analysis, and restart checkpointing. For these applications, single-pass compression techniques with low computational and communication overhead are crucial. In this paper we present a deep-learning approach to in situ compression using an autoencoder architecture that is customized for three-dimensional turbulent flows and is well suited for contemporary heterogeneous computing resources. The autoencoder is compared against a recently introduced randomized single-pass singular value decomposition (SVD) for three different canonical turbulent flows: decaying homogeneous isotropic turbulence, a Taylor-Green vortex, and turbulent channel flow. Our proposed fully convolutional autoencoder architecture compresses turbulent flow snapshots by a factor of 64 with a single pass, allows for arbitrarily sized input fields, is cheaper to compute than the randomized single-pass SVD for typical simulation sizes, performs well on unseen flow configurations, and has been made publicly available. The results reported here show that the autoencoder dramatically outperforms a randomized single-pass SVD with similar compression ratio and yields comparable performance to a higher-rank decomposition with an order of magnitude less compression in regard to preserving a number of important statistical quantities such as turbulent kinetic energy, enstrophy, and Reynolds stresses.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

First Double-Differential Cross Section Measurement of Neutral-Current 𝜋 0 Production in Neutrino-Argon Scattering in the MicroBooNE Detector

We report the first double-differential cross section measurement of neutral-current neutral pion (NC⁢𝜋 0 ) production in neutrino-argon scattering, as well as single-differential measurements of the same channel in terms of final states with and without protons. The kinematic variables of interest for these measurements are the 𝜋 0 momentum and the 𝜋 0 scattering angle with respect to the neutrino beam. A total of 4971 candidate NC⁢𝜋 0 events fully contained within the MicroBooNE detector are selected using data collected at a mean neutrino energy of ∼0.8 GeV from 6.4 ×10 20 protons on target from the Booster Neutrino Beam at the Fermi National Accelerator Laboratory. After extensive data-driven model validation to ensure unbiased unfolding, the Wiener-singular-value-decomposition method is used to extract nominal flux-averaged cross sections. The results are compared to predictions from commonly used neutrino event generators, which tend to overpredict the measured NC⁢𝜋 0 cross section, especially in the 0.2–0.5 GeV/c 𝜋 0 momentum range and at forward scattering angles. Events with at least one proton present in the final state are also underestimated. This data will help improve the modeling of NC⁢𝜋 0 production, which represents a major background in measurements of charge-parity violation in the neutrino sector and in searches for new physics beyond the standard model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Data-Driven Compression of Electron-Phonon Interactions

First-principles calculations of electron interactions in materials have seen rapid progress in recent years, with electron-phonon ( e − ph ) interactions being a prime example. However, these techniques use large matrices encoding the interactions on dense momentum grids, which reduces computational efficiency and obscures interpretability. For e − ph interactions, existing interpolation techniques leverage locality in real space, but the high dimensionality of the data remains a bottleneck to balance cost and accuracy. Here we show an efficient way to compress e − ph interactions based on singular value decomposition (SVD), a widely used matrix and image compression technique. Leveraging (un)constrained SVD methods, we accurately predict material properties related to e − ph interactions—including charge mobility, spin relaxation times, band renormalization, and superconducting critical temperature—while using only a small fraction (1%–2%) of the interaction data. These findings unveil the hidden low-dimensional nature of e − ph interactions. Furthermore, they accelerate state-of-the-art first-principles e − ph calculations by about 2 orders of magnitude without sacrificing accuracy. Our Pareto-optimal parametrization of e − ph interactions can be readily generalized to electron-electron and electron-defect interactions, as well as to other couplings, advancing quantitative studies of condensed matter. Published by the American Physical Society 2024

Physics↗
DOE OSTI2024

Learning Conservation Laws in Unknown Quantum Dynamics

We present a learning algorithm for discovering conservation laws given as sums of geometrically local observables in quantum dynamics. This includes conserved quantities that arise from local and global symmetries in closed and open quantum many-body systems. The algorithm combines the classical shadow formalism for estimating expectation values of observable and data analysis techniques based on singular value decompositions and robust polynomial interpolation to discover all such conservation laws in unknown quantum dynamics with rigorous performance guarantees. Our method can be directly realized in quantum experiments, which we illustrate with numerical simulations, using closed and open quantum system dynamics in a ℤ 2 gauge theory and in many-body localized spin chains.

Machine learning↗
DOE OSTI2025

Machine-learning-informed scattering correlation analysis of sheared colloids

We have carried out theoretical analysis, Monte Carlo simulations and machine-learning analysis to quantify microscopic rearrangements of dilute dispersions of spherical colloidal particles from coherent scattering intensity. Both monodisperse and polydisperse dispersions of colloids were created and underwent a rearrangement consisting of an affine simple shear and non-affine rearrangement using the Monte Carlo method. We calculated the coherent scattering intensity of the dispersions and the correlation function of intensity before and after the rearrangement and generated a large data set of angular correlation functions for varying system parameters, including number density, polydispersity, shear strain and non-affine rearrangement. Singular value decomposition of the data set shows the feasibility of machine-learning inversion from the correlation function for the polydispersity, shear strain and non-affine rearrangement using only three parameters. A Gaussian process regressor is then trained on the data set and can retrieve the affine shear strain, non-affine rearrangement and polydispersity with relative errors of 3%, 1% and 6%, respectively. Altogether, our model provides a framework for quantitative studies of both steady and non-steady microscopic dynamics of colloidal dispersions using coherent scattering methods.

Gaussian process regression↗
DOE OSTI2026

ResSR: A Computationally Efficient Residual Approach to Super-Resolving Multispectral Images

Multispectral imaging (MSI) plays a critical role in material classification, environmental monitoring, and remote sensing. However, MSI sensors typically have wavelength-dependent resolution, which limits downstream analysis. MSI super-resolution (MSI-SR) methods address this limitation by reconstructing all bands at a common high spatial resolution. Existing methods can achieve high reconstruction quality but often rely on spatially-coupled optimization or large learning-based models, leading to significant computational cost and limiting their use in large-scale or time-critical settings. In this paper, we introduce ResSR, a computationally efficient, model-based MSI-SR method that achieves high-quality reconstruction without supervised training or spatially-coupled optimization. Notably, ResSR decouples spectral and spatial processing into two sequential steps. ResSR first computes a spectrally-informed high-resolution estimate of the MSI using singular value decomposition together with a spatially-decoupled approximate forward model. It then applies a residual correction step to restore low-frequency spatial consistency while preserving high-frequency detail recovered by the spectral reconstruction. ResSR achieves comparable or improved reconstruction quality relative to existing MSI-SR methods while being

Sullivan, Haley [ORNL] (ORCID:0000000274069217)↗
DOE OSTI2023

AEflow (Autoencoder fluid flow compression network) [SWR-22-29]

As the size of turbulent flow simulations continues to grow, in situ data compression is becoming increasingly important for visualization, analysis, and restart checkpointing. For these applications, single-pass compression techniques with low computational and communication overhead are crucial. In this paper we present a deep-learning approach to in situ compression using an autoencoder architecture that is customized for three-dimensional turbulent flows and is well suited for contemporary heterogeneous computing resources. The autoencoder is compared against a recently introduced randomized single-pass singular value decomposition (SVD) for three different canonical turbulent flows: decaying homogeneous isotropic turbulence, a Taylor-Green vortex, and turbulent channel flow. Our proposed fully convolutional autoencoder architecture compresses turbulent flow snapshots by a factor of 64 with a single pass, allows for arbitrarily sized input fields, is cheaper to compute than the randomized single-pass SVD for typical simulation sizes, performs well on unseen flow configurations, and has been made publicly available. The results reported here show that the autoencoder dramatically outperforms a randomized single-pass SVD with similar compression ratio and yields comparable performance to a higher-rank decomposition with an order of magnitude less compression in regard to preserving a number of important statistical quantities such as turbulent kinetic energy, enstrophy, and Reynolds stresses.

King, Ryan↗
DOE OSTI2023

DT-HYDRO

The software solves the time dependent, one dimensional (1D) coupled mass and momentum balance equations governing the elastic flow of water through the penstock, turbine and draft tube in a hydroelectric facility using a high order finite volume based method. The numerical method is based on the Kurganov-Tadmor central method paired with the Monotonic Upstream-centered Scheme for Conservation Laws (MUSCL). This solution method accurately resolves the fast transient behavior of the flow, including water hammer. Additionally, the software estimates the full 3D flow field within the turbine chamber in real time, a feat that is made possible by leveraging pre-computed CFD results by utilizing a reduced order modeling method based on an efficient randomized singular value decomposition (SVD) driven proper orthogonal decomposition (POD) with POD-mode weight regression. The reduced order model of the 3D flow is directly coupled to the 1D elastic flow model so the entire flow field through the penstock and turbine system is resolved quickly and with high fidelity.

Gurecky, William [Oak Ridge National Laboratory (O↗
DOE OSTI2025

AutoDiffSVDCompression [SWR-25-162]

This software contains the code and results for the paper Reducing Memory Usage of Reverse Mode AD by Compression. In particular, the code includes implementation of the necessary structures and functions for using the Singular Value Decomposition (SVD) to compress forward pass values needed for reverse mode AD as well as the necessary numerical solvers for Burgers’ Equation and numerical solution of a control problem. In addition to the code, the repository also contains the scripts, results, and logs used in the aforementioned publication. This repository is meant to enable the reproducibility of the results in the publication.

Maack, Jonathan [National Renewable Energy Laborat↗
DOE OSTI2023

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Source noise suppression in attosecond transient absorption spectroscopy by edge-pixel referencing

Attosecond transient absorption spectroscopy (ATAS) is used to observe photoexcited dynamics with outstanding time resolution. The main experimental challenge of this technique is that high-harmonic generation sources show significant instabilities, resulting in sub-par sensitivity when compared to other techniques. This paper proposes edge-pixel referencing as a means to suppress this noise. Two approaches are introduced: the first is deterministic and uses a correlation analysis, while the second relies on singular value decomposition. Each method is demonstrated and quantified on a noisy measurement taken on WS 2 and results in a fivefold increase in sensitivity. The combination of the two methods ensures the fidelity of the procedure and can be implemented on live data collection but also on existing datasets. The results show that edge-referencing methods bring the sensitivity of ATAS near the detector noise floor. An implementation of the post-processing code is provided to the reader.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗