Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse grid”

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 253 records · Page 14

Predicting Missing Regions in Charged Particle Tracks Using a Sparse 3D Convolutional Neural Network

The 2x2 Demonstrator is a prototype detector for the Deep Underground Neutrino Experiment (DUNE)'s Near Detector. Both the 2x2 Demonstrator and the Near Detector itself will have inactive regions wherein there is no sensitivity to charge deposition and light signals that arise from charged particle interactions with liquid argon. In the 2x2, these inactive regions are positioned in-between the active detector modules, which introduces the challenge of inferring what charge signals ought to look like in these regions. This study explores the use of a Sparse 3D Convolutional Neural Network (ConvNet) to infer missing regions in charged particle tracks. Hits corresponding to energy depositions are voxelized into a three-dimensional (3D) grid for each track. Inactive regions within the tracks are replaced with a dense, rectangular 3D grid of voxels, ensuring consistent step sizes in X, Y, and Z directions. Voxels in these dense regions are initialized with an energy value of -1, indicating nonphysical energy or charge. The model is trained to predict which voxels should activate as part of the track and which should not, with the goal of eventually inferring the missing charge or energy values in these voxels. Results indicate that the model accurately predicts track voxels within 1 unit in X, Y, or Z directions and effectively identifies non-track voxels, despite some overprediction. The approach shows promise in prediction of missing track regions with some accuracy.

Utaegbulam, Hilary↗

Application of VISSR Atmospheric Sounder (VAS) data in weather analysis

A technique which analyzes irregularly spaced satellite data is described. An experiment with rawinsonde and VISSR Atmospheric Sounder (VAS) radiance measurements collected on March 6-7, 1982 is conducted to reveal the applicability of the technique. The rawinsonde data are analyzed on a 16 x 12 grid using the two pass analysis scheme of Barnes (1973). A scheme similar to the Barnes (1973) procedure is employed to produce gridded analysis of VAS data over a 200 x 15000 km region in central part of the U.S. The use of a correction pass on the initial gridded field is described; the technique is extremely effective on uniformly spaced observations. The incorporation of the limited fine mesh model to the scheme to analyze data in sparse and cloudy regions is examined. A comparison of rawinsonde data with VAS data is provided. The technique proves effective for studying cloudy and sparse areas with VAS data and produces a four-dimensional data set with significant mesoscale structure.

Jedlovec, G. J.↗

Sparsity-Promoting Optimal Wide-Area Control of Power Networks

Inter-area oscillations in bulk power systems are typically poorly controllable by means of local decentralized control. Recent research efforts have been aimed at developing wide-area control strategies that involve communication of remote signals. In conventional wide-area control, the control structure is fixed a priori typically based on modal criteria. In contrast, here we employ the recently-introduced paradigm of sparsity-promoting optimal control to simultaneously identify the optimal control structure and optimize the closed-loop performance. To induce a sparse control architecture, we regularize the standard quadratic performance index with an ℓ 1 -penalty on the feedback matrix. The quadratic objective functions are inspired by the classic slow coherency theory and are aimed at imitating homogeneous networks without inter-area oscillations. We use the New England power grid model to demonstrate that the proposed combination of the sparsity-promoting control design with the slow coherency objectives performs almost as well as the optimal centralized control while only making use of a single wide-area communication link. In addition to this nominal performance, we also demonstrate that our control strategy yields favorable robustness margins and that it can be used to identify a sparse control architecture for control design via alternative means.

25 ENERGY STORAGE↗

An Analysis of the Published Mineral Resource Estimates of the Haji-Gak Iron Deposit, Afghanistan

The Haji-Gak iron deposit of eastern Bamyan Province, eastern Afghanistan, was studied extensively and resource calculations were made in the 1960s by Afghan and Russian geologists. Recalculation of the resource estimates verifies the original estimates for categories A (in-place resources known in detail), B (in-place resources known in moderate detail), and C{sub 1} (in-place resources estimated on sparse data), totaling 110.8 Mt, or about 6% of the resources as being supportable for the methods used in the 1960s. C{sub 2} (based on a loose exploration grid with little data) resources are based on one ore grade from one drill hole, and P{sub 2} (prognosis) resources are based on field observations, field measurements, and an ore grade derived from averaging grades from three better sampled ore bodies. C{sub 2} and P{sub 2} resources are 1,659.1 Mt or about 94% of the total resources in the deposit. The vast P{sub 2} resources have not been drilled or sampled to confirm their extent or quality. The purpose of this article is to independently evaluate the resources of the Haji-Gak iron deposit by using the available geologic and mineral resource information including geologic maps and cross sections, sampling data, and the analog-estimating techniques of the 1960s to determine the size and tenor of the deposit.

58 GEOSCIENCES↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

MISR Level 2 TOA/Cloud Stereo parameters (MIL2TCST_V1)

The MISR Top-of-Atmosphere (TOA)/Cloud Stereo geophysical parameters include stereoscopically-derived cloud motion vectors (winds), cloud-top heights, and an accompanying cloud mask. The Stereo product geophysical parameters include a stereoscopically-derived cloud mask and cloud height on a 1.1 km grid. It also includes cloud motion vectors on a 70.4 km grid. The three types of stereo heights are: the BestWind heights are only calculated for those regions where the associated wind vectors passed the quality tests. Therefore, they have sparse coverage but since the wind correction is included, these contain our 'best guess' as to what the true heights are. The WithoutWind heights are calculated assuming a constant wind vector of zero. They have almost complete coverage and therefore form a nice 'pretty picture' of the relative cloud heights over small areas. The RawWind heights are a diagnostic product as they are calculated using all available wind vectors (even the bad ones). It is therefore recommended that one only use the Best and Without wind products. It is important to remember that the stereo matchers pick up the layer of maximum contrast, which is not necessarily the same as the highest cloud so all the stereo heights are keyed to this level of maximum contrast. Therefore, higher and thinner cirrus layers may not be detected by any of the height fields. [Location=GLOBAL] [Temporal_Coverage: Start_Date=2000-02-24; Stop_Date=] [Spatial_Coverage: Southernmost_Latitude=-90; Northernmost_Latitude=90; Westernmost_Longitude=-180; Easternmost_Longitude=180] [Data_Resolution: Latitude_Resolution=1.1 km; Longitude_Resolution=1.1 km; Horizontal_Resolution_Range=1 km - < 10 km or approximately .01 degree - < .09 degree; Temporal_Resolution=about 15 orbits/day; Temporal_Resolution_Range=Daily - < Weekly].

EOSDIS↗

MISR Level 2 TOA/Cloud Stereo parameters (MIL2TCST_V2)

The MISR Top-of-Atmosphere (TOA)/Cloud Stereo geophysical parameters include stereoscopically-derived cloud motion vectors (winds), cloud-top heights, and an accompanying cloud mask. The Stereo product geophysical parameters include a stereoscopically-derived cloud mask and cloud height on a 1.1 km grid. It also includes cloud motion vectors on a 70.4 km grid. The three types of stereo heights are: the BestWind heights are only calculated for those regions where the associated wind vectors passed the quality tests. Therefore, they have sparse coverage but since the wind correction is included, these contain our 'best guess' as to what the true heights are. The WithoutWind heights are calculated assuming a constant wind vector of zero. They have almost complete coverage and therefore form a nice 'pretty picture' of the relative cloud heights over small areas. The RawWind heights are a diagnostic product as they are calculated using all available wind vectors (even the bad ones). It is therefore recommended that one only use the Best and Without wind products. It is important to remember that the stereo matchers pick up the layer of maximum contrast, which is not necessarily the same as the highest cloud so all the stereo heights are keyed to this level of maximum contrast. Therefore, higher and thinner cirrus layers may not be detected by any of the height fields. [Temporal_Coverage: Start_Date=2000-02-24; Stop_Date=] [Spatial_Coverage: Southernmost_Latitude=-90; Northernmost_Latitude=90; Westernmost_Longitude=-180; Easternmost_Longitude=180] [Data_Resolution: Latitude_Resolution=1.1 km; Longitude_Resolution=1.1 km; Temporal_Resolution=about 15 orbits/day].

CLOUD MASK↗

Adaptive enhanced sampling by force-biasing using neural networks

A machine learning assisted method is presented for molecular simulation of systems with rugged free energy landscapes. The method is general and can be combined with other advanced sampling techniques. In the particular implementation proposed here, it is illustrated in the context of an adaptive biasing force approach where, rather than relying on discrete force estimates, one can resort to a self-regularizing artificial neural network to generate continuous, estimated generalized forces. By doing so, the proposed approach addresses several shortcomings common to adaptive biasing force and other algorithms. Specifically, the neural network enables smooth estimates of generalized forces in sparsely sampled regions, force estimates in previously unexplored regions, and continuous force estimates with which to bias the simulation, as opposed to biases generated at specific points of a discrete grid. The usefulness of the method is illustrated with three different examples, chosen to highlight the wide range of applicability of the underlying concepts. In all three cases, the new method is found to enhance considerably the underlying traditional adaptive biasing force approach. Furthermore, the method is also found to provide improvements over previous implementations of neural network assisted algorithms.

97 MATHEMATICS AND COMPUTING↗

A GPU-based compressible combustion solver for applications exhibiting disparate space and time scales

High-speed chemically active flows pose significant computational challenges due to their disparate space and time scales, with stiff chemistry often dominating simulation time. While modern scientific computing programs achieve exascale performance by leveraging graphics processing units (GPUs), existing GPU-based compressible combustion solvers face critical limitations in memory management, load balancing, and handling the highly localized nature of chemical reactions. To this end, we present a high-performance compressible reacting flow solver built on the AMReX framework and optimized for multi-GPU settings. Here, our approach addresses three GPU performance bottlenecks: memory access patterns through column-major storage optimization, computational workload variability via a bulk-sparse integration strategy for chemical kinetics, and multi-GPU load distribution for adaptive mesh refinement applications. The solver adapts existing matrix-based chemical kinetics formulations to multi-grid contexts. Using representative combustion applications, including 2D and 3D detonations and a 3D jet-in-crossflow configuration, we demonstrate 1.4–5× performance improvements over initial implementations on an in-house cluster of NVIDIA H100 GPUs, and near-ideal weak scaling on the Frontier supercomputer (Oak Ridge Leadership Computing Facility) with up to 1024 AMD Instinct MI250X GPUs. Roofline analysis reveals substantial improvements in arithmetic intensity for both convection (∼ 10 ×) and chemistry (∼ 4 ×) routines, confirming efficient utilization of GPU memory bandwidth and computational resources.

42 ENGINEERING↗

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism and made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.

97 MATHEMATICS AND COMPUTING↗

Search for evidence of low energy protons in solar flares

We searched for linear polarization in the H alpha line using the Stokes Polarimeter at Mees Solar Observatory and present observations of a flare from NOAA active region 6659 which began at 01:30 UT on 14 Jun. 1991. Our dataset also includes H alpha spectra from the Mees charge coupled device (MCCD) imaging spectrograph as well as hard x ray observations from the Burst and Transient Source Experiment (BATSE) instrument on board the Gamma Ray Observatory (GRO). The polarimeter scanned a 40 x 40 inch field of view using 16 raster points in a 4 x 4 grid. Each scan took about 30 seconds with 2 seconds at each raster point. The polarimeter stopped 8.5 inches between raster points and each point covered a 6 inch region. This sparse sampling increased the total field of view without reducing the temporal cadence. At each raster point, an H alpha spectrum with 20 mA spectral sampling is obtained covering 2.6 A centered on H alpha line center. The preliminary conclusions from the research are presented.

Metcalf, Thomas R.↗

Frequency extrapolation by nonconvex compressive sensing

Tomographic imaging modalities sample subjects with a discrete, finite set of measurements, while the underlying object function is continuous. Because of this, inversion of the imaging model, even under ideal conditions, necessarily entails approximation. The error incurred by this approximation can be important when there is rapid variation in the object function or when the objects of interest are small. In this work, we investigate this issue with the Fourier transform (FT), which can be taken as the imaging model for magnetic resonance imaging (MRl) or some forms of wave imaging. Compressive sensing has been successful for inverting this data model when only a sparse set of samples are available. We apply the compressive sensing principle to a somewhat related problem of frequency extrapolation, where the object function is represented by a super-resolution grid with many more pixels than FT measurements. The image on the super-resolution grid is obtained through nonconvex minimization. The method fully utilizes the available FT samples, while controlling aliasing and ringing. The algorithm is demonstrated with continuous FT samples of the Shepp-Logan phantom with additional small, high-contrast objects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Linearized Functional Minimization for Inverse Modeling

Heterogeneous aquifers typically consist of multiple lithofacies, whose spatial arrangement significantly affects flow and transport. The estimation of these lithofacies is complicated by the scarcity of data and by the lack of a clear correlation between identifiable geologic indicators and attributes. We introduce a new inverse-modeling approach to estimate both the spatial extent of hydrofacies and their properties from sparse measurements of hydraulic conductivity and hydraulic head. Our approach is to minimize a functional defined on the vectors of values of hydraulic conductivity and hydraulic head fields defined on regular grids at a user-determined resolution. This functional is constructed to (i) enforce the relationship between conductivity and heads provided by the groundwater flow equation, (ii) penalize deviations of the reconstructed fields from measurements where they are available, and (iii) penalize reconstructed fields that are not piece-wise smooth. We develop an iterative solver for this functional that exploits a local linearization of the mapping from conductivity to head. This approach provides a computationally efficient algorithm that rapidly converges to a solution. A series of numerical experiments demonstrates the robustness of our approach.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Fast mix table construction for material discretization

An effective hybrid Monte Carlo-deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a 'mix table,' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in O(number of voxels x log number of mixtures) time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation. (authors)

97 MATHEMATICS AND COMPUTING↗

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗

Practical Implementation of GPU-based Computing at the Grid Edge for Resilience Scenarios

This paper presents a practical implementation of GPU-accelerated computing at the grid edge to enhance power system resilience through next-generation smart meters. Advanced Metering Infrastructure (AMI) systems rely predominantly on centralized processing architectures, which limit real-time response capabilities during grid disturbances. This work proposes the integration of GPU-enabled computational platforms directly within smart meter to enable local execution support for power system analytics, fault detection algorithms, and optimization routines. The proposed framework uses the Julia programming language to leverage highperformance parallel computing capabilities while maintaining code portability and development efficiency. We use two experimental scenarios to benchmark the computational feasibility of this approach: sparse linear system solutions representative of power flow analyses, and multi-stage production cost simulations incorporating unit commitment and economic dispatch operations. Results demonstrate that computationally intensive power system algorithms, such as those supporting resilience scenario calculations, can be effectively executed at the distribution edge using commercially available embedded GPU hardware. Keywords—GPU acceleration, edge computing, smart meters, grid resilience, AMI, resilience.

De Souza, Reubun [School of Electrical Engineering↗

Gamma-Ray Point-Source Localization and Sparse Image Reconstruction using Poisson Likelihood

Gamma-ray imaging trys to reconstruct the spatial and intensity distribution of gamma-emitting radionuclides from a set of measurements. Wholly, this problem is solved by discretizing the spatial dimensions and employing the maximum likelihood expectation maximization (ML-EM) algorithm, with or without some form of regularization. While the generality of this formulation enables use in a wide variety of scenarios, it is susceptible to overfitting, limited by the discretization of spatial coordinates, and can be computationally expensive. We present a novel approach to 3D gamma-ray image reconstruction for scenarios where sparsity may be assumed, for example radiological source search. In this work we first formulate a point-source localization (PSL) approach as an optimization problem where both position and source intensity are continuous variables. We then extend and generalize this formulation to an iterative algorithm called additive point-source localization (APSL) for sparse parametric image reconstruction. A set of simulated source search scenarios using a single non-directional detector are considered, finding improved image accuracy and computational efficiency with APSL over traditional grid-based methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Surface Passivation and Carrier Collection in {110}, {100} and Circular Si Microwire Solar Cells

Surface recombination is a major bottleneck for realizing highly efficient micro/nanostructure solar cells. Parametric studies of the influence of Si microwire (SiMW) surface-facet orientation (rectangular with flat-facets, {110}, {100} and circular), with a fixed height of 10 µm, diameter (D = 1.5–9.5 µm), and sidewall spacing (S = 2.5–8.5 µm), and mesh-grid density (1–16 mm -2 ) on recombination and carrier collection in SiMW solar cells with radial p-n junctions are reported. An effective surface passivation layer composed of thin thermally grown silicon dioxide (SiO 2 ) and silicon nitride (SiN x ) layers is employed. For a fixed D of 1.5 µm, tight SiMW spacing results in improved short-circuit current density (J sc = 30.1 mA cm -2 ) and sparse arrays result in open-circuit voltages (V oc = 0.552 V) that are similar to those of control Si planar cells. For a fixed S, smaller D results in better light trapping at shorter wavelengths and higher J sc while larger D exhibits better light trapping at larger wavelengths and a higher V oc . With a mesh-grid electrode the power conversion efficiency increases to 15.3%. Finally, these results provide insights on the recombination mechanisms in SiMW solar cells and provide general design principles for optimizing their performance.

14 SOLAR ENERGY↗