Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random matrices”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Two transitions in complex eigenvalue statistics: Hermiticity and integrability breaking

Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics, when chaotic, or two-dimensional (2d) Poisson statistics, when integrable. We investigate the spectral properties of a many-body quantum spin chain, i.e., the Hermitian Heisenberg model with imaginary disorder. Its rich complex eigenvalue statistics is found to separately break both Hermiticity and integrability at different scales of the disorder strength. With no disorder, the system is integrable and Hermitian, with spectral statistics corresponding to the 1d Poisson point process. At very small disorder, we find a transition from 1d Poisson statistics to an effective D -dimensional Poisson point process, showing Hermiticity breaking. At intermediate disorder, we find integrability breaking, as inferred from the statistics matching that of non-Hermitian complex symmetric random matrices in class AI † . For large disorder, as the spins align, we recover the expected integrability (now in the non-Hermitian setup), indicated by 2d Poisson statistics. These conclusions are based on fitting the spin-chain data of numerically generated nearest- and next-to-nearest-neighbor spacing distributions to an effective 2d Coulomb gas description at inverse temperature β . We confirm that such an effective description of random matrices also applies in classes AI † and AII † up to next-to-nearest-neighbor spacings. Published by the American Physical Society 2025

Akemann, Gernot (ORCID:0000000217104258)↗
DOE OSTI2025

A Class of Sparse Johnson–Lindenstrauss Transforms and Analysis of their Extreme Singular Values

The Johnson–Lindenstrauss (JL) lemma is a powerful tool for dimensionality reduction in modern algorithm design. The lemma states that any set of high-dimensional points in a Euclidean space can be projected into lower dimensions while approximately preserving pairwise Euclidean distances. Random matrices satisfying this lemma are called JL transforms (JLTs). Inspired by existing $s$-hashing JLTs with exactly $s$ nonzero elements on each column, the present work introduces an ensemble of sparse matrices encompassing so-called $s$-hashing-like matrices whose expected number of nonzero elements on each column is $s$. The independence of the sub-Gaussian entries of these matrices and the knowledge of their exact distribution play an important role in their analyses. Using properties of independent sub-Gaussian random variables, these matrices are demonstrated to be JLTs, and their smallest nontrivial singular values and largest singular values are estimated nonasymptotically using a technique from geometric functional analysis. As the dimensions of the matrix grow to infinity, these singular values are proved to converge almost surely to fixed quantities (by using the universal Bai–Yin law) and in distribution to the Gaussian orthogonal ensemble Tracy–Widom law after proper rescalings. Understanding the behaviors of extreme singular values is important in general because they are often used to define a measure of stability of matrix algorithms. For example, JLTs were recently used in derivative-free optimization algorithmic frameworks to select random subspaces in which are constructed random models or poll directions to achieve scalability, and hence estimating their smallest singular value in particular helps determine the dimension of these subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient Unitary Designs from Random Sums and Permutations

A unitary k-design is an ensemble of unitaries that matches the first k moments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(k poly (n)) many gates. The k dependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-N expansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimension N.

algebra↗
DOE OSTI2026

Stochastic mean-field theory and applications to multinucleon transfer and kinetic energy dissipation processes in heavy-ion collisions

In this Review article, a brief description of the stochastic mean-field (SMF) theory for describing reaction dynamics in low-energy heavy-ion collisions at bombarding energies in the vicinity of the Coulomb barrier is presented. In these collisions, as a result of strong Pauli blocking, binary nucleon collisions do not have a significant effect on the dissipation and fluctuations. At low energies, the mean-field fluctuations, due to initial correlations, have a dominant effect on fluctuations of macroscopic variables. The SMF theory proposes the determination of an ensemble of single-particle density matrices by specifying random initial fluctuations according to a distribution law. Employing an ensemble of single-particle density matrices, not only the mean values but also the distribution functions of the one-body observables can be determined. If the di-nuclear structure is maintained in heavy-ion collisions, such as deep inelastic collisions and fast quasi-fission reactions, a much simpler description of the reaction mechanism can be derived in terms of several macroscopic variables such as mass and charge asymmetry, and relative linear and relative angular momentum. In this case, by geometric projection of the SMF equations, it is possible to derive the quantal Langevin equations for macroscopic variables. As an application of quantal transport description, an analysis of multinucleon transfers and kinetic energy dissipation and fluctuations is presented for selected quasi-fission reactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Accurate models of the added mass force of a uniform random distribution of spherical particles or bubbles

The added mass force resulting from the acceleration of a body in a fluid is of fundamental and practical interest in dispersed multiphase flows. Euler–Lagrange (EL) and Euler–Euler (EE) simulations require closure terms for the added mass force in order to accurately couple the conserved variables between phases. Presently, a more thorough understanding of the added mass force in a multi-particle system is developed based on potential flow resulting in a resistance matrix formulation analogous to Stokesian dynamics. This formulation is then used to generate a dataset of added mass resistance matrices for large systems of randomly generated particles. This methodology is used to create a volume fraction corrected binary model for predicting the added mass force in large systems as well as generate statistics of the added mass force in such systems. This work provides clarification to the theory of the added mass force for particle clouds, and modelling options that may be implemented in existing EL and EE codes.

42 ENGINEERING↗
DOE OSTI2025

Grain Boundary Segregation Suppresses Local Short‐Range Ordering in Nanocrystalline High‐Entropy Alloys

Multi-principal-element alloys like high-entropy alloys (HEAs) have potential applications in many engineering fields due to their unique mechanical/functional properties. While HEAs are generally considered random solid solutions, recent studies revealed that they are prone to short-range-ordering (SRO) due to the complex multi-pair-wise interactions among the constituent elements. Meanwhile, SROs' evolution can sometimes be deleterious, and it is necessary to have control over their evolution. Examining the AlCoCrFe-Zr model alloy, long-range ordering occurs following the expectation of enthalpic predictions. Advanced characterization techniques—transmission electron microscopy, high-energy synchrotron X-ray diffraction/pair distribution function, and atom probe tomography, reveal that SRO is suppressed in as-milled and GB-decorated NC-(AlCoCrFe)100-xZrx (x = 0–1.5 atomic %). Warren-Cowley coefficient calculations are further used to validate the suppression of SRO. Besides the low segregation enthalpies of Cr, Fe, and Zr, and the high-mixing enthalpy of Cr and Fe, the short diffusion path to GBs due to high-GB density in the NC-HEAs and the higher energy state of the GBs than the matrix promotes GB-segregation that further alters the matrix chemistry and consequently disfavors SRO formation within the matrix. Despite the GB-segregation of Cr, Fe, and Zr, the matrices and GBs remain in a random solid solution.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Randomized Algorithms for Low-Rank Matrix and Tensor Decompositions

This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality reduction, such as the singular value decomposition (SVD) or interpolative (ID) and CUR decompositions. Recent advances in randomized dimensionality reduction are discussed, including new methods of fast matrix sketching and sampling techniques, which are incorporated into classical matrix algorithms for fast low-rank matrix approximations. The extension of randomized matrix algorithms to tensors is then explored for several low-rank tensor decompositions in the CP and Tucker formats, including the higher-order SVD, ID, and CUR decomposition.

Pearce, Katherine J. [The University of Texas at A↗
DOE OSTI2024

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↗
DOE OSTI2026

Data Driven Correlated Noise Simulation for the ICEBERG LArTPC

Accurate electronic-noise simulation is essential for low-energy physics in liquid-argon TPCs. More realistic noise modeling allows us to better tune reconstruction algorithms and more reliably assess and optimize signal-detection thresholds. We present a data-driven noise simulation framework developed for the ICEBERG test stand for DUNE that generates synthetic noise waveforms that reproduce both (i) the measured per-channel magnitude of the Fast Fourier Transform (FFT) and (ii) frequency-dependent channel-to-channel correlations observed in ICEBERG noise data. Using a dedicated noise-only dataset, we build a compact noise model containing per-channel FFT-magnitude targets together with a small set of band-wise cross-wire color matrices. White noise is generated in the frequency domain by drawing circular-symmetric complex Gaussian coefficients with random phases and scaling them to match the measured FFT-magnitude targets, and cross-wire correlations are subsequently imposed using the stored color matrices. The model and algorithm were integrated into the LArSoft + Wire-Cell Toolkit simulation chain and validated by comparing waveform structure, frequency-domain spectra, and band-limited correlation matrices from simulated noise and ICEBERG data. This approach can be extended to other LArTPC operating conditions.

Ghosh, Avik [Iowa State U.]↗
DOE OSTI2026

The Maximal Entanglement Limit in Statistical and High-energy Physics

These lectures advocate the idea that quantum entanglement provides a unifying foundation for both statistical physics and high-energy interactions. I argue that, at sufficiently long times or high energies, most quantum systems approach a Maximal Entanglement Limit (MEL) in which phases of quantum states become unobservable, reduced density matrices acquire a thermal form, and probabilistic descriptions emerge without invoking ergodicity or classical randomness. Within this framework, the emergence of probabilistic parton model, thermalization in the break-up of confining strings and in high-energy collisions, and the universal small-x behavior of structure functions arise as direct consequences of entanglement and geometry of high-dimensional Hilbert space.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Implementation of stacked ensemble machine learning for the detection of surrogate plutonium contamination in soil via LIBS

Supervised machine learning methods have demonstrated increased utility for the quantification of lanthanide and actinide elements in atomic spectroscopy applications. This study implements laser-induced breakdown spectroscopy (LIBS) for the identification of plutonium surrogate material (CeO 2 ) in soil matrices by training supervised machine learning methods on the recorded spectral data. A bagged ensemble using Random Forest yields the highest sensitivity predictions with a detection limit of 0.015 wt.% CeO 2 . However, high precision in Ce content prediction required the use of a stacked ensemble regression, which provided the superlative Ce quantification model with an error of 0.107% and a detection limit of 0.022 wt.%. Furthermore, the high performance of the stacked ensemble demonstrates its potential to enhance the accuracy and sensitivity of nuclear contaminant detection using field-deployable spectroscopic analyzers in real-world scenarios.

47 OTHER INSTRUMENTATION↗
DOE OSTI2026

Pareto-optimal target definition for multi-axis random vibration testing

In random vibration testing with multiple control channels, existing control laws require specification of a complete spectral density matrix at each control frequency. Spectral density matrices include autospectral densities on the diagonal and cross-spectral densities on the off-diagonal. In practice, the off-diagonal terms are often unknown, and recent vibration testing research has focused on fixing the diagonal and specifying the off-diagonal to minimize the required control energy, subject to a constraint that the target matrix is positive semidefinite. This paper shows that, even with a fixed diagonal, off-diagonal terms strongly affect control residuals. This overlooked effect occurs in both square and rectangular systems. By jointly considering input energy and control residuals, open-loop inputs are derived directly from the diagonal without specifying the off-diagonal terms. Vibration targets that can be used in closed-loop control are then derived using the optimal inputs, with positive semidefinite constraints applied during the derivation. The result is a set of Pareto-optimal control solutions. For each solution in the set, any other possible solution produces greater control error, greater input energy, or both. A balanced solution is selected automatically, though others can be chosen based on test needs. Simulations and experiments show that the proposed method outperforms state-of-the-art energy-minimizing approaches, achieving significant reductions in both control error and input energy.

Autospectral density↗
DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Randomized algorithms for accelerating linear algebraic computations

The project supported the development of new methodologies for performing matrix computations that form key building blocks in modern scientific computing, such as low rank approximation of matrices, and efficient representations of global operators that arise in simulations of physical phenomena.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Get Non-Real: Randomized Sketching for High-Dimensional Non-Real Valued Data (Final Report)

In our final report for DE-C0022186, we describe the work we did on this grant towards the goals we proposed. Our first goal was characterizing fundamental limits for sketching of discrete high-dimensional matrices with low-dimensional structures. Our second main goal was designing algorithms for data reconstruction from sketches. We focus on approaches that are either specifically designed for non-real-valued data (binary, finite field) or that will translate more readily to that setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Mapping Rare Earths and Toxics in E-Waste via Hyperspectral Imaging and Machine Learning

Electronic waste (e-waste) presents a mounting challenge to environmental sustainability due to its complex composition, which includes high-value rare earth elements, hazardous organic compounds, and non-recyclable plastics. Accurate and scalable material classification is essential for enabling efficient resource recovery and safe recycling practices. This study introduces a confidence-aware classification pipeline that combines mid-infrared hyperspectral imaging (HSI), spectral angle mapping (SAM), and iterative machine learning to perform pixel-level material identification across e-waste devices. A curated spectral library encompassing artificial materials (e.g., plastic iron oxide, galvanized metals), minerals (e.g., allanite, hematite), and organic compounds (e.g., benzanthracene, toluene) was used to generate pseudo-labels, each assigned a confidence score based on SAM-derived spectral similarity. High-confidence samples from seven consumer electronics—digital cameras, keyboards, laptop fans, modems, motherboards, TV remotes, and speakers—were iteratively expanded and classified using models such as Support Vector Machine (SVM), Random Forest, Gradient Boosting Classifier, Partial Least Squares Discriminant Analysis (PLSDA) and Logistic Regression. The best-performing classifiers achieved macro F1 scores approaching 1.0. Results revealed widespread plastic content (dominated by plastic iron oxide), the presence of rare earth-bearing minerals like cerium-containing allanite, and pervasive detection of hazardous organics such as benzanthracene. Principal Component Analysis (PCA) visualizations and confusion matrices confirmed high separability and robust classification performance. This methodology enables precise, non-destructive, and scalable classification of heterogeneous e-waste streams. It supports automated, hazard-aware sorting in recycling workflows, facilitating selective recovery of critical materials and compliance with circular economy goals. The confidence-aware framework provides a foundation for real-time deployment in industrial settings, offering significant implications for smart e-recycling infrastructure and policy-driven material stewardship.

Circular economy↗