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 235 records · Page 13

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↗

High-Performance SiC/SiC Ceramic Composite Systems Developed for 1315 C (2400 F) Engine Components

As structural materials for hot-section components in advanced aerospace and land-based gas turbine engines, silicon carbide (SiC) ceramic matrix composites reinforced by high performance SiC fibers offer a variety of performance advantages over current bill-of-materials, such as nickel-based superalloys. These advantages are based on the SiC/SiC composites displaying higher temperature capability for a given structural load, lower density (approximately 30- to 50-percent metal density), and lower thermal expansion. These properties should, in turn, result in many important engine benefits, such as reduced component cooling air requirements, simpler component design, reduced support structure weight, improved fuel efficiency, reduced emissions, higher blade frequencies, reduced blade clearances, and higher thrust. Under the NASA Ultra-Efficient Engine Technology (UEET) Project, much progress has been made at the NASA Glenn Research Center in identifying and optimizing two highperformance SiC/SiC composite systems. The table compares typical properties of oxide/oxide panels and SiC/SiC panels formed by the random stacking of balanced 0 degrees/90 degrees fabric pieces reinforced by the indicated fiber types. The Glenn SiC/SiC systems A and B (shaded area of the table) were reinforced by the Sylramic-iBN SiC fiber, which was produced at Glenn by thermal treatment of the commercial Sylramic SiC fiber (Dow Corning, Midland, MI; ref. 2). The treatment process (1) removes boron from the Sylramic fiber, thereby improving fiber creep, rupture, and oxidation resistance and (2) allows the boron to react with nitrogen to form a thin in situ grown BN coating on the fiber surface, thereby providing an oxidation-resistant buffer layer between contacting fibers in the fabric and the final composite. The fabric stacks for all SiC/SiC panels were provided to GE Power Systems Composites for chemical vapor infiltration of Glenn designed BN fiber coatings and conventional SiC matrices. Composite panels with system B were heat treated at Glenn, and the pores that remained open were filled by silicon melt infiltration (MI). Panels with system A and the other SiC/SiC systems were not heat treated, and remaining open pores in these systems were filled with SiC slurry and silicon MI.

DiCarlo, James A.↗

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↗

Identifying Entangled Physics Relationships Through Sparse Matrix Decomposition to Inform Plasma Fusion Design

We report a sustainable burn platform through inertial confinement fusion (ICF) has been an ongoing challenge for over 50 years. Mitigating engineering limitations and improving the current design involves an understanding of the complex coupling of physical processes. While sophisticated simulation codes are used to model ICF implosions, these tools contain necessary numerical approximation but miss physical processes that limit predictive capability. Identification of relationships between controllable design inputs to ICF experiments and measurable outcomes (e.g., neutron yield, neutron velocity, areal density) from performed experiments can help guide the future design of experiments and development of simulation codes, to potentially improve the accuracy of the computational models used to simulate ICF experiments. We use sparse matrix decomposition methods to identify clusters of a few related design variables. Sparse principal component analysis (SPCA) identifies groupings that are related to the physical origin of the variables (laser, hohlraum, and capsule). A variable importance analysis finds that in addition to variables highly correlated with neutron yield, such as picket power and laser energy, variables that represent a dramatic change of the ICF design, such as number of pulse steps, are also very important. The obtained sparse components are then used to train a random forest (RF) regression surrogate for predicting total yield. The RF performance on the training and testing data compares with the performance of the RF trained using all the design variables considered. This work is intended to inform design changes in future ICF experiments by augmenting the expert intuition and simulation results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Gamow-Teller Strength in Ca 48 and Ni 78 with the Charge-Exchange Subtracted Second Random-Phase Approximation

Here, we develop a fully self-consistent subtracted second random-phase approximation for charge-exchange processes with Skyrme energy-density functionals. As a first application, we study Gamow-Teller excitations in the doubly magic nucleus 48 Ca, the lightest double-β emitter that could be used in an experiment, and in 78 Ni, the single-beta-decay rate of which is known. The amount of Gamow-Teller strength below 20 or 30 MeV is considerably smaller than in other energy-density-functional calculations and agrees better with experiment in 48 Ca, as does the beta-decay rate in 78 Ni. These important results, obtained without ad hoc quenching factors, are due to the presence of two-particle–two-hole configurations. Their density progressively increases with excitation energy, leading to a long high-energy tail in the spectrum, a fact that may have implications for the computation of nuclear matrix elements for neutrinoless double-β decay in the same framework.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

β -decay half-lives and β -delayed neutron emission probabilities for several isotopes of Au, Hg, Tl, Pb, and Bi, beyond N = 126

Background: There have been measurements on roughly 230 nuclei that are β-delayed neutron emitters. They range from 8 He up to 150 La . Apart from 210 Tl, with a branching ratio of only 0.007%, no other neutron emitter has been measured beyond A = 150 . Therefore, new data are needed, particularly in the region of heavy nuclei around N = 126 , in order to guide theoretical models and help understand the formation of the third r-process peak at A ~ 195. Purpose: To measure both β-decay half-lives and neutron branching ratios of several neutron-rich Au, Hg, Tl, Pb, and Bi isotopes beyond N = 126 . Method: Ions of interest were produced by fragmentation of a 238 U beam, selected and identified via the GSI-FRS fragment separator. A stack of segmented silicon detectors (SIMBA) was used to measure ion implants and β decays. An array of 30 3 He tubes embedded in a polyethylene matrix (BELEN) was used to detect neutrons with high efficiency and selectivity. A self-triggered digital system is employed to acquire data and to enable time correlations. The latter were analyzed with an analytical model and results for the half-lives and neutron-branching ratios were derived by using the binned maximum-likelihood method. Results: Twenty new β-decay half-lives are reported for 204-206 Au, 208 – 211 Hg, 211 – 216 Tl , 215 – 218 Pb, and 218 – 220 Bi, nine of them for the first time. Neutron emission probabilities are reported for 210, 211 Hg and 211 – 216 Tl . Conclusions: The new β-decay half-lives are in good agreement with previous measurements on nuclei in this region. Lastly, the measured neutron emission probabilities are comparable to or smaller than values predicted by global models such as relativistic Hartree Bogoliubov plus the relativistic quasi-particle random phase approximation (RHB + RQRPA).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient Langevin dynamics for “noisy” forces

Efficient Boltzmann-sampling using first-principles methods is challenging for extended systems due to the steep scaling of electronic structure methods with the system size. Additionally, stochastic approaches provide a gentler system-size dependency at the cost of introducing “noisy” forces, which could limit the efficiency of the sampling. When the forces are deterministic, the first-order Langevin dynamics (FOLD) offers efficient sampling by combining a well-chosen preconditioning matrix S with a time-step-bias-mitigating propagator [G. Mazzola and S. Sorella, Phys. Rev. Lett. 118, 015703 (2017)]. However, when forces are noisy, S is set equal to the force-covariance matrix, a procedure that severely limits the efficiency and the stability of the sampling. Here, we develop a new, general, optimal, and stable sampling approach for FOLD under noisy forces. We apply it for silicon nanocrystals treated with stochastic density functional theory and show efficiency improvements by an order-of-magnitude.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum dynamics in strongly driven random dipolar magnets

The random dipolar magnet LiHo x Y 1– x F 4 enters a strongly frustrated regime for small Ho 3+ concentrations with x < 0.05. In this regime, the magnetic moments of the Ho 3+ ions experience small quantum corrections to the common Ising approximation of LiHo x Y 1– x F 4 , which lead to a $\mathbb{Z}_2$-symmetry breaking and small, degeneracy breaking energy shifts between different eigenstates. Here we show that destructive interference between two almost degenerate excitation pathways burns spectral holes in the magnetic susceptibility of strongly driven magnetic moments in LiHo x Y 1– x F 4 . Such spectral holes in the susceptibility, microscopically described in terms of Fano resonances, can already occur in setups of only two or three frustrated moments, for which the driven level scheme has the paradigmatic Λ shape. For larger clusters of magnetic moments, the corresponding level schemes separate into almost isolated many-body Λ schemes, in the sense that either the transition matrix elements between them are negligibly small or the energy difference of the transitions is strongly off-resonant to the drive. This enables the observation of Fano resonances, caused by many-body quantum corrections to the common Ising approximation also in the thermodynamic limit. Finally, we discuss its dependence on the driving strength and frequency as well as the crucial role that is played by lattice dissipation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Further Investigation of Employing Binomial Small-Sample Estimator in M-LROM

Reduced Order Modeling (ROM) is essential to enable the identification of the so-called active parameter subspace for high-fidelity models that are employed in computationally intensive analyses such as uncertainty characterization and data assimilation. Given the complexity of models for real-world application, brute force methods to identify the active subspace may not be computationally efficient to realize the value of reduction, since in realistic problems, the full scale model must be executed few hundred times, which may be computationally taxing. Earlier work has introduced a new approach, which represents a further development of our previous work on ROM, referred to as multi-level ROM (M-LROM). In M-LROM, approximate models are employed to identify the active subspace instead of the full scale model. In this summary, we present our recent results on M-LROM, specifically in regard to the construction of reliable error metrics that can bound the errors resulting from the reduction. The idea is to employ a lower fidelity model, i.e., an approximation of the full scale or high fidelity model, to build the active subspace, and via the proposed error bound, the quality of the active subspace can be determined by calculating an upper bound on the errors resulting from the reduction. For this approach to be practical, the error bound must be realistic, implying that it should be close to the actual errors expected, and not much higher. Therefore, an important goal of this summary is to compare different error bounds in terms of the relation between their estimated bounds to the actual errors. In particular, we compare the proposed error bound which numerically construct an estimator using binomial distribution to the widely used small-sample norm estimators. Unlike most probabilistic error estimation methods, the proposed bound employs a binomial distribution to construct the estimator whereas in other conventional methods, the distribution employed is typically the standard Gaussian, normalized over a unit hypersphere as initially proposed by the seminal paper of J. Dixon on random matrix theory. Previous publications provided evidence that the binomial distribution calculates more realistic bounds as compared to the Gaussian distribution, which tends to be conservative, implying that the bound is much bigger than the actual errors, which diminishes the value of the reduction, as now must increase the size of the active subspace to reach the desired upper bound on the reduction errors. This work has provided a rigorous approach by which error bounds on the reduction errors can be established without having to execute the high fidelity model during the construction of the active subspace. The high fidelity model is only need to test the error bound using small number of executions. This methodology paves the way for a more efficient application of ROM to complex engineering models, where standard ROM techniques may be too taxing to optimally realize their value in practical situations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Machine Learning to Predict Joint Performance in Epoxy Composites Based on Process Parameters

Polymer matrix composites are gaining popularity in the aerospace industry due to their high specific strength, fatigue properties, and processability. However, based on current FAA certification guidelines, manufacturers utilizing current state-of-the-art composites made with adhesive bonds commonly install redundant fasteners to guarantee the strength of these adhesively bonded composite parts. The number of fasteners in a single-aisle commercial transport aircraft is typically on the order of 105, which reduces manufacturing rate, increases cost tremendously, and reduces the advantage of the specific strength composites provide. Due to this, the Adhesive Free Bonding of Composites (AERoBOND) project at NASA Langley Research Center has developed a novel assembly process to manufacture complex composite parts without the use of adhesives and fasteners. However, optimization of the process is currently challenging due to the complex and interdependent process parameters. To assist with the optimization, four machine learning algorithms utilizing gradient boosting decision trees were created to provide predictions for the mechanical and characterization properties of the composite parts. Approximately 200 random states from each algorithm were tested, and the models from each state were isolated and analyzed based on their accuracy, a validation process, and their feature importance. This analysis concluded that the models created from the machine learning algorithms could accelerate a parametric study for the AERoBOND process by rapidly optimizing process parameters to achieve desired performance characteristics.

Brennen Michael Middleton↗

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Machine Learning to Predict Joint Performance in Epoxy Composites Based on Process Parameters

Polymer matrix composites are gaining popularity in the aerospace industry due to their high specific strength, fatigue properties, and processability. However, based on current FAA certification guidelines, manufacturers utilizing current state-of-the art composites made with adhesive bonds commonly install redundant fasteners to guarantee the strength of these adhesively bonded composite parts.1,2 The number of fasteners in a single-aisle commercial transport aircraft is typically on the order of 105, which reduces manufacturing rate, increases cost tremendously, and reduces the advantage of the specific strength composites provide. Due to this, the Adhesive Free Bonding of Composites (AERoBOND) project at NASA Langley Research Center has developed a novel assembly process to manufacture complex composite parts without the use of adhesives and fasteners.1 However, optimization of the process is currently challenging due to the complex and interdependent process parameters. To assist with the optimization, four machine learning algorithms utilizing gradient boosting decision trees were created to provide predictions for the mechanical and characterization properties of the composite parts. Approximately 200 random states from each algorithm were tested, and the models from each state were isolated and analyzed based on their accuracy, a validation process, and their feature importance. This analysis concluded that the models created from the machine learning algorithms could accelerate a parametric study for the AERoBOND process by rapidly optimizing process parameters to achieve desired performance characteristics.

Brennen M Middleton↗