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 55 records · Page 3

Transitions in eigenvalue and wavefunction structure in (1+2)-body random matrix ensembles with spin

Finite interacting Fermi systems with a mean-field and a chaos generating two-body interaction are modeled by one plus two-body embedded Gaussian orthogonal ensemble of random matrices with spin degree of freedom [called EGOE(1+2)-s]. Numerical calculations are used to demonstrate that, as lambda, the strength of the interaction (measured in the units of the average spacing of the single-particle levels defining the mean-field), increases, generically there is Poisson to GOE transition in level fluctuations, Breit-Wigner to Gaussian transition in strength functions (also called local density of states) and also a duality region where information entropy will be the same in both the mean-field and interaction defined basis. Spin dependence of the transition points lambda{sub c}, lambda{sub F}, and lambda{sub d}, respectively, is described using the propagator for the spectral variances and the formula for the propagator is derived. We further establish that the duality region corresponds to a region of thermalization. For this purpose we compared the single-particle entropy defined by the occupancies of the single-particle orbitals with thermodynamic entropy and information entropy for various lambda values and they are very close to each other at lambda=lambda{sub d}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Typicality in random matrix product states

Recent results suggest that the use of ensembles in statistical mechanics may not be necessary for isolated systems, since typically the states of the Hilbert space would have properties similar to those of the ensemble. Nevertheless, it is often argued that most of the states of the Hilbert space are nonphysical and not good descriptions of realistic systems. Therefore, to better understand the actual power of typicality it is important to ask if it is also a property of a set of physically relevant states. Here we address this issue, studying if and how typicality emerges in the set of matrix product states. We show analytically that typicality occurs for the expectation value of subsystems' observables when the rank of the matrix product state scales polynomially with the size of the system with a power greater than 2. We illustrate this result numerically and present some indications that typicality may appear already for a linear scaling of the rank of the matrix product state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Open quantum systems and random matrix theory

A simple model for open quantum systems is analyzed with RMT. The system is coupled to the continuum in a minimal way. In this paper we see the effect of opening the system on the level statistics, in particular the level spacing, width distribution and Δ{sub 3}(L) statistic are examined as a function of the strength of this coupling. The usual super-radiant state is observed, and it is seen that as it is formed, the level spacing and Δ{sub 3}(L) statistic exhibit the signatures of missed levels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Schur polynomials and biorthogonal random matrix ensembles

The study of the average of Schur polynomials over a Stieltjes-Wigert ensemble has been carried out by Dolivet and Tierz [J. Math. Phys. 48, 023507 (2007); e-print arXiv:hep-th/0609167], where it was shown that it is equal to quantum dimensions. Using the same approach, we extend the result to the biorthogonal case. We also study, using the Littlewood-Richardson rule, some particular cases of the quantum dimension result. Finally, we show that the notion of Giambelli compatibility of Schur averages, introduced by Borodin et al. [Adv. Appl. Math. 37, 209 (2006); e-print arXiv:math-ph/0505021], also holds in the biorthogonal setting.

97 MATHEMATICS AND COMPUTING↗

Convergence in High Probability of the Quantum Diffusion in a Random Band Matrix Model

We consider Hermitian random band matrices H in d⩾1 dimensions. The matrix elements H{sub xy}, indexed by x,y∈Λ⊂ℤ{sup d}, are independent, uniformly distributed random variable if |x−y| is less than the band width W, and zero otherwise. We update the previous results of the converge of quantum diffusion in a random band matrix model from convergence of the expectation to convergence in high probability. The result is uniformly in the size |Λ| of the matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Uncertainty Models for the Hybrid Parametric Variation Method of Uncertainty Quantification; Analysis

There is some level of uncertainty in every finite element model (FEM), which flows to a level of uncertainty in predicted results. The purpose of uncertainty quantification (UQ) is to provide statistical bounds on prediction accuracy based on model uncertainty. This is distinct from model updating, which attempts to modify models to improve their accuracy. UQ does not improve the accuracy of models, but accepts that the models are inherently inaccurate and attempts to quantify the impact of that inaccuracy on predicted results. Previously, an alternate method for UQ, called the Hybrid Parametric Variation (HPV) method, was applied to Space Launch System (SLS) Hurty/Craig-Bampton (HCB) components to predict system-level statistics for launch vehicle attitude control transfer functions and core stage section loads due to buffet. The HPV method combines a parametric variation of the HCB fixed-interface (FI) modal frequencies with a nonparametric variation (NPV) method that randomly varies the HCB mass and stiffness matrices as Wishart random matrix distributions using random matrix theory (RMT). Alternatively, the most common method for modeling uncertainty in the structural dynamics community is a parametric approach, which varies physical parameters in the model. However, there are several disadvantages associated with the parametric method. Determining a reduced set of parameters that have a significant impact on the system response can be time consuming, and the selected parameter probability distributions are rarely reliably known. Therefore, in practice, the parameters are surrogates for the actual errors, and the link to parameter uncertainty is unknown. Another major drawback is that the uncertainty that can be represented is limited to the form of the nominal FEM. It is the experience of the authors that based on numerous aerospace programs, almost all FEM errors are in form rather than parameter values. This hypothesis is supported by the observation of the authors that it is almost never possible to ‘tune’ a FEM to match modal test results by only modifying model parameters. Model-form uncertainty cannot be directly represented by FEM input parameters nor included in a parametric approach. However, model-form uncertainty can be modeled using RMT, where a probability distribution is developed for the matrix ensemble of interest. The major advantage of the NPV method is that it covers errors in model form. The HPV method anchors uncertainty at the HCB component level to component modal test results by matching the HCB and test modes based on mode descriptions or other methods, and then applying differing levels of frequency variation. The specific variations depend on the confidence to which a component FEM has been validated through modal testing. The NPV method is layered on the frequency variation to match modal test self-orthogonality and cross-orthogonality (XO) results. Once the component uncertainty models are identified, they are assembled, and the uncertainty is propagated to the system level using a Monte Carlo (MC) analysis approach that generates statistics for system-level predictions This provides a UQ method that can be traced to test data, which can be updated as additional data and improved correlated models become available. The purpose of this paper is to collect and present all of the theory for HPV that has been previously published in reports and papers and to present examples of its application. Specifically, component uncertainty models based on the dispersion of corresponding mass and stiffness matrices using proposed test/analysis correlation metrics are investigated. The first example is purely academic so that the true answers are known, and the validity of the HPV method and the corresponding uncertainty models can be determined. The purpose of this paper is to collect and present all of the theory for HPV that has been previously published in reports and papers and to present examples of its application. Specifically, component uncertainty models based on the dispersion of corresponding mass and stiffness matrices using proposed test/analysis correlation metrics are investigated. The first example is purely academic so that the true answers are known, and the validity of the HPV method and the corresponding uncertainty models can be determined. The second example is an application to a component that is design specific to the SLS. Based on this work and other assessments, the HPV method provides another tool to the toolset used for complex system UQ analysis. From experience gathered to date using the HPV method, additional design specific applications must be investigated to provide further confidence in the validity of the HPV method of UQ analysis.

Uncertainty quantification↗

Data-driven probability concentration and sampling on manifold

A new methodology is proposed for generating realizations of a random vector with values in a finite-dimensional Euclidean space that are statistically consistent with a dataset of observations of this vector. The probability distribution of this random vector, while a priori not known, is presumed to be concentrated on an unknown subset of the Euclidean space. A random matrix is introduced whose columns are independent copies of the random vector and for which the number of columns is the number of data points in the dataset. The approach is based on the use of (i) the multidimensional kernel-density estimation method for estimating the probability distribution of the random matrix, (ii) a MCMC method for generating realizations for the random matrix, (iii) the diffusion-maps approach for discovering and characterizing the geometry and the structure of the dataset, and (iv) a reduced-order representation of the random matrix, which is constructed using the diffusion-maps vectors associated with the first eigenvalues of the transition matrix relative to the given dataset. The convergence aspects of the proposed methodology are analyzed and a numerical validation is explored through three applications of increasing complexity. The proposed method is found to be robust to noise levels and data complexity as well as to the intrinsic dimension of data and the size of experimental datasets. Both the methodology and the underlying mathematical framework presented in this paper contribute new capabilities and perspectives at the interface of uncertainty quantification, statistical data analysis, stochastic modeling and associated statistical inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Molecular selection in a unified evolutionary sequence

With guidance from experiments and observations that indicate internally limited phenomena, an outline of unified evolutionary sequence is inferred. Such unification is not visible for a context of random matrix and random mutation. The sequence proceeds from Big Bang through prebiotic matter, protocells, through the evolving cell via molecular and natural selection, to mind, behavior, and society.

Review, Tutorial↗

Quickest Detection for Changes in Maximal kNN Coherence of Random Matrices

This paper addresses the problem of quickest detection of a change in the maximal coherence between columns of a n p random matrix based on a sequence of matrix observations having a single unknown change point. The random matrix is assumed to have identically distributed rows and the maximal coherence is defined as the largest of the ( 2 p) correlation coefficients associated with any row. Likewise the κ nearest neighbor (kNN) coherence is defined as the κ-th largest of these correlation coefficients. The forms of the preand postchange distributions of the observed matrices are assumed to belong to the family of elliptically contoured densities with sparse dispersion matrices but are otherwise unknown. A nonparametric stopping rule is proposed that is based on the maximal kNN sample coherence between columns of each observed random matrix. This is a summary statistic that is related to a test of existence of a hub vertex in a sample correlation graph having degree at least κ. Performance bounds on the delay and false alarm performance of the proposed stopping rule are obtained in the purely high-dimensional regime where p → ∞ and n is fixed. When the prechange dispersion matrix is diagonal it is shown that, among all functions of the proposed summary statistic, the proposed stopping rule is asymptotically optimal under a minimax quickest change detection model as the stopping threshold approaches infinity. Furthermore, the theory developed also applies to sequential hypothesis testing and fixed sample size tests.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗