Search NASA⌕ Search

SEARCH · Search NASA

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 181 records · Page 10

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

Comment on "Distribution of Partial neutron Widths for Nuclei Close to a Maximum of the Neutron Strength Function"

A recent Letter attempted to reconcile the disagreement between neutron resonance data and random matrix theory (RMT). To this end, a new formula was derived for transforming measured (γΛ n ) to reduced γΛ n 0 neutron widths for s-wave resonances (Λ=1,2,...) in nuclides near peaks of the s-wave neutron strength function. In this Comment, we show that such a rescaling would not, in general, be expected to reconcile the type of disagreement observed, and demonstrate that indeed it does not for the specific cases in question. Hence, the disagreements between RMT and these data remain.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Square Root Statistics of Density Matrices and Their Applications

To estimate the degree of quantum entanglement of random pure states, it is crucial to understand the statistical behavior of entanglement indicators such as the von Neumann entropy, quantum purity, and entanglement capacity. These entanglement metrics are functions of the spectrum of density matrices, and their statistical behavior over different generic state ensembles have been intensively studied in the literature. As an alternative metric, in this work, we study the sum of the square root spectrum of density matrices, which is relevant to negativity and fidelity in quantum information processing. In particular, we derive the finite-size mean and variance formulas of the sum of the square root spectrum over the Bures–Hall ensemble, extending known results obtained recently over the Hilbert–Schmidt ensemble.

97 MATHEMATICS AND COMPUTING↗

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↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Role of vertex corrections in the matrix formulation of the random phase approximation for the multiorbital Hubbard model

In the framework of a multiorbital Hubbard model description of superconductivity, a matrix formulation of the superconducting pairing interaction that has been widely used is designed to treat spin, charge, and orbital fluctuations within a random phase approximation (RPA). In terms of Feynman diagrams, this takes into account particle-hole ladder and bubble contributions as expected. It turns out, however, that this matrix formulation also generates additional terms which have the diagrammatic structure of vertex corrections. Furthermore we examine these terms and discuss the relationship between the matrix-RPA superconducting pairing interaction and the Feynman diagrams that it sums.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Improving convergence of the Matrix Power Control Algorithm for random vibration testing

Herein, this paper describes modifications to the Matrix Power Control Algorithm (MPCA) to improve convergence for Random Vibration Control (RVC) testing. In particular, this paper presents Multiple-Input Multiple-Output (MIMO) implementations of MPCA in simulation and experiment. An Euler–Bernoulli beam model was simulated with applied base excitations and the Box Assembly with Removable Component (BARC) was used in experiment to validate results. The Bayesian optimization package Dragonfly was used to optimize control parameters. Additionally, a moving-average was employed and optimized to improve the measured response feedback for MPCA, reduce the number of averages needed to be taken between control updates, and further improve convergence. The key results of this paper show that the performance of MPCA can be improved by tuning the control parameters and by applying an optimized moving-average. Furthermore, it is demonstrated that convergence can be achieved within 12 drive-frames, which greatly enhances vibration control capability.

42 ENGINEERING↗

Optimal system size for complex dynamics in random neural networks near criticality

In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parrallel Implementation of Fast Randomized Algorithms for Low Rank Matrix Decomposition

We analyze the parallel performance of randomized interpolative decomposition by de- composing low rank complex-valued Gaussian random matrices larger than 100 GB. We chose a Cray XMT supercomputer as it provides an almost ideal PRAM model permitting quick investigation of parallel algorithms without obfuscation from hardware idiosyncrasies. We obtain that on non-square matrices performance scales almost linearly with runtime about 100 times faster on 128 processors. We also verify that numerically discovered error bounds still hold on matrices two orders of magnitude larger than those previously tested.

Lucas, Andrew J.↗

Partial transpose of random quantum states: Exact formulas and meanders

We investigate the asymptotic behavior of the empirical eigenvalues distribution of the partial transpose of a random quantum state. The limiting distribution was previously investigated via Wishart random matrices indirectly (by approximating the matrix of trace 1 by the Wishart matrix of random trace) and shown to be the semicircular distribution or the free difference of two free Poisson distributions, depending on how dimensions of the concerned spaces grow. Our use of Wishart matrices gives exact combinatorial formulas for the moments of the partial transpose of the random state. We find three natural asymptotic regimes in terms of geodesics on the permutation groups. Two of them correspond to the above two cases; the third one turns out to be a new matrix model for the meander polynomials. Moreover, we prove the convergence to the semicircular distribution together with its extreme eigenvalues under weaker assumptions, and show large deviation bound for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multi-platform evaluation of the randomized CX low-rank matrix factorization in Spark

We investigate the performance and scalability of the randomized CX low-rank matrix factorization and demonstrate its applicability through the analysis of a 1TB mass spectrometry imaging (MSI) dataset, using Apache Spark on an Amazon EC2 cluster, a Cray XC40 system, and an experimental Cray cluster. We implemented this factorization both as a parallelized C implementation with hand-tuned optimizations and in Scala using the Apache Spark high-level cluster computing framework. We obtained consistent performance across the three platforms: using Spark we were able to process the 1TB size dataset in under 30 minutes with 960 cores on all systems, with the fastest times obtained on the experimental Cray cluster. In comparison, the C implementation was 21X faster on the Amazon EC2 system, due to careful cache optimizations, bandwidth-friendly access of matrices and vector computation using SIMD units. We report these results and their implications on the hardware and software issues arising in supporting data-centric workloads in parallel and distributed environments.

Gittens, Alex↗

A solution of the Gross-Witten matrix model by nonlinear random processes

We illustrate the stochastic method for solving the Schwinger-Dyson equations in large-N quantum field theories described in ArXiv:1009.4033 on the example of the Gross-Witten unitary matrix model. In the strong-coupling limit, this method can be applied directly, while in the weak-coupling limit we change the variables from compact to noncompact ones in order to cast the Schwinger-Dyson equations in the stochastic form. This leads to a new action with an infinite number of higher-order interaction terms. Nevertheless, such an action can be efficiently handled. This suggests the way to apply the method of ArXiv:1009.4033 to field theories with U(N) field variables as well as to effective field theories in the large-N limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

macroMS: Image-Guided Analysis of Random Objects by Matrix-Assisted Laser Desorption/Ionization Time-of-Flight Mass Spectrometry

Mass spectrometry imaging is well-suited to characterizing sample surfaces for their chemical content in a spatially resolved manner. However, when the surface contains small objects with significant empty spaces between them, more efficient approaches to sample acquisition are possible. Image-guided mass spectrometry (MS) enables high-throughput analysis of a diverse range of sample types, such as microbial colonies, liquid microdroplets, and others, by recognizing and analyzing selected location targets in an image. Here, we describe an imaging protocol and macroMS, an online software suite that can be used to enhance MS measurements of macroscopic samples that are imaged by a camera or a flatbed scanner. Furthermore, the web-based tool enables users to find and filter targets from the optical images, correct optical distortion issues for improved spatial location of selected targets, input the custom geometry files into an MS device to acquire spectra at the selected locations, and finally, perform limited data analysis and use visualization tools to aid locating samples containing compounds of interest. Using the macroMS suite, an enzyme mutant library of Saccharomyces cerevisiae and nL droplet arrays of Escherichia coli and Pseudomonas fluorescens have been assayed at a rate of ~2 s/sample.

47 OTHER INSTRUMENTATION↗