Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparsity”

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 145 records · Page 8

Use of FLOSIC for understanding anion-solvent interactions

An Achille’s heel of lower-rung density-functional approximations is that the highest-occupied-molecular-orbital energy levels of anions, known to be stable or metastable in nature, are often found to be positive in the worst case or above the lowest-unoccupied-molecular-orbital levels on neighboring complexes that are not expected to accept charge. A trianionic example, [Cr(C2O4)3]3−, is of interest for constraining models linking Cr isotope ratios in rock samples to oxygen levels in Earth’s atmosphere over geological timescales. Here we describe how crowd sourcing can be used to carry out self-consistent Fermi–Löwdin–Orbital-Self-Interaction corrected calculations (FLOSIC) on this trianion in solution. The calculations give a physically correct description of the electronic structure of the trianion and water. In contrast, uncorrected local density approximation (LDA) calculations result in approximately half of the anion charge being transferred to the water bath due to the effects of self-interaction error. Use of group-theory and the intrinsic sparsity of the theory enables calculations roughly 125 times faster than our initial implementation in the large N limit reached here. By integrating charge density densities and Coulomb potentials over regions of space and analyzing core-level shifts of the Cr and O atoms as a function of position and functional, we unambiguously show that FLOSIC, relative to LDA, reverses incorrect solute-solvent charge transfer in the trianion-water complex. In comparison to other functionals investigated herein, including Hartree–Fock and the local density approximation, the FLOSIC Cr 1s eigenvalues provide the best agreement with experimental core ionization energies.

Chemistry↗

Data-driven prediction of scaling and ignition of inertial confinement fusion experiments

Recent advances in inertial confinement fusion (ICF) at the National Ignition Facility (NIF), including ignition and energy gain, are enabled by a close coupling between experiments and high-fidelity simulations. Neither simulations nor experiments can fully constrain the behavior of ICF implosions on their own, meaning pre- and postshot simulation studies must incorporate experimental data to be reliable. Linking past data with simulations to make predictions for upcoming designs and quantifying the uncertainty in those predictions has been an ongoing challenge in ICF research. We have developed a data-driven approach to prediction and uncertainty quantification that combines large ensembles of simulations with Bayesian inference and deep learning. The approach builds a predictive model for the statistical distribution of key performance parameters, which is jointly informed by past experiments and physics simulations. The prediction distribution captures the impact of experimental uncertainty, expert priors, design changes, and shot-to-shot variations. We have used this new capability to predict a 10× increase in ignition probability between Hybrid-E shots driven with 2.05 MJ compared to 1.9 MJ, and validated our predictions against subsequent experiments. We describe our new Bayesian postshot and prediction capabilities, discuss their application to NIF ignition and validate the results, and finally investigate the impact of data sparsity on our prediction results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Polariton spectra under the collective coupling regime. I. Efficient simulation of linear spectra and quantum dynamics

We outline two general theoretical techniques to simulate polariton quantum dynamics and optical spectra under the collective coupling regimes described by a Holstein–Tavis–Cummings (HTC) model Hamiltonian. The first one takes advantage of sparsity of the HTC Hamiltonian, which allows one to reduce the cost of acting polariton Hamiltonian onto a state vector to the linear order of the number of states, instead of the quadratic order. The second one is applying the well-known Chebyshev series expansion approach for quantum dynamics propagation and to simulate the polariton dynamics in the HTC system; this approach allows us to use a much larger time step for propagation and only requires a few recursive operations of the polariton Hamiltonian acting on state vectors. These two theoretical approaches are general and can be applied to any trajectory-based non-adiabatic quantum dynamics methods. We apply these two techniques with our previously developed Lindblad-partially linearized density matrix approach to simulate the linear absorption spectra of the HTC model system, with both inhomogeneous site energy disorders and dipolar orientational disorders. Our numerical results agree well with the previous analytic and numerical work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Codiscovering graphical structure and functional relationships within data: A Gaussian Process framework for connecting the dots

Most problems within and beyond the scientific domain can be framed into one of the following three levels of complexity of function approximation. Type 1: Approximate an unknown function given input/output data. Type 2: Consider a collection of variables and functions, some of which are unknown, indexed by the nodes and hyperedges of a hypergraph (a generalized graph where edges can connect more than two vertices). Given partial observations of the variables of the hypergraph (satisfying the functional dependencies imposed by its structure), approximate all the unobserved variables and unknown functions. Type 3: Expanding on Type 2, if the hypergraph structure itself is unknown, use partial observations of the variables of the hypergraph to discover its structure and approximate its unknown functions. These hypergraphs offer a natural platform for organizing, communicating, and processing computational knowledge. While most scientific problems can be framed as the data-driven discovery of unknown functions in a computational hypergraph whose structure is known (Type 2), many require the data-driven discovery of the structure (connectivity) of the hypergraph itself (Type 3). We introduce an interpretable Gaussian Process (GP) framework for such (Type 3) problems that does not require randomization of the data, access to or control over its sampling, or sparsity of the unknown functions in a known or learned basis. Its polynomial complexity, which contrasts sharply with the super-exponential complexity of causal inference methods, is enabled by the nonlinear ANOVA capabilities of GPs used as a sensing mechanism.

Science & Technology - Other Topics↗

The cosine-sine decomposition with different-orbitals-for-different-spins determinants

We report the spin decomposition of a spin-contaminated different-orbitals-for-different-spins (DODS) wave function is formulated in terms of the Krylov space of the $\hat{S}^2$ ||operator. The number of determinants that contribute to the various projected spin eigenfunctions vertical | $\psi ; S, M \rangle$ depends on the sparsity of the orbital overlap matrix X between the α and β spatial orbitals. The cosine-sine decomposition (CSD) procedure may be applied to this overlap matrix, and the resulting redundant orbital transformations may be applied to the α and β spatial orbitals. This produces a sparse X' matrix in the transformed basis in which each row or column has either one or two nonzero elements. This sparse X' matrix simplifies the spin-decomposition procedure in three ways:1) it reduces the number of contributing determinants within the Krylov basis functions and within the projected spin functions, 2) it reduces the effective orbital dimension through elimination of the frozen core and frozen virtual orbitals, and 3) it simplifies the spin-decomposition procedure in both the original and transformed bases by limiting the Krylov space dimension. These simplifications all reduce the computational effort for the spin-decomposition process. This procedure is implemented within a string-based DODS determinant formulation and applied to spin projection of unrestricted Hartree-Fock determinants.

unrestricted Hartree-Fock↗

Selection of a Pair of Experiments to Optimally Reduce Uncertainty in Targeted Nuclear Data

We propose a novel process to select a pair of differential and integral experiments that best reduce uncertainties in targeted 239 ⁢Pu nuclear data while compressing the current nuclear data pipeline from 20 to 3 years. 239⁢ Pu nuclear data are poorly understood for neutrons in the intermediate energy range due to sparsity and uncertainty in historical experiments. New experiments targeting this range will enable better understanding of these nuclear data, but choosing the ideal experiments to conduct is challenging. Beginning with a prior distribution represented by samples of nuclear data generated from theory, generalized least squares adjustments are made to incorporate data from historical experiments. To quantify potential uncertainty reduction obtainable from a pair of candidate experiments, we compute the D-optimality criterion of the posterior covariance of intermediate energy range nuclear data compared to the equivalent covariance after additional adjustment to the pair of candidate experiments. Repeating the process for each of many candidate pairs facilitates the final selection. Results support 63⁢ Cu total cross section measurements for differential experiments and alumina and alumina/graphite configurations for integral experiments. This analysis enables choosing differential and integral experiments to be executed concurrently while shortening decision times relative to the current nuclear data pipeline.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Many-isocenter optimization for robotic radiotherapy

Despite significant dosimetric gains, clinical implementation of the 4π non-coplanar radiotherapy on the widely available C-arm gantry system is hindered by limited clearance, and the need to perform complex coordinated gantry and couch motion. A robotic radiotherapy platform would be conducive to such treatment but a new conflict between field size and MLC modulation resolution needs to be managed for versatile applications. This study investigates the dosimetry and delivery efficiency of purposefully creating many isocenters to achieve simultaneously high MLC modulation resolution and large tumor coverage. An integrated optimization framework was proposed for simultaneous beam orientation optimization (BOO), isocenter selection, and fluence map optimization (FMO). The framework includes a least-square dose fidelity objective, a total variation term for regularizing the fluence smoothness, and a group sparsity term for beam selection. A minimal number of isocenters were identified for efficient target coverage. Colliding beams excluded, high-resolution small-field 4π intensity-modulated radiotherapy (IMRT) treatment plans with 50 cm source-to-isocenter distance (SID-50) on 10 Head and Neck (H&N) cancer patients were compared with low-resolution large-field plans with 100 cm SID (SID-100). With the same or better target coverage, the average reduction of [Dmean, Dmax] of 20-beam SID-50 plans from 20-beam SID-100 plans were [2.09 Gy, 1.19 Gy] for organs at risk (OARs) overall, [3.05 Gy, 0.04 Gy] for parotid gland, [3.62 Gy, 5.19 Gy] for larynx, and [3.27 Gy, 1.10 Gy] for mandible. R50 and integral dose were reduced by 5.3% and 9.6%, respectively. Wilcoxon signed-rank test showed significant difference (p < 0.05) in planning target volume (PTV) homogeneity, PTV Dmax, R50, Integral dose, and OAR Dmean and Dmax. The estimated delivery time of 20-beam [SID-50, SID-100] plans were [19, 18] min and [14, 9] min, assuming 5 fractions and 30 fractions, respectively. Finally, with clinically acceptable delivery efficiency, many-isocenter optimization is dosimetrically desirable for treating large targets with high modulation resolution on the robotic platform.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Astrophysics & cosmology from line intensity mapping vs galaxy surveys

Line intensity mapping (LIM) proposes to efficiently observe distant faint galaxies and map the matter density field at high redshift. Building upon the formalism in a companion paper, we first highlight the degeneracies between cosmology and astrophysics in LIM. We discuss what can be constrained from measurements of the mean intensity and redshift-space power spectra. With a sufficient spectral resolution, the large-scale redshift-space distortions of the 2-halo term can be measured, helping to break the degeneracy between bias and mean intensity. With a higher spectral resolution, measuring the small-scale redshift-space distortions disentangles the 1-halo and shot noise terms. Additionally, cross-correlations with external galaxy catalogs or lensing surveys further break degeneracies. We derive requirements for experiments similar to SPHEREx, HETDEX, CDIM, COMAP and CONCERTO. We then revisit the question of the optimality of the LIM observables, compared to galaxy detection, for astrophysics and cosmology. We use a matched filter to compute the luminosity detection threshold for individual sources. We show that LIM contains information about galaxies too faint to detect, in the high-noise or high-confusion regimes. We quantify the sparsity and clustering bias of the detected sources and compare them to LIM, showing in which cases LIM is a better tracer of the matter density. We extend previous work by answering these questions as a function of Fourier scale, including for the first time the effect of cosmic variance, pixel-to-pixel correlations, luminosity-dependent clustering bias and redshift-space distortions.

79 ASTRONOMY AND ASTROPHYSICS↗

MONKES: a fast neoclassical code for the evaluation of monoenergetic transport coefficients in stellarator plasmas

Abstract MONKES is a new neoclassical code for the evaluation of monoenergetic transport coefficients in stellarators. By means of a convergence study and benchmarks with other codes, it is shown that MONKES is accurate and efficient. The combination of spectral discretization in spatial and velocity coordinates with block sparsity allows MONKES to compute monoenergetic coefficients at low collisionality, in a single core, in approximately one minute. MONKES is sufficiently fast to be integrated into stellarator optimization codes for direct optimization of the bootstrap current and to be included in predictive transport suites. The code and data from this paper are available at https://github.com/JavierEscoto/MONKES/ .

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Global stellarator coil optimization with quadratic constraints and objectives

Most present stellarator designs are produced by costly two-stage optimization: the first for an optimized equilibrium, and the second for a coil design reproducing its magnetic configuration. Few proxies for coil complexity and forces exist at the equilibrium stage. Rapid initial state finding for both stages is a topic of active research. Most present convex coil optimization codes use the least square winding surface method by Merkel (NESCOIL), with recent improvements in conditioning, regularization, sparsity, and physics objectives. While elegant, the method is limited to modeling the norms of linear functions in coil current. We present QUADCOIL, a global coil optimization method that targets combinations of linear and quadratic functions of the current. It can directly constrain and/or minimize a wide range of physics objectives unavailable in NESCOIL and REGCOIL, including the Lorentz force, magnetic energy, curvature, field-current alignment, and the maximum density of a dipole array. QUADCOIL requires no initial guess and runs nearly $10$ 2 x faster than filament optimization. Integrating it in the equilibrium optimization stage can potentially exclude equilibria with difficult-to-design coils, without significantly increasing the computation time per iteration. QUADCOIL finds the exact, global minimum in a large parameter space when possible, and otherwise finds a well-performing approximate global minimum. It supports most regularization techniques developed for NESCOIL and REGCOIL. We demonstrate QUADCOIL’s effectiveness in coil topology control, minimizing non-convex penalties, and predicting filament coil complexity with three numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Neutrino event selection in the MicroBooNE liquid argon time projection chamber using Wire-Cell 3D imaging, clustering, and charge-light matching

An accurate and efficient event reconstruction is required to realize the full scientific capability of liquid argon time projection chambers (LArTPCs). The current and future neutrino experiments that rely on massive LArTPCs create a need for new ideas and reconstruction approaches. Wire-Cell, proposed in recent years, is a novel tomographic event reconstruction method for LArTPCs. The Wire-Cell 3D imaging approach capitalizes on charge, sparsity, time, and geometry information to reconstruct a topology-agnostic 3D image of the ionization electrons prior to pattern recognition. A second novel method, the many-to-many charge-light matching, then pairs the TPC charge activity to the detected scintillation light signal, thus enabling a powerful rejection of cosmic-ray muons in the MicroBooNE detector. A robust processing of the scintillation light signal and an appropriate clustering of the reconstructed 3D image are fundamental to this technique. In this paper, we describe the principles and algorithms of these techniques and their successful application in the MicroBooNE experiment. A quantitative evaluation of the performance of these techniques is presented. Using these techniques, a 95% efficient pre-selection of neutrino charged-current events is achieved with a 30-fold reduction of non-beam-coincident cosmic-ray muons, and about 80% of the selected neutrino charged-current events are reconstructed with at least 70% completeness and 80% purity.

3D imaging↗

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Models and Methods for Sparse (Hyper)Network Science in Business, Industry, and Government

The authors are hosting an AMS sponsored Mathematics Research Community (MRC) focusing on two themes that have garnered intense attention in network models of complex relational data: (1) how to faithfully model multi-way relations in hypergraphs, rather than only pairwise interactions in graphs; and (2) challenges posed by modelling networks with extreme sparsity. Here we introduce and explore these two themes and their challenges. In this work, we hope to generate interest from researchers in pure and applied mathematics and computer science.

97 MATHEMATICS AND COMPUTING↗

spammR: an R package designed for analysis and integration of spatial multi-omic measurements

Spatial omics is a young and evolving field and as such shows rapid development of novel technologies and analysis methods to measure transcripts, proteins, metabolites, and post-translational modifications at high spatial resolution. These advances in technology have enabled the simultaneous generation of abundance profiles for multiple different omics types and associated microscopy imaging data, as well as their analysis in a spatial context. However, most analytical tools are designed for spatial transcriptomics platforms and are challenging to use in other contexts such as mass spectrometry-based measurements or metagenomics. To this end we present spammR (spatial analysis of multi-omics measurements in R), an R package that enables end-to-end analysis with a specific focus on mass-spectrometry derived spatial omics datasets with (1) smaller sample sizes and spatial sparsity of samples, (2) considerable missingness, and (3) no a-priori knowledge about proteins or genes of interest, relying on a fully data-driven approach.

spammR↗

Poisson hurdle model-based method for clustering microbiome features

Abstract Motivation High-throughput sequencing technologies have greatly facilitated microbiome research and have generated a large volume of microbiome data with the potential to answer key questions regarding microbiome assembly, structure and function. Cluster analysis aims to group features that behave similarly across treatments, and such grouping helps to highlight the functional relationships among features and may provide biological insights into microbiome networks. However, clustering microbiome data are challenging due to the sparsity and high dimensionality. Results We propose a model-based clustering method based on Poisson hurdle models for sparse microbiome count data. We describe an expectation–maximization algorithm and a modified version using simulated annealing to conduct the cluster analysis. Moreover, we provide algorithms for initialization and choosing the number of clusters. Simulation results demonstrate that our proposed methods provide better clustering results than alternative methods under a variety of settings. We also apply the proposed method to a sorghum rhizosphere microbiome dataset that results in interesting biological findings. Availability and implementation R package is freely available for download at https://cran.r-project.org/package=PHclust. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗

Non-asymptotic analysis of ensemble Kalman updates: effective dimension and localization

Many modern algorithms for inverse problems and data assimilation rely on ensemble Kalman updates to blend prior predictions with observed data. Ensemble Kalman methods often perform well with a small ensemble size, which is essential in applications where generating each particle is costly. This paper develops a non-asymptotic analysis of ensemble Kalman updates, which rigorously explains why a small ensemble size suffices if the prior covariance has moderate effective dimension due to fast spectrum decay or approximate sparsity. Here, we present our theory in a unified framework, comparing everal implementations of ensemble Kalman updates that use perturbed observations, square root filtering and localization. As part of our analysis, we develop new dimension-free covariance estimation bounds for approximately sparse matrices that may be of independent interest.

Mathematics↗

The 4D Camera: An 87 kHz Direct Electron Detector for Scanning/Transmission Electron Microscopy

We describe the development, operation, and application of the 4D Camera—a 576 by 576 pixel active pixel sensor for scanning/transmission electron microscopy which operates at 87,000 Hz. The detector generates data at ~480 Gbit/s which is captured by dedicated receiver computers with a parallelized software infrastructure that has been implemented to process the resulting 10–700 Gigabyte-sized raw datasets. The back illuminated detector provides the ability to detect single electron events at accelerating voltages from 30 to 300 kV. Through electron counting, the resulting sparse data sets are reduced in size by 10--300× compared to the raw data, and open-source sparsity-based processing algorithms offer rapid data analysis. The high frame rate allows for large and complex scanning diffraction experiments to be accomplished with typical scanning transmission electron microscopy scanning parameters.

47 OTHER INSTRUMENTATION↗

Dark Energy Survey Year 3 results: Curved-sky weak lensing mass map reconstruction

ABSTRACT We present reconstructed convergence maps, mass maps, from the Dark Energy Survey (DES) third year (Y3) weak gravitational lensing data set. The mass maps are weighted projections of the density field (primarily dark matter) in the foreground of the observed galaxies. We use four reconstruction methods, each is a maximum a posteriori estimate with a different model for the prior probability of the map: Kaiser–Squires, null B-mode prior, Gaussian prior, and a sparsity prior. All methods are implemented on the celestial sphere to accommodate the large sky coverage of the DES Y3 data. We compare the methods using realistic ΛCDM simulations with mock data that are closely matched to the DES Y3 data. We quantify the performance of the methods at the map level and then apply the reconstruction methods to the DES Y3 data, performing tests for systematic error effects. The maps are compared with optical foreground cosmic-web structures and are used to evaluate the lensing signal from cosmic-void profiles. The recovered dark matter map covers the largest sky fraction of any galaxy weak lensing map to date.

79 ASTRONOMY AND ASTROPHYSICS↗