Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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 271 records · Page 15

High-speed mapping of surface charge dynamics using sparse scanning Kelvin probe force microscopy

Unraveling local dynamic charge processes is vital for progress in diverse fields, from microelectronics to energy storage. This relies on the ability to map charge carrier motion across multiple length- and timescales and understanding how these processes interact with the inherent material heterogeneities. Towards addressing this challenge, we introduce high-speed sparse scanning Kelvin probe force microscopy, which combines sparse scanning and image reconstruction. This approach is shown to enable sub-second imaging (>3 frames per second) of nanoscale charge dynamics, representing several orders of magnitude improvement over traditional Kelvin probe force microscopy imaging rates. Bridging this improved spatiotemporal resolution with macroscale device measurements, we successfully visualize electrochemically mediated diffusion of mobile surface ions on a LaAlO 3 /SrTiO 3 planar device. Such processes are known to impact band-alignment and charge-transfer dynamics at these heterointerfaces. Furthermore, we monitor the diffusion of oxygen vacancies at the single grain level in polycrystalline TiO 2 . Through temperature-dependent measurements, we identify a charge diffusion activation energy of 0.18 eV, in good agreement with previously reported values and confirmed by DFT calculations. Together, these findings highlight the effectiveness and versatility of our method in understanding ionic charge carrier motion in microelectronics or nanoscale material systems.

25 ENERGY STORAGE↗

Learning turbulent flows with generative models for super resolution and sparse flow reconstruction

Neural operators are promising surrogates for dynamical systems but when trained with standard L 2 losses they tend to oversmooth fine-scale turbulent structures. Here, we show that combining operator learning with generative modeling overcomes this limitation. We consider three practical turbulent-flow challenges where conventional neural operators fail: spatio-temporal super-resolution, forecasting, and sparse flow reconstruction. For Schlieren jet super-resolution, an adversarially trained neural operator (adv-NO) reduces the energy-spectrum error by 15 × while preserving sharp gradients at neural operator-like inference cost. For 3D homogeneous isotropic turbulence, adv-NO trained on only 160 timesteps from a single trajectory forecasts accurately for five eddy-turnover times and offers 114 × wall-clock speed-up at inference than the baseline diffusion-based forecasters, enabling near-real-time rollouts. For reconstructing cylinder wake flows from highly sparse Particle Tracking Velocimetry-like inputs, a conditional generative model infers full 3D velocity and pressure fields with correct phase alignment and statistics. These advances enable accurate reconstruction and forecasting at low compute cost, bringing near-real-time analysis and control within reach in experimental and computational fluid mechanics.

Fluid dynamics↗

Hybrid Li-air battery cathodes with sparse carbon nanotube arrays directly grown on carbon fiber papers

Sparsely populated, vertically aligned nitrogen doped carbon nanotube arrays (CNTAs) with dislocated-graphene stacking were grown directly on carbon fiber papers and investigated as hierarchical air cathodes in hybrid Li-air batteries with aqueous catholytes. The CNTAs were made with electrodeposited Ni nanocatalysts, followed by plasma-enhanced chemical vapor deposition. The thus obtained CNTAs can reach a population number density as low as similar to 10(7) per cm(2) on the carbon fibers, achieving an extremely high porosity of over 99% for the active layer in the cathode. The sparse CNTAs not only provide effective pathways for the reacting species, but also show a significantly high catalytic activity, which is found to be comparable to that of a supported Pt electrocatalyst. The high activity of the CNTAs is attributed to the rich graphene edges exposed on the CNT surface and nitrogen doping. Hybrid Li-air batteries with such cathodes have shown a consistent discharging capacity of 710 mA h g(-1) and a specific energy of 2057 W h kg(-1) at 0.5 mA cm(-2). Stable charge-discharge cycling at 0.5 mA cm(-2) showed an average potential difference of 1.35 V, indicative of a relatively small overpotential and high round trip efficiency (71%). Furthermore, the hybrid Li-air battery based on the hierarchical cathode can reach a power density as high as 10.4 mW cm(-2).

Li, YF↗

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. II. Linear scaling domain based pair natural orbital coupled cluster theory

Domain based local pair natural orbital coupled cluster theory with single-, double-, and perturbative triple excitations (DLPNO-CCSD(T)) is a highly efficient local correlation method. It is known to be accurate and robust and can be used in a black box fashion in order to obtain coupled cluster quality total energies for large molecules with several hundred atoms. While previous implementations showed near linear scaling up to a few hundred atoms, several nonlinear scaling steps limited the applicability of the method for very large systems. In this work, these limitations are overcome and a linear scaling DLPNO-CCSD(T) method for closed shell systems is reported. The new implementation is based on the concept of sparse maps that was introduced in Part I of this series [P. Pinski, C. Riplinger, E. F. Valeev, and F. Neese, J. Chem. Phys. 143, 034108 (2015)]. Using the sparse map infrastructure, all essential computational steps (integral transformation and storage, initial guess, pair natural orbital construction, amplitude iterations, triples correction) are achieved in a linear scaling fashion. In addition, a number of additional algorithmic improvements are reported that lead to significant speedups of the method. The new, linear-scaling DLPNO-CCSD(T) implementation typically is 7 times faster than the previous implementation and consumes 4 times less disk space for large three-dimensional systems. For linear systems, the performance gains and memory savings are substantially larger. Calculations with more than 20 000 basis functions and 1000 atoms are reported in this work. In all cases, the time required for the coupled cluster step is comparable to or lower than for the preceding Hartree-Fock calculation, even if this is carried out with the efficient resolution-of-the-identity and chain-of-spheres approximations. The new implementation even reduces the error in absolute correlation energies by about a factor of two, compared to the already accurate previous implementation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DETECTABILITY OF TRANSITING JUPITERS AND LOW-MASS ECLIPSING BINARIES IN SPARSELY SAMPLED PAN-STARRS-1 SURVEY DATA

We present detailed simulations of the Pan-STARRS-1 (PS1) multi-epoch, multiband 3pi Survey in order to assess its potential yield of transiting planets and eclipsing binaries. This survey differs from dedicated transit surveys in that it will cover the entire northern sky but provide only sparsely sampled light curves. Since most eclipses would be detected at only a single epoch, the 3pi Survey will be most sensitive to deep eclipses (approx>0.10 mag) caused by Jupiters transiting M dwarfs and eclipsing stellar/substellar binaries. The survey will measure parallaxes for the approx4 x 10{sup 5} stars within 100 pc, which will enable a volume-limited eclipse search, reducing the number of astrophysical false positives compared with previous magnitude-limited searches. Using the best available empirical data, we constructed a model of the extended solar neighborhood that includes stars, brown dwarfs, and a realistic binary population. We computed the yield of deeply eclipsing systems using both a semianalytic and a full Monte Carlo approach. We examined statistical tests for detecting single-epoch eclipses in sparsely sampled data and assessed their vulnerability to false positives due to stellar variability. Assuming a short-period planet frequency of 0.5% for M dwarfs, our simulations predict that about a dozen transiting Jupiters around low-mass stars (M {sub *} < 0.3 M {sub sun}) within 100 pc are potentially detectable in the PS1 3pi Survey, along with approx300 low-mass eclipsing binaries (both component masses <0.5 M {sub sun}), including approx10 eclipsing field brown dwarfs. Extensive follow-up observations would be required to characterize these candidate eclipsing systems, thereby enabling comprehensive tests of structural models and novel insights into the planetary architecture of low-mass stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Restoring the discontinuous heat equation source using sparse boundary data and dynamic sensors

Abstract This study focuses on addressing the inverse source problem associated with the parabolic equation. We rely on sparse boundary flux data as our measurements, which are acquired from a restricted section of the boundary. While it has been established that utilizing sparse boundary flux data can enable source recovery, the presence of a limited number of observation sensors poses a challenge for accurately tracing the inverse quantity of interest. To overcome this limitation, we introduce a sampling algorithm grounded in Langevin dynamics that incorporates dynamic sensors to capture the flux information. Furthermore, we propose and discuss two distinct dynamic sensor migration strategies. Remarkably, our findings demonstrate that even with only two observation sensors at our disposal, it remains feasible to successfully reconstruct the high-dimensional unknown parameters.

Mathematics↗

Sparse inpainting and isotropy

Sparse inpainting techniques are gaining in popularity as a tool for cosmological data analysis, in particular for handling data which present masked regions and missing observations. We investigate here the relationship between sparse inpainting techniques using the spherical harmonic basis as a dictionary and the isotropy properties of cosmological maps, as for instance those arising from cosmic microwave background (CMB) experiments. In particular, we investigate the possibility that inpainted maps may exhibit anisotropies in the behaviour of higher-order angular polyspectra. We provide analytic computations and simulations of inpainted maps for a Gaussian isotropic model of CMB data, suggesting that the resulting angular trispectrum may exhibit small but non-negligible deviations from isotropy.

79 ASTRONOMY AND ASTROPHYSICS↗

Sparse-Sensor Placement for Wind Farm Control

The objective of this paper is to incorporate sparse sensor data to improve flow-field estimates in a wind farm, which can then be used to perform better online wind farm optimization and control. A sparse-sensing algorithm is used to determine the optimal locations of sensors to improve the overall estimation precision of the flow field within the wind farm. This algorithm takes advantage of the dominant atmospheric structures in a wind farm to reconstruct the flow field from point measurements in the field. These measurements, in their optimal locations, have the ability to improve the observability of a wind farm and thus provide faster, more accurate, state estimation.

17 WIND ENERGY↗

Sparse Convolutional Neural Networks for particle classification in ProtoDUNE-SP events

Deep Learning (DL) methods and Computer Vision are becoming important tools for event reconstruction in particle physics detectors. In this work, we report on the use of submanifold sparse convolutional neural networks (SparseNets) for the classification of track and shower hits from a DUNE prototype liquid-argon detector at CERN (ProtoDUNE-SP). By taking advantage of the three-dimensional nature of the problem we use a set of nine input features to classify sparse and locally dense hits associated to track or shower particles. The SparseNet has been trained on a test sample and shows promising results: efficiencies and purities greater than 90%. This has also been achieved with a considerable speedup and substantially less resource utilization with respect to other DL networks such as graph neural networks. This method offers great scalability advantages for future large neutrino detectors such as the planned DUNE experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Kinetics of diffusion-controlled annihilation with sparse initial conditions

Here, we study diffusion-controlled single-species annihilation with sparse initial conditions. In this random process, particles undergo Brownian motion, and when two particles meet, both disappear. We also focus on sparse initial conditions where particles occupy a subspace of dimension δ that is embedded in a larger space of dimension d. Furthermore, we find that the co-dimension Δ = d - δ governs the behavior. All particles disappear when the co-dimension is sufficiently small, Δ ≤ 2; otherwise, a finite fraction of particles indefinitely survive. We establish the asymptotic behavior of the probability S(t) that a test particle survives until time t. When the subspace is a line, δ = 1, we find inverse logarithmic decay, $S\sim {(\mathrm{ln}t)}^{-1}$, in three dimensions, and a modified power-law decay, $S\sim (\mathrm{ln}t){t}^{-1/2}$, in two dimensions. In general, the survival probability decays algebraically when Δ < 2, and there is an inverse logarithmic decay at the critical co-dimension Δ = 2.

97 MATHEMATICS AND COMPUTING↗

Suppressing simulation bias in multi-modal data using transfer learning

Abstract Many problems in science and engineering require making predictions based on few observations. To build a robust predictive model, these sparse data may need to be augmented with simulated data, especially when the design space is multi-dimensional. Simulations, however, often suffer from an inherent bias. Estimation of this bias may be poorly constrained not only because of data sparsity, but also because traditional predictive models fit only one type of observed outputs, such as scalars or images, instead of all available output data modalities, which might have been acquired and simulated at great cost. To break this limitation and open up the path for multi-modal calibration, we propose to combine a novel, transfer learning technique for suppressing the bias with recent developments in deep learning, which allow building predictive models with multi-modal outputs. First, we train an initial neural network model on simulated data to learn important correlations between different output modalities and between simulation inputs and outputs. Then, the model is partially retrained, or transfer learned, to fit the experiments; a method that has never been implemented in this type of architecture. Using fewer than 10 inertial confinement fusion experiments for training, transfer learning systematically improves the simulation predictions while a simple output calibration, which we design as a baseline, makes the predictions worse. We also offer extensive cross-validation with real and carefully designed synthetic data. The method described in this paper can be applied to a wide range of problems that require transferring knowledge from simulations to the domain of experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Inferring demographic and selective histories from population genomic data using a 2-step approach in species with coding-sparse genomes: an application to human data

Abstract The demographic history of a population, and the distribution of fitness effects (DFE) of newly arising mutations in functional genomic regions, are fundamental factors dictating both genetic variation and evolutionary trajectories. Although both demographic and DFE inference has been performed extensively in humans, these approaches have generally either been limited to simple demographic models involving a single population, or, where a complex population history has been inferred, without accounting for the potentially confounding effects of selection at linked sites. Taking advantage of the coding-sparse nature of the genome, we propose a 2-step approach in which coalescent simulations are first used to infer a complex multi-population demographic model, utilizing large non-functional regions that are likely free from the effects of background selection. We then use forward-in-time simulations to perform DFE inference in functional regions, conditional on the complex demography inferred and utilizing expected background selection effects in the estimation procedure. Throughout, recombination and mutation rate maps were used to account for the underlying empirical rate heterogeneity across the human genome. Importantly, within this framework it is possible to utilize and fit multiple aspects of the data, and this inference scheme represents a generalized approach for such large-scale inference in species with coding-sparse genomes.

Soni, Vivak (ORCID:0000000294969562)↗

Sparse Bayesian mass mapping with uncertainties: local credible intervals

ABSTRACT Until recently, mass-mapping techniques for weak gravitational lensing convergence reconstruction have lacked a principled statistical framework upon which to quantify reconstruction uncertainties, without making strong assumptions of Gaussianity. In previous work, we presented a sparse hierarchical Bayesian formalism for convergence reconstruction that addresses this shortcoming. Here, we draw on the concept of local credible intervals (cf. Bayesian error bars) as an extension of the uncertainty quantification techniques previously detailed. These uncertainty quantification techniques are benchmarked against those recovered via Px-MALA – a state-of-the-art proximal Markov chain Monte Carlo (MCMC) algorithm. We find that, typically, our recovered uncertainties are everywhere conservative (never underestimate the uncertainty, yet the approximation error is bounded above), of similar magnitude and highly correlated with those recovered via Px-MALA. Moreover, we demonstrate an increase in computational efficiency of $\mathcal {O}(10^6)$ when using our sparse Bayesian approach over MCMC techniques. This computational saving is critical for the application of Bayesian uncertainty quantification to large-scale stage IV surveys such as LSST and Euclid.

Price, M. A.↗

Efficient quantum circuits for arbitrary sparse unitaries

Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row or column, and these entries are efficiently computable. One can formulate a model of computation based on the composition of sparse unitaries which includes the quantum Turing machine model, the quantum circuit model, anyonic models, permutational quantum computation, and discrete time quantum walks as special cases. Thus, we obtain a simple unified proof that these models are all contained in BQP. Furthermore, our general method for implementing sparse unitaries simplifies several existing quantum algorithms.

97 MATHEMATICS AND COMPUTING↗

Communication-efficient Distributed Solutions to a System of Linear Equations with Laplacian Sparse Structure

Two communication-efficient distributed algorithms are proposed to solve a system of linear equations Ax = b with Laplacian sparse A. A system of linear equations with Laplacian sparse A can be found in many applications, e.g., the power flow problems and other network flow problems. The first algorithm is based on the gradient descent method in optimization and the agents only share two parts of the system state instead of that of the whole system state, which saves significant communication. The two parts shared by every agent through a communication link are the state information of its own and its neighbors connected by the communication link. The second method is obtained from an approximation of the Newton method, which converges faster. It requires twice as much communication as the first one but is still communicationefficient due to the low dimension of each part shared between agents. The convergence at a linear rate of both methods is proved. A comprehensive comparison of the convergence rate, communication burden, and computation costs between the methods is made. Finally, a simulation is conducted to show the effectiveness of both methods.

Wang, Peng↗

TeaLeaf: A Mini-Application to Enable Design-Space Explorations for Iterative Sparse Linear Solvers

Iterative sparse linear solvers are an important class of algorithm in high performance computing, and form a crucial component of many scientific codes. As intra and inter node parallelism continues to increase rapidly, the design of new, scalable solvers which can target next generation architectures becomes increasingly important. In this work we present TeaLeaf, a recent mini-app constructed to explore design space choices for highly scalable solvers. We then use TeaLeaf to compare the standard CG algorithm with a Chebyshev Polynomially Preconditioned Conjugate Gradient (CPPCG) iterative sparse linear solver. CPPCG is a communication-avoiding algorithm, requiring less global communication than previous approaches. TeaLeaf includes support for many-core processors, such as GPUs and Xeon Phi, and we include strong-scaling results across a range of world-leading Petascale supercomputers, including Titan and Piz Daint.

97 MATHEMATICS AND COMPUTING↗

Sparse Multi-Static Arrays for Near-Field Millimeter-Wave Imaging

This paper describes a novel design technique for sparse multi-static linear arrays. The methods described allow the development of densely sampled linear arrays suitable for high-resolution near-field imaging that require dramatically fewer antenna and switch elements than the previous state of the art. The techniques used are related to sparse array techniques used in radio astronomy applications, but differ significantly in design due to the transmit-receive nature of the arrays, and the application to linear arrays that achieve dense uniform sampling suitable for high-resolution near-field imaging. As many as 3 to 5 or more samples per antenna can be obtained, compared to 1 sample per antenna for the current state of the art. This could dramatically reduce cost and improve performance over current active millimeter-wave imaging systems.

Millimeter waves, imaging, personnel screening, co↗

Sparse Deep Neural Network Inference using different Programming Models

Sparse deep neural networks have gained increasing attention recently in achieving speedups on inference with reduced memory footprints. However, the real-world applications are little shown with specialized optimizations, yet a wide variety of DNN tasks remain dense without exploiting the advantages of sparsity in networks. Recent work presented by MIT/IEEE/Amazon GraphChallenge has demonstrated significant speedups and various techniques. Still, we find that there is limited investigation of the impact of various Python and C\slash C++ based programming models to explore new opportunities in general cases. In this work, we provide performance evaluation through different programming models using CuPy, cuSPARSE, and OpenMP to discuss the advantages and disadvantages of our sparse implementations on single-GPU and multiple GPUs of NVIDIA DGX-A100 40GB/80GB platforms.

machine learning, HPC↗