Engineering PapersSearch

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 37 records · Page 2

Probability Bounds Analysis Applied to Multi-Purpose Crew Vehicle Nonlinearity

The Multi-Purpose Crew Vehicle (MPCV) Program Orion vehicle finite element model (FEM) was updated based on a modal test performed by Lockheed Martin. Due to nonlinearity observed in the test results, linear low force level (LL) and high force level (HL) FEMs were developed for use during various Space Launch System (SLS) flight regimes depending on expected forcing levels. Uncertainty models were derived for the combined MPCV and MPCV Stage Adaptor LL and HL Hurty/Craig-Bampton (HCB) components based on the MPCV structural test article Configuration 4 modal test-analysis correlation results. Subsequently, system-level uncertainty quantification analyses were performed using both models for various SLS flight configurations to determine the impact of the nonlinearity on important system metrics. The system metrics included both transfer functions associated with attitude control and dynamic loads associated with aerodynamic buffeting during ascent. In each case, an independent Monte Carlo (MC) analysis was performed, and no attempt was made to combine the results. The Hybrid Parametric Variation (HPV) method was used to develop the LL and HL MPCV HCB uncertainty models. The HPV method provides both parametric and non-parametric components of uncertainty. The non-parametric uncertainty accounts for the difference in model-form between the linearized analytical model and the corresponding linearized component test results in the form of mode shapes and frequencies at that force level. This linear model-form uncertainty is implemented in the HPV method using random matrix theory. However, the HPV uncertainty models developed for the linear LL and HL MPCV components do not account for the nonlinearity in the MPCV. With respect to the linearized models, this nonlinearity is also an uncertainty in model form, but in this case, it must be treated independently as an epistemic uncertainty. It represents a lack of knowledge, in contrast to an aleatory uncertainty due to the randomness of a variable. In the case of an epistemic variable, the true value is unknown, only the interval within which it lies is known. Epistemic uncertainty can be reduced with increased knowledge, while in general, aleatory uncertainty cannot. This work combines the epistemic uncertainty due to the MPCV nonlinearity with the parametric and non-parametric uncertainty within the HPV method using a second order propagation approach. The LL and HL test data is augmented with surrogate test data derived from a nonlinear MPCV representation. The impact of the MPCV nonlinearity on system response statistics is determined using a series of cumulative distribution functions in the form of a horsetail plot, or p-box. This results in an interval of probabilities for a specific response value, or an interval of response values at a specific probability.

Daniel C Kammer

BPS chaos

Black holes are chaotic quantum systems that are expected to exhibit random matrix statistics in their finite energy spectrum. Lin, Maldacena, Rozenberg and Shan (LMRS) have proposed a related characterization of chaos for the ground states of BPS black holes with finite area horizons. On a separate front, the “fuzzball program” has uncovered large families of horizon-free geometries that account for the entropy of holographic BPS systems, but only in situations with sufficient supersymmetry to exclude finite area horizons. The highly structured, non-random nature of these solutions seems in tension with strong chaos. We verify this intuition by performing analytic and numerical calculations of the LMRS diagnostic in the corresponding boundary quantum system. In particular we examine the 1/2 and 1/4-BPS sectors of \mathcal{N}=4 𝒩 = 4 SYM, and the two charge sector of the D1-D5 CFT. We find evidence that these systems are only weakly chaotic, with a Thouless time determining the onset of chaos that grows as a power of N N . In contrast, finite horizon area BPS black holes should be strongly chaotic, with a Thouless time of order one. In this case, finite energy chaotic states become BPS as N N is decreased through the recently discovered “fortuity” mechanism. Hence they can plausibly retain their strongly chaotic character.

Chen, Yiming (ORCID:0000000218613230)

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)

Augmenting subspace optimization methods with linear bandits

In this work, we consider the framework of methods for unconstrained minimization that are, in each iteration, restricted to a model that is only a valid approximation to the objective function on some affine subspace containing an incumbent point. These methods are of practical interest in computational settings where derivative information is either expensive or impossible to obtain. Recent attention has been paid in the literature to employing randomized matrix sketching for generating the affine subspaces within this framework. We consider a relatively straightforward, deterministic augmentation of such a generic subspace optimization method. In particular, we consider a sequential optimization framework where actions consist of one-dimensional linear subspaces and rewards consist of (approximations to) the magnitudes of directional derivatives computed in the direction of the action subspace. Reward maximization in this context is consistent with maximizing lower bounds on descent guaranteed by first-order Taylor models. This sequential optimization problem can be analysed through the lens of dynamic regret. We modify an existing linear upper confidence bound (UCB) bandit method and prove sublinear dynamic regret in the subspace optimization setting. We demonstrate the efficacy of employing this linear UCB method in a setting where forward-mode algorithmic differentiation can provide directional derivatives in arbitrary directions and in a derivative-free setting. For the derivative-free setting, we propose SS-POUNDers, an extension of the derivative-free optimization method POUNDers that employs the linear UCB mechanism to identify promising subspaces. Our numerical experiments suggest a preference, in either computational setting, for employing a linear UCB mechanism within a subspace optimization method.

97 MATHEMATICS AND COMPUTING

Double copy root of Hawking thermality

The Hawking radiation spectrum from a collapsing null shell can be derived via the double copy of a simpler gauge theory calculation. Analyzing the non-abelian Yang-Mills root of this process, we demonstrate that the radiation spectrum is thermal in the color charge eigenvalue 𝜆, not energy. Considering the 𝑆⁢𝑈⁡(𝑁 𝑐 ) gauge theory in the large 𝑁 𝑐 limit, we find the differential spectrum ⅆ⁢𝑁/ⅆ⁢𝜆 is a product of the gravitationally familiar Planck-like factor and the color phase space density, modeled here as the Wigner semicircle from random matrix theory. This reveals that apparent energy thermality in gravity is the direct dual of charge thermality in its underlying non-abelian gauge theory.

Carrasco, John Joseph M. [Northwestern University,

Krylov complexity in mixed phase space

We investigate the Krylov complexity of thermofield double states in systems with mixed phase space, uncovering a direct correlation with the Brody distribution, which interpolates between Poisson and Wigner statistics. Our analysis spans two-dimensional random matrix models featuring (I) GOE-Poisson and (II) GUE-Poisson transitions and extends to higher-dimensional cases, including a stringy matrix model (GOE-Poisson) and the mass-deformed SYK model (GUE-Poisson). Krylov complexity consistently emerges as a reliable marker of quantum chaos, displaying a characteristic peak in the chaotic regime that gradually diminishes as the Brody parameter approaches zero, signaling a shift toward integrability. These results establish Krylov complexity as a powerful diagnostic of quantum chaos and highlight its interplay with eigenvalue statistics in mixed phase systems.

chaos & nonlinear dynamics

Supersymmetric Virasoro minimal strings

A random matrix model definition of a family of N = 1 supersymmetric extensions of the Virasoro minimal string of Collier, Eberhardt, Mühlmann, and Rodriguez is presented. An analysis of the defining string equations shows that the models all naturally have unambiguous nonperturbative completions, which are explicitly supplied by the double-scaled orthogonal polynomial techniques employed. Perturbatively, the multiloop correlation functions of the model define a special supersymmetric class of “quantum volumes,” generalizing the prototype case, some of which are computed. Published by the American Physical Society 2024

Astronomy & Astrophysics

Fluctuations in Hill’s equation parameters and application to cosmic reheating

Cosmic inflation provides a compelling framework for explaining several observed features of our Universe, but its viability depends on an efficient reheating phase that converts the inflaton’s energy into Standard Model particles. This conversion often proceeds through nonperturbative mechanisms such as parametric resonance, which is described by Hill’s equation. In this work, we investigate how stochastic fluctuations in the parameters of Hill’s equation can influence particle production during reheating. We show that such fluctuations can arise from couplings to light scalar fields and can significantly alter the stability bands in the resonance structure, thereby enhancing the growth of fluctuations and broadening the region of efficient energy transfer. Using random matrix theory and stochastic differential equations, we decompose the particle growth rate into deterministic and noise-induced components and demonstrate analytically and numerically that even modest noise leads to substantial particle production in otherwise stable regimes. Furthermore, these results suggest that stochastic effects can robustly enhance the efficacy of reheating across a wide swath of parameter space, with implications for early Universe cosmology, UV completions involving multiple scalar fields, and the resolution of the cosmological moduli problem.

Cosmology

Spectral anomalies and broken symmetries in maximally chaotic quantum maps

Spectral statistics such as the level spacing statistics and spectral form factor (SFF) are widely expected to accurately identify “ergodicity,” including the presence of underlying macroscopic symmetries, in generic quantum systems ranging from quantized chaotic maps to interacting many-body systems. By studying various quantizations of maximally chaotic maps that break a discrete classical symmetry upon quantization, we demonstrate that this approach can be misleading and fail to detect macroscopic symmetries. Notably, the same classical map can exhibit signatures of different random matrix symmetry classes in short-range spectral statistics depending on the quantization. While the long-range spectral statistics encoded in the early time ramp of the SFF are more robust and correctly identify macroscopic symmetries in several common quantizations, we also demonstrate analytically and numerically that the presence of Berry-like phases in the quantization leads to spectral anomalies, which break this correspondence. Finally, we provide numerical evidence that long-range spectral rigidity remains directly correlated with ergodicity in the quantum dynamical sense of visiting a complete orthonormal basis.

Shou, Laura [Univ. of Maryland, College Park, MD (

A Black Hole Airy Tail

In Jackiw-Teitelboim (JT) gravity, which is dual to a random matrix ensemble, the annealed entropy differs from the quenched entropy at low temperatures and goes negative. However, computing the quenched entropy in JT gravity requires a replica limit that is poorly understood. To circumvent this, we define an intermediate quantity called the semi-quenched entropy, which has the positivity properties of the quenched entropy, while requiring a much simpler replica trick. We compute this in JT gravity in different regimes using i) a bulk calculation involving wormholes corresponding to the Airy limit of the dual matrix integral and ii) a boundary calculation involving one-eigenvalue instanton saddles proposed by Hernández-Cuenca, demonstrating consistency between these two calculations in their common regime of validity. We also clarify why similar one-eigenvalue instanton saddles cannot be used to compute the quenched entropy due to a breakdown of the saddle-point approximation for the one-eigenvalue instanton in the replica limit. Our results show how to use the gravitational path integral to prove that black holes in JT gravity have isolated ground states and to study their properties.

FOS: Physical sciences

Mind the crosscap: $τ$-scaling in non-orientable gravity and time-reversal-invariant systems

Spectral statistics of quantum chaotic systems are governed by random matrix universality. In many cases of interest, time-reversal symmetry selects the Gaussian Orthogonal Ensemble (GOE) as the relevant universality class. In holographic CFTs, this is mirrored by the presence of non-orientable geometries in the dual gravitational path integral. In this work, we analyze general properties of these matrix models and their gravitational counterparts. First, we develop a formalism to express the universal level statistics in the canonical ensemble for arbitrary spectral curves, leading to a topological expansion with finite radius of convergence in the late-time $τ$-scaling limit. Then, we focus on topological gravity and study topological recursion on the moduli space of non-orientable surfaces. We find that the Weil-Petersson volumes display non-analytic behaviour multiplying polynomials in the boundary lengths. The volumes give rise to wormholes with late-time divergences, in contrast with the orientable case, which is finite. We identify systematic cancellations among WP volumes implied by the consistency and finiteness of the $τ$-scaling limit. In particular, the cancellation of late-time divergences requires a nontrivial genus resummation. Working in the gravitational microcanonical ensemble, we derive and resum all orders of the topological expansion matching the GOE matrix model in the high-energy regime.

Chaotic Dynamics (nlin.CD)

Shape Estimation for Elongated Deformable Object using B-spline Chained Multiple Random Matrices Model

In this paper, a B-spline chained multiple random matrix models (RMMs) representation is proposed to model geometric characteristics of an elongated deformable object. The hyper degrees of freedom structure of the elongated deformable object make its shape estimation challenging. Based on the likelihood function of the proposed B-spline chained multiple RMMs, an expectation-maximization (EM) method is derived to estimate the shape of the elongated deformable object. A split and merge method based on the Euclidean minimum spanning tree (EMST) is proposed to provide initialization for the EM algorithm. The proposed algorithm is evaluated for the shape estimation of the elongated deformable objects in scenarios, such as the static rope with various configurations (including configurations with intersection), the continuous manipulation of a rope and a plastic tube, and the assembly of two plastic tubes. The execution time is computed and the accuracy of the shape estimation results is evaluated based on the comparisons between the estimated width values and its ground-truth, and the intersection over union (IoU) metric.

Gang Yao

Quantifying Effects of Voids in Woven Ceramic Matrix Composites

Randomness in woven ceramic matrix composite architecture has been found to cause large variability in stiffness and strength. The inherent voids are an aspect of the architecture that may cause a significant portion of the variability. A study is undertaken to investigate the effects of many voids of random sizes and distributions. Response surface approximations were formulated based on void parameters such as area and length fractions to provide an estimate of the effective stiffness. Obtaining quantitative relationships between the properties of the voids and their effects on stiffness of ceramic matrix composites are of ultimate interest, but the exploratory study presented here starts by first modeling the effects of voids on an isotropic material. Several cases with varying void parameters were modeled which resulted in a large amount of variability of the transverse stiffness and out-of-plane shear stiffness. An investigation into a physical explanation for the stiffness degradation led to the observation that the voids need to be treated as an entity that reduces load bearing capabilities in a space larger than what the void directly occupies through a corrected length fraction or area fraction. This provides explanation as to why void volume fraction is not the only important factor to consider when computing loss of stiffness.

Goldsmith, Marlana B.

Random access-random release relay switching matrix

XY relay switching matrix provides complete random access and random release of 400 points. A mercury-wetted bistable relay with independent set and reset coils is the unique feature associated with each point.

Carter, J. A.

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING

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

Strategies for vectorizing the sparse matrix vector product on the CRAY XMP, CRAY 2, and CYBER 205

Large, randomly sparse matrix vector products are important in a number of applications in computational chemistry, such as matrix diagonalization and the solution of simultaneous equations. Vectorization of this process is considered for the CRAY XMP, CRAY 2, and CYBER 205, using a matrix of dimension of 20,000 with from 1 percent to 6 percent nonzeros. Efficient scatter/gather capabilities add coding flexibility and yield significant improvements in performance. For the CYBER 205, it is shown that minor changes in the IO can reduce the CPU time by a factor of 50. Similar changes in the CRAY codes make a far smaller improvement.

Bauschlicher, Charles W., Jr.