Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized matrix approximation”

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

Pre-conditioned BFGS-based uncertainty quantification in elastic full-waveform inversion

SUMMARY Full-waveform inversion has become an essential technique for mapping geophysical subsurface structures. However, proper uncertainty quantification is often lacking in current applications. In theory, uncertainty quantification is related to the inverse Hessian (or the posterior covariance matrix). Even for common geophysical inverse problems its calculation is beyond the computational and storage capacities of the largest high-performance computing systems. In this study, we amend the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to perform uncertainty quantification for large-scale applications. For seismic inverse problems, the limited-memory BFGS (L-BFGS) method prevails as the most efficient quasi-Newton method. We aim to augment it further to obtain an approximate inverse Hessian for uncertainty quantification in FWI. To facilitate retrieval of the inverse Hessian, we combine BFGS (essentially a full-history L-BFGS) with randomized singular value decomposition to determine a low-rank approximation of the inverse Hessian. Setting the rank number equal to the number of iterations makes this solution efficient and memory-affordable even for large-scale problems. Furthermore, based on the Gauss–Newton method, we formulate different initial, diagonal Hessian matrices as pre-conditioners for the inverse scheme and compare their performances in elastic FWI applications. We highlight our approach with the elastic Marmousi benchmark model, demonstrating the applicability of pre-conditioned BFGS for large-scale FWI and uncertainty quantification.

58 GEOSCIENCES↗

Cooper minima in high-Z atoms: effects of correlation and relativity on np photoionization

Abstract Photoionization dipole transition matrix elements pass through a zero or attain a minimum that leaves imprints on photoionization parameters like the cross-section, angular distribution asymmetry parameter, phase shift, and photoionization time delay. This minimum is commonly known as the ‘Cooper minimum’ (CM). The CM, in general, is strongly affected by relativistic and correlation effects. Previous works investigated CM in the 6pand 5psubshell photoionization up toZ= 100 using the single-particle Dirac-Slater (DS) method. The present work extends the earlier work toZup to 120 using more accurate methods; Dirac–Hartree–Fock (DHF) which includes the relativistic effects and exchange correlations, and the relativistic random phase approximation (RRPA) which includes both initial and final state electron-electron correlations along with relativistic effects. In addition to the study of photoionization from the 6pand 5psubshells, the 4psubshell has also been investigated in the present work. To demonstrate the prominent effects in the high-Z atoms, Rn (Z= 86), Ra (Z= 88), No (Z= 102), Cn (Z = 112), Og (Z= 118), and Ubn (Z= 120) are investigated.

Optics↗

Microstructure and hardness evolution induced by annealing of ion irradiated LiTaO 3

We report the evolution of the microstructure and mechanical properties of low-energy heavy-ion-irradiated LiTaO 3 crystals annealed at various temperatures was investigated by transmission electron microscopy (TEM) observations and nanoindentation tests to extend the applications of irradiated LiTaO 3 crystals. Before annealing, randomly distributed voids formed in an approximately 200 nm thick region at the end of the ion irradiation range, which was attributed to preferential absorption of interstitials by the amorphous-crystalline interface. After annealing, a new directional diffusion path of defects was identified, resulting in a void string. Furthermore, void string diffusion to the free surface was also found during the annealing temperature increase process, which offers a potential application in designing custom sized-thickness exfoliation at the nanoscale. Meanwhile, two competing processes were identified during the annealing process: epitaxial recrystallization from the amorphous-crystalline interface and grain nucleation process in the amorphous region, which formed phases different from the matrix crystal structure, resulting in an interaction between them. Furthermore, the hardness of irradiated samples was also found to be affected by the annealing process; in particular, a hardness decrease induced by the interstitial Fe ions in the recrystallized region was also confirmed, which can improve the processability of samples for further application.

36 MATERIALS SCIENCE↗

Charge spectroscopy of SiO{sub 2} layers with embedded silicon nanocrystals modified by irradiation with high-energy ions

The method of charge deep-level transient spectroscopy (Q-DLTS) is used to study and compare the ejection of charge carriers from silicon nanocrystals (NCs) located in an ordered or random way in the SiO{sub 2} matrix. It is shown that, in all cases, this ejection is a thermally activated process. The parameters of energy barriers characterizing the processes of ejection of charge carriers from the levels of nanocrystals in the layers NCs:SiO{sub 2} before (random distribution) and after their modification by irradiation with high-energy ions (ordered distribution of nanocrystals) are determined. It is found that the activation energies for ejection of charge carriers from nanocrystals and the size of nanocrystals estimated from the difference between energies of two levels observed by the Q-DLTS method decrease as the ion fluence is increased. The density of nanocrystals observed by the Q-DLTS method decreases by approximately an order of magnitude as a result of irradiation with fluence of 10{sup 12}-10{sup 13} cm{sup -2} in comparison with an initial unirradiated structure; this decrease is due to formation of conducting chains of nanocrystals in tracks.

36 MATERIALS SCIENCE↗

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗

Post-Fracturing Experiment Simulation of Hydraulic Fracture Propagation in a Deep Mine Using a Fully Coupled 3D Network-Flow and Quasi-static Discrete Element Model

Aimed at supporting the hydraulic fracturing experiments in a vertical borehole in the Poorman phyllite at approximately 1500 m depth at the Sanford Underground Research Facility (SURF), we perform post-hydraulic fracturing experiment simulations and compare the simulated borehole pressure changes and flow rates with actual measurements using a newly developed fully coupled three-dimensional (3D) network flow and quasi-static discrete element model (DEM). The quasi-static DEM model, which is constructed by Delaunay tessellation of the rock volume, considers rock fabric heterogeneities by using the “disordered” DEM mesh and adding random perturbations to the stiffness and tensile/shear strengths of individual DEM elements and the elastic beam between them. A conjugate 3D flow network based on DEM lattice is constructed to calculate the fluid flow in both the fracture and porous matrix. One distinctive advantage of the DEM model is that fracturing is naturally described by the breakage of elastic beams between DEM elements. It is also extremely convenient to introduce mechanical anisotropy into the model by simply assigning orientation-dependent tensile/shear strengths to the elastic beams.

15 GEOTHERMAL ENERGY↗

Correlation functions from a unified variational principle: Trial Lie groups

Time-dependent expectation values and correlation functions for many-body quantum systems are evaluated by means of a unified variational principle. It optimizes a generating functional depending on sources associated with the observables of interest. It is built by imposing through Lagrange multipliers constraints that account for the initial state (at equilibrium or off equilibrium) and for the backward Heisenberg evolution of the observables. The trial objects are respectively akin to a density operator and to an operator involving the observables of interest and the sources. We work out here the case where trial spaces constitute Lie groups. This choice reduces the original degrees of freedom to those of the underlying Lie algebra, consisting of simple observables; the resulting objects are labeled by the indices of a basis of this algebra. Explicit results are obtained by expanding in powers of the sources. Zeroth and first orders provide thermodynamic quantities and expectation values in the form of mean-field approximations, with dynamical equations having a classical Lie–Poisson structure. At second order, the variational expression for two-time correlation functions separates–as does its exact counterpart–the approximate dynamics of the observables from the approximate correlations in the initial state. Two building blocks are involved: (i) a commutation matrix which stems from the structure constants of the Lie algebra; and (ii) the second-derivative matrix of a free-energy function. The diagonalization of both matrices, required for practical calculations, is worked out, in a way analogous to the standard RPA. The ensuing structure of the variational formulae is the same as for a system of non-interacting bosons (or of harmonic oscillators) plus, at non-zero temperature, classical Gaussian variables. This property is explained by mapping the original Lie algebra onto a simpler Lie algebra. The results, valid for any trial Lie group, fulfill consistency properties and encompass several special cases: linear responses, static and time-dependent fluctuations, zero- and high-temperature limits, static and dynamic stability of small deviations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Eigenstate thermalization in ( 2 + 1 )-dimensional SU(2) lattice gauge theory

We present preliminary numerical evidence for the hypothesis that the Hamiltonian SU(2) gauge theory discretized on a lattice obeys the eigenstate thermalization hypothesis (ETH). To do so we study three approximations: (a) a linear plaquette chain in a reduced Hilbert space limiting the electric field basis to j = 0 , 1 2 , (b) a two-dimensional honeycomb lattice with periodic or closed boundary condition and the same Hilbert space constraint, and (c) a chain of only three plaquettes but such a sufficiently large electric field Hilbert space ( j ≤ 7 2 ) that convergence of all energy eigenvalues in the analyzed energy window is observed. While an unconstrained Hilbert space is required to reach the continuum limit of SU(2) gauge theory, numerical resource constraints do not permit us to realize this requirement for all values of the coupling constant and large lattices. In each of the three studied cases we check first for random matrix theory (RMT) behavior in the eigenenergy spectrum and then analyze the diagonal as well as the off-diagonal matrix elements between energy eigenstates for a few operators. Within current uncertainties all results for (a), (b) and (c) agree with ETH predictions. Furthermore, we find the off-diagonal matrix elements of the electric energy operator exhibit RMT behavior in frequency windows that are small enough in (b) and (c). To unambiguously establish ETH behavior and determine for which class of operators it applies, an extension of our investigations is necessary. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION 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↗

Uncertainty quantification in (α,n) neutron source calculations for an oxide matrix

Here we present a methodology to propagate nuclear data covariance information in neutron source calculations from (α,n) reactions. The approach is applied to estimate the uncertainty in the neutron generation rates for uranium oxide fuel types due to uncertainties on 1) 17,18 O( α,n) reaction cross sections and 2) uranium and oxygen stopping power cross sections. The procedure to generate reaction cross section covariance information is based on the Bayesian fitting method implemented in the R-matrix SAMMY code. The evaluation methodology uses the Reich-Moore approximation to fit the 17,18 O(α,n) reaction cross-sections in order to derive a set of resonance parameters and a related covariance matrix that is then used to calculate the energydependent cross section covariance matrix. The stopping power cross sections and related covariance information for uranium and oxygen were obtained by the fit of stopping power data in the -energy range of 1 keV up to 12 MeV. Cross section perturbation factors based on the covariance information relative to the evaluated 17,18 O( α,n) reaction cross sections, as well as uranium and oxygen stopping power cross sections, were used to generate a varied set of nuclear data libraries used in SOURCES4C and ORIGEN for inventory and source term calculations. The set of randomly perturbed output (α,n) source responses, provide the mean values and standard deviations of the calculated responses reflecting the uncertainties in nuclear data used in the calculations. Lastly, the results and related uncertainties are compared with experiment thick target (α,n) yields for uranium oxide.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Validation of the DESI 2024 Lyα forest BAO analysis using synthetic datasets

The first year of data from the Dark Energy Spectroscopic Instrument (DESI) contains the largest set of Lyman-α (Lyα) forest spectra ever observed. This data, collected in the DESI Data Release 1 (DR1) sample, has been used to measure the Baryon Acoustic Oscillation (BAO) feature at redshift z = 2.33. In this work, we use a set of 150 synthetic realizations of DESI DR1 to validate the DESI 2024 Lyα forest BAO measurement presented in [1]. The synthetic data sets are based on Gaussian random fields using the log-normal approximation. We produce realistic synthetic DESI spectra that include all major contaminants affecting the Lyα forest. The synthetic data sets span a redshift range 1.8 < z < 3.8, and are analyzed using the same framework and pipeline used for the DESI 2024 Lyα forest BAO measurement. To measure BAO, we use both the Lyα auto-correlation and its cross-correlation with quasar positions. We use the mean of correlation functions from the set of DESI DR1 realizations to show that our model is able to recover unbiased measurements of the BAO position. We also fit each mock individually and study the population of BAO fits in order to validate BAO uncertainties and test our method for estimating the covariance matrix of the Lyα forest correlation functions. Finally, we discuss the implications of our results and identify the needs for the next generation of Lyα forest synthetic data sets, with the top priority being to simulate the effect of BAO broadening due to non-linear evolution.

79 ASTRONOMY AND ASTROPHYSICS↗

Operator Relaxation and the Optimal Depth of Classical Shadows

Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via “shallow shadows,” a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. Here we show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing (“twirling”) circuit—namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t~log⁡(k), guarantees an exponential gain in sample complexity over the t=0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigating microstructure evolution in block copolymer membranes

Block copolymer self-assembly in conjunction with nonsolvent-induced phase separation (SNIPS) has been increasingly leveraged to fabricate integral-asymmetric membranes. The large number of formulation and processing parameters associated with SNIPS, however, has prevented the reliable construction of high performance membranes. In this study, we apply dynamical self-consistent field theory to model the SNIPS process and investigate the effect of various parameters on the membrane morphology: solvent selectivity, nonsolvent selectivity, initial film composition, and glass transition composition. We examine how solvent selectivity and concentration of polymers in the film impact the structure of micelles that connect to form the membrane matrix. In particular, we find that preserving the order in the surface layer and forming a connection between the supporting and surface layer are nontrivial and sensitive to each parameter studied. Furthermore, the effect of each parameter is discussed, and suggestions are made for successfully fabricating viable block copolymer membranes.

36 MATERIALS SCIENCE↗

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↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantification of uncertainties in thermoelectric properties of materials from a first-principles prediction method: An approach based on Gaussian process regression

We present the electron-phonon averaged via Gaussian process regression (EPA-GPR) method, in which the electron-phonon coupling matrix is represented as a function of two energies and is in turn modeled as a Gaussian process. The EPA-GPR method can be used as an efficient method to estimate thermoelectric properties of materials for fast-screening applications, comparable to the original electron-phonon averaged (EPA) method and the electron-phonon averaged via moving-least-squares (EPA-MLS) method. The EPA-GPR method does not require specification of any open parameter, unlike the other EPA-related methods, since all the hyperparameters in the model can be unambiguously estimated within the type II maximum likelihood (ML-II) approximation. Thus, the EPA-GPR method is a parameter-free estimation method. Additionally, the concept of Gaussian processes in the EPA-GPR method allows us to quantify the uncertainty in estimated properties of thermoelectric materials. One can randomly realize the electron-phonon coupling coefficients from the identified Gaussian process, and those realized samples can be further analyzed in the solution process of the semiclassical Boltzmann transport equation for charge carriers. The results of the semiclassical Boltzmann transport equation provide the statistical properties of the thermoelectric properties of interest. The means, standard deviations, histograms, and confidence intervals of the Seebeck coefficient, the electrical conductivity, and the power factor can be constructed and analyzed. Furthermore the proposed EPA-GPR method is applied to a p-type half-Heusler compound, i.e., HfCoSb, as a case example, the results of which clearly present the advantages of the method.

30 DIRECT ENERGY CONVERSION↗

A graphics processing unit accelerated sparse direct solver and preconditioner with block low rank compression

We present the GPU implementation efforts and challenges of the sparse solver package STRUMPACK. The code is made publicly available on github with a permissive BSD license. STRUMPACK implements an approximate multifrontal solver, a sparse LU factorization which makes use of compression methods to accelerate time to solution and reduce memory usage. Multiple compression schemes based on rank-structured and hierarchical matrix approximations are supported, including hierarchically semi-separable, hierarchically off-diagonal butterfly, and block low rank. Here, in this paper, we present the GPU implementation of the block low rank (BLR) compression method within a multifrontal solver. Our GPU implementation relies on highly optimized vendor libraries such as cuBLAS and cuSOLVER for NVIDIA GPUs, rocBLAS and rocSOLVER for AMD GPUs and the Intel oneAPI Math Kernel Library (oneMKL) for Intel GPUs. Additionally, we rely on external open source libraries such as SLATE (Software for Linear Algebra Targeting Exascale), MAGMA (Matrix Algebra on GPU and Multi-core Architectures), and KBLAS (KAUST BLAS). SLATE is used as a GPU-capable ScaLAPACK replacement. From MAGMA we use variable sized batched dense linear algebra operations such as GEMM, TRSM and LU with partial pivoting. KBLAS provides efficient (batched) low rank matrix compression for NVIDIA GPUs using an adaptive randomized sampling scheme. The resulting sparse solver and preconditioner runs on NVIDIA, AMD and Intel GPUs. Interfaces are available from PETSc, Trilinos and MFEM, or the solver can be used directly in user code. We report results for a range of benchmark applications, using the Perlmutter system from NERSC, Frontier from ORNL, and Aurora from ALCF. For a high frequency wave equation on a regular mesh, using 32 Perlmutter compute nodes, the factorization phase of the exact GPU solver is about 6.5× faster compared to the CPU-only solver. The BLR-enabled GPU solver is about 13.8× faster than the CPU exact solver. For a collection of SuiteSparse matrices, the STRUMPACK exact factorization on a single GPU is on average 1.9× faster than NVIDIA’s cuDSS solver.

97 MATHEMATICS AND COMPUTING↗