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 361 records · Page 20

The phonon-coupling model for Skyrme forces

A short review on the self-consistent RPA based on the energy-density functional of the Skyrme type is given. We also present an extension of the RPA where the coupling of phonons to the single-particle states is considered. Within this approach we present numerical results which are compared with data. The self-consistent approach is compared with the Landau–Migdal theory. Here we derive from the self-consistent ph interaction, the Landau–Migdal parameters as well as their density dependence. In the Appendix a new derivation of the reduced matrix elements of the ph interaction is presented.

74 ATOMIC AND MOLECULAR PHYSICS↗

Revisiting Statistical Aspects of Nuclear Material Accounting

Nuclear material accounting (NMA) is the only safeguards system whose benefits are routinely quantified. Process monitoring (PM) is another safeguards system that is increasingly used, and one challenge is how to quantify its benefit. This paper considers PM in the role of enabling frequent NMA, which is referred to as near-real-time accounting (NRTA). We quantify NRTA benefits using period-driven and data-driven testing. Period-driven testing makes a decision to alarm or not at fixed periods. Data-driven testing decides as the data arrives whether to alarm or continue testing. The difference between period-driven and datad-riven viewpoints is illustrated by using one-year and two-year periods. For both one-year and two-year periods, period-driven NMA using once-per-year cumulative material unaccounted for (CUMUF) testing is compared to more frequent Shewhart and joint sequential cusum testing using either MUF or standardized, independently transformed MUF (SITMUF) data. We show that the data-driven viewpoint is appropriate for NRTA and that it can be used to compare safeguards effectiveness. In addition to providing period-driven and data-driven viewpoints, new features include assessing the impact of uncertainty in the estimated covariance matrix of the MUF sequence and the impact of both random and systematic measurement errors.

Burr, T.↗

Computation of graph hitting time moments; Chapel code implementation.

The project that developed this is unclassified, with the mandate to produce open source code. This code computes the hitting time moments of a graph using a linear algebra configuration. The goal of this work is to explore the performance capabilities of the Chapel programming language. Toward that end, we generate random adjacency matrices which represent a random graph. The code can also read in an adjacency matrix from a file. The main computation is the Conjugate Gradient method.SAND2020-12651 M. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Barrett, Richard↗

Asymptotic Behavior of Memristive Circuits

The interest in memristors has risen due to their possible application both as memory units and as computational devices in combination with CMOS. This is in part due to their nonlinear dynamics, and a strong dependence on the circuit topology. We provide evidence that also purely memristive circuits can be employed for computational purposes. In the present paper we show that a polynomial Lyapunov function in the memory parameters exists for the case of DC controlled memristors. Such a Lyapunov function can be asymptotically approximated with binary variables, and mapped to quadratic combinatorial optimization problems. This also shows a direct parallel between memristive circuits and the Hopfield-Little model. In the case of Erdos-Renyi random circuits, we show numerically that the distribution of the matrix elements of the projectors can be roughly approximated with a Gaussian distribution, and that it scales with the inverse square root of the number of elements. This provides an approximated but direct connection with the physics of disordered system and, in particular, of mean field spin glasses. Using this and the fact that the interaction is controlled by a projector operator on the loop space of the circuit. We estimate the number of stationary points of the approximate Lyapunov function and provide a scaling formula as an upper bound in terms of the circuit topology only.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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

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↗

Analytical homogenization techniques applied to the Fickian diffusion: Effective diffusivity coefficient

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. In this work, we focus on the homogenized thermal response of a medium containing spherical inclusions, similar to a fuel form (compact or pebble) containing TRISO particles. An extensive survey on effective thermal conductivity modeling was performed in our previous study, considering a random distribution of mono-sized spherical inclusions in a continuous matrix. Using the analogy between heat conduction and the simplified Fickian diffusion (or fission product species conservation), we can use the same analytical homogenization methods to obtain ETC as for the effective diffusivity coefficient (EDC). We performed several numerical experiments at varying conditions to assess the validity of our hypothesis for EDC calculations.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

The role of 3D microenvironmental organization in MCF-7 epithelial–mesenchymal transition after 7 culture days

We present a multi-technique study on in vitro epithelial–mesenchymal transition (EMT) in human MCF-7 cells cultured on electrospun scaffolds of poly(L-lactic acid) (PLA), with random and aligned fiber orientations. Our aim is to investigate the morphological and genetic characteristics induced by extracellular matrix in tumor cells cultured in different 3D environments, and at different time points. Cell vitality was assessed with AlamarBlue at days 1, 3, 5 and 7. Scanning electron microscopy was performed at culture days 3 and 7. Immunohistochemistry (for E-cadherin, β-catenin, cytokeratins, nucleophosmin, tubulin, Ki-67 and vimentin), immunofluorescence (for F-actin) western blot (for E-cadherin, β-catenin and vimentin) and transmission electron microscopy were carried out at day 7. An EMT gene array followed by PCR analysis confirmed the regulation of selected genes. At day 7, scanning electron microscopy on aligned-PLA revealed spindle-shaped cells gathered in buds and ribbon-like structures, with a higher nucleolar/nuclear ratio and a loss in E-cadherin and β-catenin at immunohistochemistry and western blot. An up-regulation of SMAD2, TGF-β2, TFPI2 and SOX10 was found in aligned-PLA compared to random-PLA cultured cells. The topography of the extracellular matrix has a role in tumor EMT, and a more aggressive phenotype characterizes MCF-7 cells cultured on aligned-PLA scaffold. -- Highlights: • After 7 culture days an aligned-PLA scaffold induces a spindle shape to MCF-7 cells. • Despite these changes, the aligned MCF-7 cells keep an epithelial phenotype. • The extracellular environment alone influences the E-cadherin/β-catenin axis. • The extracellular environment can promote the epithelial–mesenchymal transition.

60 APPLIED LIFE SCIENCES↗