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 451 records · Page 25

Randomized Cholesky Preconditioning for Graph Partitioning Applications

Graph partitioning has emerged as an area of interest due to its use in various applications in computational research. One way to partition a graph is to solve for the eigenvectors of the corresponding graph Laplacian matrix. This project focuses on the eigensolver LOBPCG and the evaluation of a new preconditioner: Randomized Cholesky Factorization (rchol). This proconditioner was tested for its speed and accuracy against other well-known preconditioners for the method. After experiments were run on several known test matrices, rchol appears to be a better preconditioner for structured matrices. This research was sponsored by National Nuclear Security Administration Minority Serving Institutions Internship Program (NNSA-MSIIP) and completed at host facility Sandia National Laboratories. As such, after discussion of the research project itself, this report contains a brief reflection on experience gained as a result of participating in the NNSA-MSIIP.

97 MATHEMATICS AND COMPUTING↗

Transport Upscaling under Flow Heterogeneity and Matrix-Diffusion in Three-Dimensional Discrete Fracture Networks

For this work, we investigate the combined effects of network scale flow variability and retention due to matrix-diffusion on the scaling behavior of transport through fractured media. Two of the principal mechanisms controlling the transport of solutes through fractured low-permeability media are broad distributions of flow velocities and retention times in the solid matrix. We study the relative impact of these two processes under different initial conditions using a set of three-dimensional discrete fracture network simulations. We use these simulations to develop and calibrate an upscaled continuous time random walk (CTRW) approach for advective transport based on an Ornstein-Uhlenbeck model for the particle velocities that accounts for the fracture-matrix coupling using a compound Poisson process. This CTRW model can be conditioned on the initial solute distribution and allows to observe late-time scaling behavior at distances beyond what is feasible to observe using high-fidelity direct numerical simulations. We determine that the initial distribution of particles leads to marked differences in the persistent long-term scale behavior in the solute travel time distributions, even those undergoing retention due to matrix diffusion through implementation and analysis of the model.

54 ENVIRONMENTAL SCIENCES↗

Revisiting the Hail Radar Reflectivity–Kinetic Energy Flux Relation by Combining T-Matrix and Discrete Dipole Approximation Calculations to Size Distribution Observations

The retrieval of hail kinetic energy with weather radars or its simulation in numerical models is challenging because of the shape complexity and variable density of hailstones. We combine 3D scans of individual hailstones with measurements of the particle size distributions (PSD) and T-matrix calculations to understand how hail reflectivity Z changes when approximating hailstones as spheroids, as compared to the realistic shapes obtained by 3D scanning technology. Additionally, recent terminal velocity relations are used to compare Z to the hail kinetic energy flux E ˙ . We parameterize the hail backscattering cross sections at L, S, C, and X bands as a function of size between 0.5 and 5.0 cm, matching the range of the observed PSDs. The scattering calculations use the T-matrix method for size parameters below 1.0 and the discrete dipole approximation (DDA) method otherwise. The DDA calculations are done for 48 digital models of realistic hailstones of sizes between 1 and 5 cm. The DDA cross sections are calculated for multiple orientations and averaged assuming a fully random orientation distribution to provide a single value per hailstone. The T-matrix reflectivity assuming solid ice spheres presents negligible differences to DDA results for size parameters below 1.0. Therefore, T matrix was used to fill in the gaps left by the DDA calculations. The results are mapped to the same size bins of the observed PSDs, allowing the calculation of the radar reflectivity. This is then correlated to E ˙ , allowing a potential improvement of past retrieval methods of E ˙ from Z in multiple wavelengths.

54 ENVIRONMENTAL SCIENCES↗

Probabilisitc Geobiological Classification Using Elemental Abundance Distributions and Lossless Image Compression in Recent and Modern Organisms

Last year we presented techniques for the detection of fossils during robotic missions to Mars using both structural and chemical signatures[Storrie-Lombardi and Hoover, 2004]. Analyses included lossless compression of photographic images to estimate the relative complexity of a putative fossil compared to the rock matrix [Corsetti and Storrie-Lombardi, 2003] and elemental abundance distributions to provide mineralogical classification of the rock matrix [Storrie-Lombardi and Fisk, 2004]. We presented a classification strategy employing two exploratory classification algorithms (Principal Component Analysis and Hierarchical Cluster Analysis) and non-linear stochastic neural network to produce a Bayesian estimate of classification accuracy. We now present an extension of our previous experiments exploring putative fossil forms morphologically resembling cyanobacteria discovered in the Orgueil meteorite. Elemental abundances (C6, N7, O8, Na11, Mg12, Ai13, Si14, P15, S16, Cl17, K19, Ca20, Fe26) obtained for both extant cyanobacteria and fossil trilobites produce signatures readily distinguishing them from meteorite targets. When compared to elemental abundance signatures for extant cyanobacteria Orgueil structures exhibit decreased abundances for C6, N7, Na11, All3, P15, Cl17, K19, Ca20 and increases in Mg12, S16, Fe26. Diatoms and silicified portions of cyanobacterial sheaths exhibiting high levels of silicon and correspondingly low levels of carbon cluster more closely with terrestrial fossils than with extant cyanobacteria. Compression indices verify that variations in random and redundant textural patterns between perceived forms and the background matrix contribute significantly to morphological visual identification. The results provide a quantitative probabilistic methodology for discriminating putatitive fossils from the surrounding rock matrix and &om extant organisms using both structural and chemical information. The techniques described appear applicable to the geobiological analysis of meteoritic samples or in situ exploration of the Mars regolith. Keywords: cyanobacteria, microfossils, Mars, elemental abundances, complexity analysis, multifactor analysis, principal component analysis, hierarchical cluster analysis, artificial neural networks, paleo-biosignatures

Storrie-Lombardi, Michael C.↗

The influence of pairing correlations on the isospin symmetry breaking corrections of superallowed Fermi beta decays

Within the framework of quasi-particle random phase approximation, the isospin breaking correction of superallowed 0{sup +} {yields} 0{sup +} beta decay and unitarity of Cabibbo-Kobayashi-Maskawa mixing matrix have been investigated. The broken isotopic symmetry of nuclear part of Hamiltonian has been restored by Pyatov's method. The isospin symmetry breaking correction with pairing correlations has been compared with the previous results without pairing. The effect of pairing interactions has been examined for nine superallowed Fermi beta decays; their parent nuclei are {sup 26}Al, {sup 34}Cl, {sup 38}K, {sup 42}Sc, {sup 46}V, {sup 50}Mn, {sup 54}Co, {sup 62}Ga, {sup 74}Rb.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Randomized Algorithms for Scientific Computing (RASC)

Randomized algorithms have propelled advances in artificial intelligence (AI) and represent a foundational research area in advancing AI for Science. Future advancements in DOE Office of Science priority areas such as climate science, astrophysics, fusion, advanced materials, combustion, and quantum computing all require randomized algorithms for surmounting challenges of complexity, robustness, and scalability. Advances in data collection and numerical simulation have changed the dynamics of scientific research and motivate the need for randomized algorithms. For instance, advances in imaging technologies such as X-ray ptychography, electron microscopy, electron energy loss spectroscopy, or adaptive optics lattice light-sheet microscopy collect hyperspectral imaging and scattering data in terabytes, at breakneck speed enabled by state-of-the-art detectors. The data collection is exceptionally fast compared with its analysis. Likewise, advances in high-performance architectures have made exascale computing a reality and changed the economies of scientific computing in the process. Floating-point operations that create data are essentially free in comparison with data movement. Thus far, most approaches have focused on creating faster hardware. Ironically, this faster hardware has exacerbated the problem by making data still easier to create. Under such an onslaught, scientists often resort to heuristic deterministic sampling schemes (e.g., low-precision arithmetic, sampling every nth element) and sacrifice potentially valuable accuracy. Dramatically better results can be achieved via randomized algorithms, reducing the data size as much as or more than naive deterministic subsampling can achieve, while retaining the high accuracy of computing on the full data set. By randomized algorithms we mean those algorithms that employ some form of randomness in internal algorithmic decisions to accelerate time to solution, increase scalability, or improve reliability. Examples include matrix sketching for solving large-scale least-squares problems (see Figure 1) and stochastic gradient descent for training machine learning models. We are not recommending heuristic methods but rather randomized algorithms that have certificates of correctness and probabilistic guarantees of optimality and near-optimality. Such approaches can be useful beyond acceleration, for example, in understanding how to avoid measure zero worst-case scenarios that plague methods such as QR matrix factorization.

97 MATHEMATICS AND COMPUTING↗

A Numerical Solution Routine for Investigating Oxidation-Induced Strength Degradation Mechanisms in SiC/SiC Composites

The stress rupture strength of silicon carbide fiber-reinforced silicon carbide (SiCSiC) composites with a boron nitride (BN) fiber coating decreases with time within the intermediate temperature range of 700-950 C. Various theories have been proposed to explain the cause of the time dependent stress rupture strength. Some previous authors have suggested that the observed composite strength behavior is due to the inherent time dependent strength of the fibers, which is caused by the slow growth of flaws within the fibers. Flaw growth is supposedly enabled by oxidation of free carbon at the grain boundaries. The objective of this paper is to investigate the relative significance of the various theories for the time-dependent strength of SiCSiC composites. This is achieved through the development of a numerically-based progressive failure analysis routine and through the application of the routine to simulate the composite stress rupture tests. The progressive failure routine is a time marching routine with an iterative loop between a probability of fiber survival equation and a force equilibrium equation within each time step. Failure of the composite is assumed to initiate near a matrix crack and the progression of fiber failures occurs by global load sharing. The probability of survival equation is derived from consideration of the strength of ceramic fibers with randomly occurring and slow growing flaws as well as the mechanical interaction between the fibers and matrix near a matrix crack. The force equilibrium equation follows from the global load sharing presumption. The results of progressive failure analyses of the composite tests suggest that the relationship between time and stress-rupture strength is attributed almost entirely to the slow flaw growth within the fibers. Although other mechanisms may be present, they appear to have only a minor influence on the observed time dependent behavior.

degradation↗

Time-Dependent Stress Rupture Strength Degradation of Hi-Nicalon Fiber-Reinforced Silicon Carbide Composites at Intermediate Temperatures

The stress rupture strength of silicon carbide fiber-reinforced silicon carbide composites with a boron nitride fiber coating decreases with time within the intermediate temperature range of 700 to 950 degree Celsius. Various theories have been proposed to explain the cause of the time-dependent stress rupture strength. The objective of this paper is to investigate the relative significance of the various theories for the time-dependent strength of silicon carbide fiber-reinforced silicon carbide composites. This is achieved through the development of a numerically based progressive failure analysis routine and through the application of the routine to simulate the composite stress rupture tests. The progressive failure routine is a time-marching routine with an iterative loop between a probability of fiber survival equation and a force equilibrium equation within each time step. Failure of the composite is assumed to initiate near a matrix crack and the progression of fiber failures occurs by global load sharing. The probability of survival equation is derived from consideration of the strength of ceramic fibers with randomly occurring and slow growing flaws as well as the mechanical interaction between the fibers and matrix near a matrix crack. The force equilibrium equation follows from the global load sharing presumption. The results of progressive failure analyses of the composite tests suggest that the relationship between time and stress-rupture strength is attributed almost entirely to the slow flaw growth within the fibers. Although other mechanisms may be present, they appear to have only a minor influence on the observed time-dependent behavior.

Progressive Failure Analysis↗

Direct Simulation of Multiple Scattering by Discrete Random Media Illuminated by Gaussian Beams

The conventional orientation-averaging procedure developed in the framework of the superposition T-matrix approach is generalized to include the case of illumination by a Gaussian beam (GB). The resulting computer code is parallelized and used to perform extensive numerically exact calculations of electromagnetic scattering by volumes of discrete random medium consisting of monodisperse spherical particles. The size parameters of the scattering volumes are 40, 50, and 60, while their packing density is fixed at 5%. We demonstrate that all scattering patterns observed in the far-field zone of a random multisphere target and their evolution with decreasing width of the incident GB can be interpreted in terms of idealized theoretical concepts such as forward-scattering interference, coherent backscattering (CB), and diffuse multiple scattering. It is shown that the increasing violation of electromagnetic reciprocity with decreasing GB width suppresses and eventually eradicates all observable manifestations of CB. This result supplements the previous demonstration of the effects of broken reciprocity in the case of magneto-optically active particles subjected to an external magnetic field.

Mackowski, Daniel W.↗

Improved Statistical Analysis for the Neutrinoless Double-Beta Decay Matrix Element of 136Xe

Neutrinoless double beta decay nuclear matrix element (M0ν) for 136Xe was recently analyzed using a statistical approach (Phys. Rev. C 107, 045501 (2023)). In the analysis, three initial shell model effective Hamiltonians were randomly altered, and their results for 23 measured observables were used to infer credibility for the M0ν nuclear matrix element (NME) based on a Bayesian Model Averaging approach. In that analysis, a reasonable Gamow-Teller quenching factor of 0.7 was assumed for each starting effective Hamiltonian. Given that the result of the statistical analysis was sensible to this choice, we are here improving that analysis by assuming that the Gamow-Teller quenching factor is also randomly chosen within reasonabe limits for all three starting Hamiltonians. The outcomes are slightly higher expectation values and uncertainties for the M0ν NME.

Astronomy & Astrophysics↗

Magnons in one-dimensional k-component Fibonacci structures

We have studied the magnon transmission through of one-dimensional magnonic k-component Fibonacci structures, where k different materials are arranged in accordance with the following substitution rule: S{sub n}{sup (k)}=S{sub n−1}{sup (k)}S{sub n−k}{sup (k)} (n≥k=0,1,2,…), where S{sub n}{sup (k)} is the nth stage of the sequence. The calculations were carried out in exchange dominated regime within the framework of the Heisenberg model and taking into account the RPA approximation. We have considered multilayers composed of simple cubic spin-S Heisenberg ferromagnets, and, by using the powerful transfer-matrix method, the spin wave transmission is obtained. It is demonstrated that the transmission coefficient has a rich and interesting magnonic pass- and stop-bands structures, which depends on the frequency of magnons and the k values.

36 MATERIALS SCIENCE↗

Entanglement transitions in random definite particle states

Entanglements within qubits are studied for the subspace of definite particle states or definite number of up spins. A transition from an algebraic decay of entanglement within two qubits with the total number N of qubits to an exponential one when the number of particles is increased from two to three is studied in detail. In particular the probability that the concurrence is nonzero is calculated using statistical methods and is shown to agree with numerical simulations. Further entanglement within a block of m qubits is studied using the log-negativity measure, which indicates that a transition from algebraic to exponential decay occurs when the number of particles exceeds m. Several algebraic exponents for the decay of the log negativity are analytically calculated. The transition is shown to be possibly connected to the changes in the density of states of the reduced density matrix, which has a divergence at the zero eigenvalue when the entanglement decays algebraically.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

The Effect of General Statistical Fiber Misalignment on Predicted Damage Initiation in Composites

A micromechanical method is employed for the prediction of unidirectional composites in which the fiber orientation can possess various statistical misalignment distributions. The method relies on the probability-weighted averaging of the appropriate concentration tensor, which is established by the micromechanical procedure. This approach provides access to the local field quantities throughout the constituents, from which initiation of damage in the composite can be predicted. In contrast, a typical macromechanical procedure can determine the effective composite elastic properties in the presence of statistical fiber misalignment, but cannot provide the local fields. Fully random fiber distribution is presented as a special case using the proposed micromechanical method. Results are given that illustrate the effects of various amounts of fiber misalignment in terms of the standard deviations of in-plane and out-of-plane misalignment angles, where normal distributions have been employed. Damage initiation envelopes, local fields, effective moduli, and strengths are predicted for polymer and ceramic matrix composites with given normal distributions of misalignment angles, as well as fully random fiber orientation.

Micromechanical↗

"Spectrally gapped" random walks on networks: a Mean First Passage Time formula

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only input the transition probabilities into the target node. It is derived from the calculation of the average resolvent of a deformed ensemble of random sub-stochastic matrices H=\langle H\rangle +\delta H H = ⟨ H ⟩ + δ H , with \langle H\rangle ⟨ H ⟩ rank- 1 1 and non-negative. The accuracy of the formula depends on the spectral gap of the reduced transition matrix, and it is tested numerically on several instances of (weighted) networks away from the high sparsity regime, with an excellent agreement.

97 MATHEMATICS AND COMPUTING↗

An Empirical State Error Covariance Matrix Orbit Determination Example

State estimation techniques serve effectively to provide mean state estimates. However, the state error covariance matrices provided as part of these techniques suffer from some degree of lack of confidence in their ability to adequately describe the uncertainty in the estimated states. A specific problem with the traditional form of state error covariance matrices is that they represent only a mapping of the assumed observation error characteristics into the state space. Any errors that arise from other sources (environment modeling, precision, etc.) are not directly represented in a traditional, theoretical state error covariance matrix. First, consider that an actual observation contains only measurement error and that an estimated observation contains all other errors, known and unknown. Then it follows that a measurement residual (the difference between expected and observed measurements) contains all errors for that measurement. Therefore, a direct and appropriate inclusion of the actual measurement residuals in the state error covariance matrix of the estimate will result in an empirical state error covariance matrix. This empirical state error covariance matrix will fully include all of the errors in the state estimate. The empirical error covariance matrix is determined from a literal reinterpretation of the equations involved in the weighted least squares estimation algorithm. It is a formally correct, empirical state error covariance matrix obtained through use of the average form of the weighted measurement residual variance performance index rather than the usual total weighted residual form. Based on its formulation, this matrix will contain the total uncertainty in the state estimate, regardless as to the source of the uncertainty and whether the source is anticipated or not. It is expected that the empirical error covariance matrix will give a better, statistical representation of the state error in poorly modeled systems or when sensor performance is suspect. In its most straight forward form, the technique only requires supplemental calculations to be added to existing batch estimation algorithms. In the current problem being studied a truth model making use of gravity with spherical, J2 and J4 terms plus a standard exponential type atmosphere with simple diurnal and random walk components is used. The ability of the empirical state error covariance matrix to account for errors is investigated under four scenarios during orbit estimation. These scenarios are: exact modeling under known measurement errors, exact modeling under corrupted measurement errors, inexact modeling under known measurement errors, and inexact modeling under corrupted measurement errors. For this problem a simple analog of a distributed space surveillance network is used. The sensors in this network make only range measurements and with simple normally distributed measurement errors. The sensors are assumed to have full horizon to horizon viewing at any azimuth. For definiteness, an orbit at the approximate altitude and inclination of the International Space Station is used for the study. The comparison analyses of the data involve only total vectors. No investigation of specific orbital elements is undertaken. The total vector analyses will look at the chisquare values of the error in the difference between the estimated state and the true modeled state using both the empirical and theoretical error covariance matrices for each of scenario.

Frisbee, Joseph H., Jr.↗

FEA-aided investigation of the effective thermal conductivity in a medium with embedded spheres

For multiple applications in nuclear energy, the ability to accurately represent material behavior with a simplified model is important to facilitate practical engineering-scale simulations. Here, we focus on the homogenized thermal response of a medium containing spherical inclusions, similar to a fuel form (compact or pebble) containing (TRISO) particles. A review on effective thermal conductivity (ETC) modeling is performed considering a random distribution of mono-sized spherical inclusions in a continuous matrix, with a primary focus on the analytical models. Finite element simulations are performed to evaluate each analytical model in varying material conditions. The model predictions are compared with the expected results obtained from the finite element predictions in addition to the Wiener and Hashin-Shtrikman bounds. Lastly, we included a practical discussion on the homogenization applied to a TRISO fuel pebble.

42 ENGINEERING↗