Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Random Matrix”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Fuel performance analysis of fully-resolved TRISO compact

The TRi-structural ISOtropic (TRISO) fuel multilayered coating structure offers multiple barriers to fission product release, enhancing safety and performance. The heterogeneous nature of TRISO fuel compacts, comprising thousands of randomly distributed coated fuel particles embedded in a graphite matrix, creates intricate stress fields and thermal gradients that cannot be accurately modeled using simplified one-dimensional or homogenized approaches. Consequently, three-dimensional modeling enables the prediction of fuel compact dimensional changes, internal pressure buildup, and fission product transport pathways under diverse irradiation and thermal conditions. This capability facilitates detailed analysis of particle-to-particle interactions, matrix cracking mechanisms, and the statistical distribution of coating failures, which directly impact fuel performance and safety margins. This capability is particularly critical for advanced reactors, such as high-temperature gas-cooled reactors and other Generation IV reactor designs where TRISO fuel operates at elevated temperatures and burn-up levels. This work introduces a novel method to generate an optimized packing of TRISO compacts and a complete 3D mesh with random distribution of TRISO particles, which are discretized into each coating component layer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2025

The polarized-signal density matrix: A practical way to recover molecular frame information from isotropic samples

We present a novel approach to model ultrafast time-dependent nonlinear optical polarization sensitive signals emitted from randomly oriented molecules. By projecting the laboratory-frame analyzer polarization axis into the molecular-frame and linking that axis with the density matrix through a tensor product, we demonstrate an approach to find a specific molecular orientation that yields a good approximation to simulated four-wave mixing signals produced by the same model but with averaging over molecular orientation.

Thurston, Richard L↗
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 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 OSTI2026

Efficient many-jet event generation with flow matching

We apply for the first time, to the best of our knowledge, the flow matching method to the problem of phase-space sampling for event generation in high-energy collider physics. By training the model to remap the random numbers used to generate the momenta and helicities of the scattering matrix elements as implemented in the portable partonic event generator pepper, we find substantial efficiency improvements in the studied processes. We focus our study on the highest final-state multiplicities in Drell-Yan and top-antitop pair production used in simulated samples for the Large Hadron Collider, which computationally are the most relevant ones. We find that the unweighting efficiencies improve by factors of 184 and 25, respectively, when compared to the standard approach of using a vegas-based optimization. We also compare continuous normalizing flows trained with flow matching against the previously studied normalizing flows based on coupling layers and find that the former leads to better results, faster training and a better scaling behavior across the studied multiplicity range, while the latter evaluate faster. When combining the advantages of both methods using the regflow approach, we find parton-level unweighted event generation walltime gains of about a factor of 10 at the highest final-state multiplicities.

Bothmann, E. [CERN; Gottingen U.] (ORCID:000000016↗
DOE OSTI2026

Quantitative 14 N NMR with Monte Carlo Uncertainty Analysis of Nitrate/Nitrite in Alkaline Nuclear Waste

While monitoring of nitrate and nitrite concentrations is important for managing corrosion in nuclear waste systems, existing analytical methods are hindered by turbidity, spectral interference, and delays from sample handling. Here, we demonstrate quantitative 14 N nuclear magnetic resonance (qNMR) spectroscopy as a direct, matrix-tolerant approach for nitrate and nitrite detection at natural abundance. Monte Carlo resampling was integrated into the workflow to quantify random error, establish precision–time tradeoffs, and separate noise-limited uncertainty from systematic bias arising from shimming, transmitter offset, or excitation pulse conditions. Quantification of nitrate and nitrite were validated in controlled alkaline matrix challenges and in 18-component Hanford-type simulants. These results establish 14 N qNMR as a practical, uncertainty-bounded tool for monitoring redox-active nitrogen species in chemically complex environments and provide a generalizable framework for quantitative analysis of quadrupolar nuclei.

Graham, Trent R. [Pacific Northwest National Labor↗
DOE OSTI2026

Spectral Properties and Coding Transitions of Haar-Random Quantum Codes

A quantum error-correcting code with a nonzero error threshold undergoes a mixed-state phase transition when the error rate reaches that threshold. We explore this phase transition for Haar-random quantum codes, in which the logical information is encoded in a random subspace of the physical Hilbert space. We focus on the spectrum of the encoded system density matrix as a function of the rate of uncorrelated, single-qudit errors. For low error rates, this spectrum consists of well-separated bands, representing errors of different weights. As the error rate increases, the bands for high-weight errors merge. The evolution of these bands with increasing error rate is well described by a simple analytic ansatz. Using this ansatz, as well as an explicit calculation, we show that the threshold for Haar-random quantum codes saturates the hashing bound, and thus coincides with that for random stabilizer codes. For error rates that exceed the hashing bound, typical errors are uncorrectable, but postselected error correction remains possible until a much higher detection threshold. Postselection can in principle be implemented by projecting onto subspaces corresponding to low-weight errors, which remain correctable past the hashing bound.

decoherence↗
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

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 OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2026

3D TRISO particle-explicit compact meshing

The TRI-structural ISOtropic (TRISO) layered fuel particle is a robust nuclear fuel form offering enhanced safety and performance for advanced reactor concepts, including high-temperature gas-cooled reactors and other Generation IV designs. These poppy-seed-sized particles are embedded in a graphite matrix to form fuel elements that must withstand elevated temperatures and high burn-up levels. The heterogeneous nature of these fuel elements — comprising thousands of randomly distributed TRISO particles — produces complex stress fields and thermal gradients that one- and two-dimensional models cannot accurately capture. While three-dimensional modeling has improved predictions of dimensional changes, internal pressure buildup, and fission product transport under irradiation, current approaches rely on homogenized material properties that are known to have considerable divergence from experimental observations. This work presents a methodology for optimized random packing of TRISO fuel compacts and full three-dimensional mesh generation within the BISON fuel performance code, with each particle coating layer individually discretized. The resulting mesh was demonstrated through heat conduction simulations under representative in-reactor operating conditions, showing strong agreement with expected behavior. This capability enables detailed analysis of particle-to-particle interactions, matrix cracking mechanisms, and the statistical distribution of coating layer failures — all of which directly govern fuel performance and safety margins.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2026

Living on the edge: a non-perturbative resolution to the negativity of bulk entropies

Lin, Maldacena, Rozenberg, and Shan (LMRS) presented a new information paradox in black hole physics by noticing that the entanglement and Rényi entropies in a two-sided black hole can become negative when the geometry contains a very large number of matter excitations behind the black hole horizon. While originally this puzzle was presented in the context of BPS two-sided black holes in two-dimensional supergravity, the negativity in fact persists for more general two-sided black holes in the presence of a large number of matter excitations. Since the entanglement and Rényi entropies in ordinary quantum systems cannot be negative, resolving this puzzle is a necessary step towards understanding the quantum mechanical description of black holes. In this paper, we explain how to address the entanglement negativity puzzle, both in the original setting discussed by LMRS and in more general non-supersymmetric settings, by summing over all non-perturbative contributions to the gravitational path integral. We then interpret this result from the point of view of a dual matrix integral, which we use to extend our analysis beyond the regime of validity of the genus re-summation performed in the gravitational path integral. In this regime, positivity is rescued by new saddles of the matrix integral, a one-eigenvalue instanton and a two-eigenvalue instanton. Finally, we formulate a similar puzzle and its resolution using random tensor network techniques.

2D Gravity↗
DOE OSTI2025

Window convolution of the galaxy clustering bispectrum

In galaxy survey analysis, the observed clustering statistics do not directly match theoretical predictions but rather have been processed by a window function that arises from the survey geometry including the sky footprint, redshift-dependent background number density and systematic weights. While window convolution of the power spectrum is well studied, for the bispectrum with a larger number of degrees of freedom, it poses a significant numerical and computational challenge. In this work, we consider the effect of the survey window in the tripolar spherical harmonic decomposition of the bispectrum and lay down a formal procedure for their convolution via a series expansion of configuration-space three-point correlation functions, which was first proposed by Sugiyama et al. (2019). We then provide a linear algebra formulation of the full window convolution, where an unwindowed bispectrum model vector can be directly premultiplied by a window matrix specific to each survey geometry. To validate the pipeline, we focus on the Dark Energy Spectroscopic Instrument (DESI) Data Release 1 (DR1) luminous red galaxy (LRG) sample in the South Galactic Cap (SGC) in the redshift bin 0.4 ≤ z ≤ 0.6. We first perform convergence checks on the measurement of the window function from discrete random catalogues, and then investigate the convergence of the window convolution series expansion truncated at a finite of number of terms as well as the performance of the window matrix. This work highlights the differences in window convolution between the power spectrum and bispectrum, and provides a streamlined pipeline for the latter for current surveys such as DESI and the Euclid mission.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Machine Learning–Augmented Laser-Induced Breakdown Spectroscopy for Spectral Discrimination of Iron Oxalates

Enhanced characterization and phase identification of post-PUREX Pu Oxalates (PuOXA) are pivotal for nonproliferation and pre-detonation nuclear forensics. Despite significant advances in the characterization of PuO 2 samples, little is known about the impact of both the chemical structure and oxidation states of PuOXA (i.e., Pu(III) and Pu(IV)) have on optical emission signatures. Here, we demonstrate the analytical capabilities of laser-induced breakdown spectroscopy (LIBS) applied to Fe(II) and Fe(III) oxalate samples as surrogates for PuOXA, highlighting the discriminating features in the LIBS emission spectra arising from differences in the oxidation states within mixed FeOXA samples. We report the enhancement of spectral feature selection using Principal Component Analysis (PCA), which enables the analytical superiority of machine learning algorithms such as Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Partial Least Squares Regression (PLSR), Support Vector Regression (SVR), and Random Forest Regression (RFR) over conventional univariate techniques for phase discrimination and chemometric analysis. Cluster analysis revealed how both matrix effects and laser ablation influence cluster separability by introducing spectral artifacts that misdirect the maximization of variance. PCA-selected emission lines were used in the regression models, demonstrating that both univariate and multivariate linear regression models (i.e., PLSR and SVR) can achieve acceptable performance, with machine learning models outperforming conventional calibration regressions. Furthermore, the application of non-linearly activated PCA-selected emission lines illustrates how simplifying the data while retaining captured variance enables the use of less complex and more computationally efficient models. Furthermore, this is particularly evident in the underperformance of RFR, which suffers from increased computational costs and overfitting owing to its high complexity.

Oxalates↗
DOE OSTI2026

Advanced measurement techniques in quantum Monte Carlo: The permutation matrix representation approach

In a typical finite temperature quantum Monte Carlo (QMC) simulation, estimators for simple static observables such as specific heat and magnetization are known. With a great deal of system-specific manual labor, one can sometimes also derive more complicated non-local or even dynamic observable estimators. In contrast, we show that arbitrary static observables can be estimated within the permutation matrix representation (PMR) flavor for any Hamiltonian. We then generalize these results to general imaginary-time correlation functions and non-trivial integrated susceptibilities thereof. Finally, we demonstrate the practical versatility of our method by estimating various non-local, random observables for the transverse-field Ising model on a square lattice and a toy random model.

Permutation matrix representation↗