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 379 records · Page 21

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↗

Topological and symmetry-enriched random quantum critical points

In this work, we study how symmetry can enrich strong-randomness quantum critical points and phases, and lead to robust topological edge modes coexisting with critical bulk fluctuations. These are the disordered analogs of gapless topological phases. Using real-space and density matrix renormalization group approaches, we analyze the boundary and bulk critical behavior of such symmetry-enriched random quantum spin chains. We uncover a new class of symmetry-enriched infinite randomness fixed points: while local bulk properties are indistinguishable from conventional random singlet phases, nonlocal observables, and boundary critical behavior are controlled by a different renormalization group fixed point. We also illustrate how such new quantum critical points emerge naturally in Floquet systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

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↗

Effective conductivity of particulate polymer composite electrolytes using random resistor network method

The effective DC conductivity of particulate composite electrolytes was obtained by solving electrostatics equations using random resistors network method in three dimensions. The composite structure was considered to consist of three phases: matrix, particulate filler, and conductive shell that surrounded each particle; each phase possessing a different conductivity. Different particle size distributions were generated using Monte Carlo simulations. Unlike effective medium formulations, it was shown that the random resistors network method was able to predict percolation thresholds for the effective composite conductivity. It was found that the mean particle radius has a higher influence on the effective composite conductivity compared to the effect of type of the particle size distributions that were considered. The effect of the shell thickness on the composite conductivity has been investigated. It was found that the conductivity enhancement due to the presence of the conductive shell phase becomes less evident as the shell thickness increases.

36 MATERIALS SCIENCE↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

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↗

Microlite orientation in obsidian flow measured by synchrotron X-ray diffraction

Clinopyroxene and plagioclase (andesine) microlites in an obsidian flow from Glass Mountain (NE California, USA) display strong alignment. Synchrotron X-ray diffraction, coupled with Rietveld analysis, was used to quantify crystallographic-preferred orientation (CPO). Clinopyroxene, with a rod-shaped morphology, shows a strong alignment of [001] in the flow direction and (010) aligned parallel to the inferred flow plane. Andesine, with a platy morphology, displays an alignment of (010) platelets in the flow plane. Some pole densities exceed 90 multiples of random distribution. Applying a model of rigid ellipsoidal inclusions in a viscous matrix, the local pure shear strains are between 2 and 3.

58 GEOSCIENCES↗

Analysis of the ratio of ℓ 1 and ℓ 2 norms in compressed sensing

We study the ratio of ℓ 1 and ℓ 2 norms ( ℓ 1 / ℓ 2 ) as a sparsity-promoting objective in compressed sensing. We first propose a novel criterion that guarantees that an s-sparse signal is the local minimizer of the ℓ 1 / ℓ 2 objective; our criterion is interpretable and useful in practice. We also give the first uniform recovery condition using a geometric characterization of the null space of the measurement matrix, and show that this condition is satisfied for a class of random matrices. We also present analysis on the robustness of the procedure when noise pollutes data. Numerical experiments are provided that compare ℓ 1 / ℓ 2 with some other popular non-convex methods in compressed sensing. Finally, we propose a novel initialization approach to accelerate the numerical optimization procedure. We call this initialization approach support selection, and we demonstrate that it empirically improves the performance of existing ℓ 1 / ℓ 2 algorithms.

97 MATHEMATICS AND COMPUTING↗

Atom Probe Tomography Analysis of the Distribution of Rhenium in Nickel Alloys

Atom probe tomography (APT) is used to characterise the distributions of rhenium in a binary Ni-Re alloy and the nickel-based single-crystal CMSX-4 superalloy. A purpose-built algorithm is developed to quantify the size distribution of solute clusters, and applied to the APT datasets to critique the hypothesis that rhenium is prone to the formation of clusters in these systems. No evidence is found to indicate that rhenium forms solute clusters above the level expected from random fluctuations. In CMSX-4, enrichment of Re is detected in the matrix phase close to the matrix/precipitate ({gamma}/{gamma}{prime}) phase boundaries. Phase field modelling indicates that this is due to the migration of the {gamma}/{gamma}{prime} interface during cooling from the temperature of operation. Thus, neither clustering of rhenium nor interface enrichments can be the cause of the enhancement in high temperature mechanical properties conferred by rhenium alloying.

36 MATERIALS SCIENCE↗

Microstructural characterization and strengthening behavior of nanometer sized carbides in Ti–Mo microalloyed steels during continuous cooling process

Nanometer-sized carbides that precipitated in a Ti–Mo bearing steel after interrupted continuous cooling in a temperature range of 620–700 °C with or without hot deformation were investigated by field-emission-gun transmission electron microscopy. The nanometer-sized carbides were identified as randomly homogeneous precipitation carbides and interphase precipitation carbides coexisting in the ferrite matrix. It is found that this dual precipitation morphology of carbides in the steel leads to the non-uniform mechanical properties of individual ferrite grains. Vickers hardness data mainly revealed that, in the specimens cooled at a rate of 0.5 °C/s without hot deformation, the range of Vickers hardness distribution was 230–340 HV 0.1 when cooling was interrupted at 680 °C, and 220–360 HV 0.1 when cooling was interrupted at 650 °C. For the specimens cooled at a rate of 0.5 °C/s with hot deformation, the range of Vickers hardness distribution was 290–360 HV 0.1 when cooling was interrupted at 680 °C, and 280–340 HV 0.1 when cooling was interrupted at 650 °C. Therefore, a narrower range of hardness distribution occurred in the specimens that underwent hot deformation and were then cooled with a lower interrupted cooling temperature. The uniform precipitation status in each ferrite grain can lead to ferrite grains with a narrower Vickers hardness distribution. On the other hand, interrupted cooling produced a maximum Vickers hardness of 320–330 HV 0.1 for the hot deformed specimens and 290–310 HV 0.1 for the non-deformed specimens with cooling interrupted in the temperature range of 660–670 °C. The maximum Vickers hardness obtained in such a temperature range can be ascribed to the full precipitation of the microalloying elements in the supersaturated ferrite matrix with a tiny size (~ 4–7 nm). - Highlight: • The interrupted continuous cooling temperatures were 620 °C to 700 °C. • Precipitation carbides with dual dispersed morphology coexisted in the matrix. • Heavy hot deformation narrowed the range of hardness distribution. • Full precipitation of nano-sized carbides achieved maximum hardening.

36 MATERIALS SCIENCE↗

Using high spatial resolution satellite imagery to map forest burn severity across spatial scales in a Pine Barrens ecosystem

As a primary disturbance agent, fire significantly influences local processes and services of forest ecosystems. Although a variety of remote sensing based approaches have been developed and applied to Landsat mission imagery to infer burn severity at 30 m spatial resolution, forest burn severity have still been seldom assessed at fine spatial scales (≤ 5 m) from very-high-resolution (VHR) data. Here we assessed a 432 ha forest fire that occurred in April 2012 on Long Island, New York, within the Pine Barrens region, a unique but imperiled fire-dependent ecosystem in the northeastern United States. The mapping of forest burn severity was explored here at fine spatial scales, for the first time using remotely sensed spectral indices and a set of Multiple Endmember Spectral Mixture Analysis (MESMA) fraction images from bi-temporal — pre- and post-fire event — WorldView-2 (WV-2) imagery at 2 m spatial resolution. We first evaluated our approach using 1 m by 1 m validation points at the sub-crown scale per severity class (i.e. unburned, low, moderate, and high severity) from the post-fire 0.10 m color aerial ortho-photos; then, we validated the burn severity mapping of geo-referenced dominant tree crowns (crown scale) and 15 m by 15 m fixed-area plots (inter-crown scale) with the post-fire 0.10 m aerial ortho-photos and measured crown information of twenty forest inventory plots. Our approach can accurately assess forest burn severity at the sub-crown (overall accuracy is 84% with a Kappa value of 0.77), crown (overall accuracy is 82% with a Kappa value of 0.76), and inter-crown scales (89% of the variation in estimated burn severity ratings (i.e. Geo-Composite Burn Index (CBI)). Lastly, this work highlights that forest burn severity mapping from VHR data can capture heterogeneous fire patterns at fine spatial scales over the large spatial extents. This is important since most ecological processes associated with fire effects vary at the < 30 m scale and VHR approaches could significantly advance our ability to characterize fire effects on forest ecosystems.

54 ENVIRONMENTAL SCIENCES↗

A review on recent machine learning applications for imaging mass spectrometry studies

Imaging mass spectrometry (IMS) is a powerful analytical technique widely used in biology, chemistry, and materials science fields that continue to expand. IMS provides a qualitative compositional analysis and spatial mapping with high chemical specificity. The spatial mapping information can be 2D or 3D depending on the analysis technique employed. Due to the combination of complex mass spectra coupled with spatial information, large high-dimensional datasets (hyperspectral) are often produced. Therefore, the use of automated computational methods for an exploratory analysis is highly beneficial. The fast-paced development of artificial intelligence (AI) and machine learning (ML) tools has received significant attention in recent years. These tools, in principle, can enable the unification of data collection and analysis into a single pipeline to make sampling and analysis decisions on the go. There are various ML approaches that have been applied to IMS data over the last decade. Here, in this review, we discuss recent examples of the common unsupervised (principal component analysis, non-negative matrix factorization, k-means clustering, uniform manifold approximation and projection), supervised (random forest, logistic regression, XGboost, support vector machine), and other methods applied to various IMS datasets in the past five years. The information from this review will be useful for specialists from both IMS and ML fields since it summarizes current and representative studies of computational ML-based exploratory methods for IMS.

47 OTHER INSTRUMENTATION↗

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↗

Wind and Load Forecast Error Model for Multiple Geographically Distributed Forecasts

The impact of wind and load forecast errors on power grid operations is frequently evaluated by conducting multi-variant studies, where these errors are simulated repeatedly as random processes based on their known statistical characteristics. To generate these errors correctly, we need to reflect their distributions (which do not necessarily follow a known distribution law), standard deviations, auto- and cross-correlations. For instance, load and wind forecast errors can be closely correlated in different zones of the system. This paper introduces a new methodology for generating multiple cross-correlated random processes to simulate forecast error curves based on a transition probability matrix computed from an empirical error distribution function. The matrix will be used to generate new error time series with statistical features similar to observed errors. We present the derivation of the method and present some experimental results by generating new error forecasts together with their statistics.

17 WIND ENERGY↗

Linear growth of circuit complexity from Brownian dynamics

How rapidly can a many-body quantum system generate randomness? Using path integral methods, we demonstrate that Brownian quantum systems have circuit complexity that grows linearly with time. In particular, we study Brownian clusters of N spins or fermions with time-dependent all-to-all interactions, and calculate the Frame Potential to characterize complexity growth in these models. In both cases the problem can be mapped to an effective statistical mechanics problem which we study using path integral methods. Within this framework it is straightforward to show that the kth Frame Potential comes within ϵ of the Haar value after a time of order t ~ kN + k log k + log ϵ –1 . Using a bound on the diamond norm, this implies that such circuits are capable of coming very close to a unitary k-design after a time of order t ~ kN. We also consider the same question for systems with a time-independent Hamiltonian and argue that a small amount of time-dependent randomness is sufficient to generate a k-design in linear time provided the underlying Hamiltonian is quantum chaotic. These models provide explicit examples of linear complexity growth that are analytically tractable and are directly applicable to practical applications calling for unitary k-designs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

In-Trap Decay Spectroscopy of Radioactive Nuclei at TITAN/TRIUMF for a Determination of 2{nu}{beta}{beta} Matrix Elements

To extract the effective neutrino Majorana mass from an observed 0{nu}{beta}{beta} decay, precise knowledge of the involved nuclear matrix element is required. This poses a challenge to nuclear structure models. In particular, calculations based on the proton-neutron Quasiparticle Random Phase Approximation show significant discrepancies with experimental electron capture (EC) rates of the intermediate nucleus even when tuned on 2{nu}{beta}{beta} decay rates. However, EC branching ratios (BR) are in many cases not well known because the strengths of these decay branches are at the sensitivity limit of traditional experimental techniques. Here, we present a novel approach at TITAN/TRIUMF to measure EC-BR and to overcome shortcomings of previous methods. We also present results of a first proof-of-principle experiment which represents the very first observation of an electron capture in a Penning trap.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hypergraph Random Walks, Laplacians, and Clustering

We propose a flexible framework for clustering hypergraph-structured data based on recently proposed random walks utilizing edge-dependent vertex weights. When incorporating edge-dependent vertex weights (EDVW), a weight is associated with each vertex-hyperedge pair, yielding a weighted incidence matrix of the hypergraph. Such weightings have been utilized in term-document representations of text data sets. We explain how random walks with EDVW serve to construct different hypergraph Laplacian matrices, and then develop a suite of clustering methods that use these incidence matrices and Laplacians for hypergraph clustering. Using 20Newsgroup, U.S. patent, Reuters' Corpus Volume 1, and genetics data sets, we compare the performance of these clustering algorithms experimentally against a variety of existing hypergraph clustering methods. We show that the proposed methods produce higher-quality clusters.

hypergraphs, clustering, laplacian, random walk, M↗

A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix

A Euclidean distance matrix (EDM) is a table of distance-square between points on a k-dimensional Euclidean space, with applications in many fields (e.g., engineering, geodesy, economics, genetics, biochemistry, and psychology). A problem that often arises is the absence (or uncertainty) of some EDM elements. In many situations, only a subset of all pairwise distances is available and it is desired to have some procedure to estimate the missing distances. In this paper, we address the problem of missing data in EDM through low-rank matrix completion techniques. We exploit the fact that the rank of a EDM is at most k+2 and does not depend on the number of points, which is, in general, much bigger then k. We use a singular value decomposition approach that considers the rank of the matrix to be completed and computes, in each iteration, a parameter that controls the convergence of the method. After performing a number of computational experiments, we could observe that our proposal was able to recover, with high precision, random EDMs with more than 1000 points and up to 98% of missing data in few minutes. In addition, our method required a smaller number of iterations when compared to other competitive state-of-art technique.

97 MATHEMATICS AND COMPUTING↗