SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 811 records · Page 45

All sources NASA NTRS DOE OSTI

NASA NTRSDate not supplied

Compressive Sensing Based Data Acquisition Architecture for Transient Stellar Events in Crowded Star Fields

Compressive sensing is a mathematical technique for simultaneous data acquisition and compression. In this work, we show a CS based architecture for acquiring and reconstructing transient stellar events. This architecture recon-structs a differenced image itself, eliminating the need for any sparse domain transforms, otherwise required for traditional CS reconstruction. The resulting reconstructed differenced image is of critical importance as the information required for generating a time-series photometric light curve is obtained only from a differenced image. Hence, reconstructing a crowded star spatial image, followed by differencing is wasteful. This architecture eliminates the need to 1.) transform an image to a sparse domain, 2.) Reconstruct a dense field, and then apply differencing on the image to obtain the image of critical value. We study the case of microlensing to depict a star source experiencing magnification in time. Our results show that this architecture is able to reconstruct star source magnitudes with magnification factors greater than 1 for clean images with error less than 2% using only 10% of the Nyquist rate samples.

Compressive Sensing, Data acquisition, Image diffe↗

NASA NTRSDate not supplied

Compressive Sensing Based Data Acquisition Architecture for Transient Stellar Events in Crowded Star Fields

Asmita Korde-patel↗

NASA NTRS2020

Recommendations for Using Noise Monitors to Estimate Noise Exposure During X-59 Community Tests

A low fidelity simulation approach is used to explore how to place and use noise monitors during X-59 QueSST community tests, where people’s annoyance to the noise produced by the X-59 aircraft will be gathered. Several recommendations are provided including: 1) the desired number of sparsely spaced noise monitor sites within the survey area, 2) whether to group and average measurements across multiple noise monitors located at a site, 3) what spacing should be used if grouped noise monitors are used, 4) an approach to mitigate ambient noise contamination at the measurement sites, 5) a method to combine empirical and predicted dose estimates to provide a single dose estimate for respondents, and 6) assessing how changes in turbulence intensity and array configuration affect dose uncertainty. To make these recommendations, the error that is expected when fitting contrived, smoothly varying sonic boom “reference exposure surfaces” is studied when a spatially sparse and scattered set of samples is used as responses for the fit. The reference exposure surfaces mimic the sonic boom exposure at ground level that might be expected in the X-59 survey area in the absence of atmospheric turbulence, ambient noise, and other localized effects. The spatial extent of these surfaces varies and is representative of the different survey area sizes that might be expected during future X-59 community overflight tests. These contrived reference surfaces are sampled, and those reference samples are then perturbed to mimic atmospheric turbulence, ambient noise and other localized effects that might affect noise monitor measurements within overflown communities. Two different surface fitting methods are investigated when fitting these perturbed samples to approximate the reference surface. The first method uses interpolation between the perturbed data at the scattered sites to compute the fit. The second method fits a polynomial surface model to the perturbed data using ordinary least squares regression analysis. For both fitting methods, the root mean square fit error is computed from the pointwise difference between the fit surface and the reference surface as the count and configuration of the sites is varied while also averaging the error across many different realizations of both the smooth variation of the reference exposure surface and the random, localized perturbations at the sample sites. Different site configurations are compared using this error statistic to make the recommendations noted above. Additionally, the two fitting approaches (interpolation vs linear regression) are compared based on the fit error observed in these simulations. These analyses, comparisons, and recommendations should inform future decisions on the noise monitor placement and the methods used to analyze the noise monitor data that is collected during X-59 community overflights.

sonic boom↗

NASA NTRS2002

Bench top interferometric test bed for LISA

Adaptive optics systems with Shack-Hartmann wavefront sensors require reconstruction of the atmospheric phase error from slope measurements, with every sensor in the array being used in the computation of each actuator command. This fully populated reconstruction matrix can result in a significant computational burden for adaptive optics systems with large numbers of actuators. A method for generating sparse wavefront reconstruction matrices for adaptive optics is proposed. The method exploits the relevance of nearby slope measurements for control of an individual actuator, and relies upon the limited extent of the influence function for a zonal deformable mirror. Relying only on nearby sensor information can significantly reduce the calculation time for wavefront reconstruction. In addition, a hierarchic controller is proposed to recover some of the global wavefront information. The performance of these sparse wavefront reconstruction matrices was evaluated in simulation, and tested on the Palomar Adaptive Optics System. This paper will present some initial results from the simulations and experiments.

LISA↗

NASA NTRSDate not supplied

Performance Optimization Methods for a Memory-Bound, Unstructured-Grid CFD Application on Massively Parallel GPU Platforms

Computational performance of the FUN3D unstructured-grid computational fluid dynamics (CFD) application on massively parallel GPU environments is memory-bound and highly dependent upon efficient reads from and atomic updates to the irregular cell-, edge-, and node-based data structures. In this talk, we present recent efforts into optimizing select performance-critical kernels on NVIDIA Tesla V100 and A100 GPUs and AMD CDNA MI100 GPUs. A novel use of L2 cache residency controls and asynchronous loads into on-chip shared memory are explored on the A100 GPU for the sparse iterative solver, which is dominated by mixed-precision, sparse matrix vector multiplication. Demonstrations show that these methods improve global memory bandwidth utilization by 13.5% on the A100 GPU. Several techniques are also presented that use registers and/or shared memory to facilitate array transposition and aggregation which combine to reduce the frequency and increase the cache efficiency of floating-point atomic updates to the irregular data structures. These methods are demonstrated to improve the kernel throughput by nearly 500% on select kernels on the AMD MI100 over atomic updates directly to global memory. Overall, both V100 and A100 GPUs outperformed the MI100 GPU on kernels dominated by double-precision atomic updates; however, the techniques demonstrated here reduced the performance gap and improved the MI100 performance.

GPU CPU unstructured CFD memory↗

NASA NTRS2022

Design of Materials with Alchemite

Machine learning models that establish the relationships between materials processing and properties can enable inverse design of materials through active learning. Alchemite is a commercial software that can perform inverse materials design on sparse data. Here we evaluate Alchemite’s performance on a dataset of shape memory alloys and a dataset of heat exchangers compared to baseline random forest models. Alchemite had higher accuracy when making predictions on sparse data and was more accurate or nearly as accurate as random forests on complete datasets while also quantifying uncertainty. The software was also used to suggest processing steps and design parameters to optimize properties and performance; however, physical validation of the suggested design parameters was beyond the scope of this work. Several useful design insights were gained about the impact of the design parameters on properties and performance including the importance of dopant choice and amount for shape memory alloys and the importance of height and weight on the thermal resistance of heat exchangers.

Machine learning↗

DOE OSTI2020

Reinforcement-based Program Induction in a Neural Virtual Machine

We present a neural virtual machine that can be trained to perform algorithmic tasks. Rather than combining a neural controller with non-neural memory storage as has been done in the past, this architecture is purely neural and emulates tape-based memory via fast associative weights (onestep learning). Here we formally define the architecture, and then extend the system to learn programs using recurrent policy gradient reinforcement learning based on examples of program inputs labeled with corresponding output targets, which are compared against actual output to generate a sparse reward signal. We describe the policy gradient training procedure used, and report its empirical performance on a number of smallscale list processing tasks, such as finding the maximum list element, filtering out certain elements, and reversing the order of the elements. These results show that program induction via reinforcement learning is possible using sparse rewards and solely neural computations.

Katz, Garrett E.↗

DOE OSTI2020

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗

DOE OSTI2021

Improving scalability of electronic structure code for molecular simulations in the presence of environment

A scalable density functional electronic code with Gaussian basis set, called UTEP-NRLMOL, is developed to perform simulations of molecular systems in the presence of the environment with particular attention to the memory requirements. In the electronic structure calculations, the memory and computation time are proportional to the number of atoms. Memory requirements for density functional calculations scale as N*N, where N is the number of atoms. While the recent advances in HPC offer platforms with large numbers of cores, the limited amount of memory available on a given node and poor scalability of the electronic structure codes hinder their efficient usage of these platforms. We have introduced new scaling and parallelization paradigms using MPI-3 shared-memory functionality combined with usage of sparse algebra and storage of matrices in sparse format. This extends the range of applicability of the UTEP-NRLMOL code to large systems over 10,000 atoms, or using up to 67,000 basis functions, and making use of HPC architectures using over 6,000 processors utilizing all available cores. We have also interfaced code with effective fragment potential and polarizable continuum model libraries. The code was used in simulations of several applications which are published in reputed scientific journals.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2022

Cosmic ray muon clustering for the MicroBooNE liquid argon time projection chamber using sMask-RCNN

In this article, we describe a modified implementation of Mask Region-based Convolutional Neural Networks (Mask-RCNN) for cosmic ray muon clustering in a liquid argon TPC and applied to MicroBooNE neutrino data. Our implementation of this network, called sMask-RCNN, uses sparse submanifold convolutions to increase processing speed on sparse datasets, and is compared to the original dense version in several metrics. The networks are trained to use wire readout images from the MicroBooNE liquid argon time projection chamber as input and produce individually labeled particle interactions within the image. These outputs are identified as either cosmic ray muon or electron neutrino interactions. We find that sMask-RCNN has an average pixel clustering efficiency of 85.9% compared to the dense network's average pixel clustering efficiency of 89.1%. We demonstrate the ability of sMask-RCNN used in conjunction with MicroBooNE's state-of-the-art Wire-Cell cosmic tagger to veto events containing only cosmic ray muons. The addition of sMask-RCNN to the Wire-Cell cosmic tagger removes 70% of the remaining cosmic ray muon background events at the same electron neutrino event signal efficiency. This event veto can provide 99.7% rejection of cosmic ray-only background events while maintaining an electron neutrino event-level signal efficiency of 80.1%. In addition to cosmic ray muon identification, sMask-RCNN could be used to extract features and identify different particle interaction types in other 3D-tracking detectors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Pan-sharpening for microscopy

Techniques for generating full-spatial resolution, full spectral resolution image(s) from a 3D spectral-data cube for any spectral value within a given spectral range are provided without requiring the acquisition of all full-spatial resolution, full spectral resolution data by an instrument. The 3D spectral-data cube is generated from a limited number of full-spatial resolution, sparse spectral resolution data and a sparse-spatial resolution, full-spectral resolution data of the same area of the sample. The use of the 3D spectral-data cube reduces the data acquisition time.

Ovchinnikova, Olga S.↗

DOE OSTI2020

Bayesian Approach to Estimation of Water Table Elevations Using Historical Rasters as Prior Information 2019 - 20430

In cases of complex but only partially known geology and a lack of spatial control in observation well locations, water table elevation estimation is very challenging. In some cases, auxiliary information, such as observations of the movement of tracers, operation of injection and extraction wells, and calibration of groundwater models against the historical elevation data, can be combined with expert judgement to estimate flow directions in areas of sparse data and to aid in the production of more reliable contour maps (and associated rasters) than could be produced by relying on sparse well elevation data alone. Given a historical sequence of these raster maps, the question arises how to automate, to the extent possible, the process of producing new raster maps to reflect data from previous times, the current data and the operation of expert judgement. One solution is to adopt a Bayesian point of view and to regard the historical well elevation data, auxiliary information and historical raster maps as prior information. The well elevations for water table wells, as well as those for injection/extraction wells and the data associated with other relevant variables, can be viewed as predictors for the raster surface. From this prior information, we can, conditional on the values of these predictors for a new time period, compute an expected value map and a standard deviation map for the new raster. These then can be taken to specify a prior predictive distribution for the pixels in the new raster map. Then we condition the pixels, corresponding to water level observation wells within the raster, on the observed values in those wells (which in general will differ from the regression estimate) for the new time period. Given the smoothness of the water table surface, we then smooth the surface of deviations from the mean surface, based on the variograms of the historical rasters, and add this smoothed surface to the regression mean surface. The error structure of the produced raster map is defined by the regression error structure and the error due to smoothing based on the estimated variograms. This methodology has been developed and is being further refined for groundwater monitoring and remediation at LANL. It is a very flexible method that can also be applied with a variety of other predictors applied to model the water level wells in the area of interest over the historical record. The smoothness of the spatial process and its possible evolution over time can then be estimated from the residuals from this regression. This can be augmented by expert hydrogeological opinion based on site topography and hydrogeology. (authors)

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Machine Learning for DUNE Supernova Trigger

One of the major scientific goals of the Deep Underground Neutrino Experiment (DUNE) is to detect and measure the neutrino flux originating from galactic core-collapse supernovae. These neutrinos provide an opportunity to study the end of life evolution of massive stars, and reveal information about the structure of core-collapse that is not visible in observations of the electromagnetic spectrum. Because of the rarity of these events, it is crucial that DUNE is able to detect supernova neutrino interactions when they occur. However, this will require sifting through a large quantity of data, motivating the development of a trigger algorithm to identify significant events and discard irrelevant data. Machine learning provides a potential approach to building this trigger. This project generates ADC and ground truth images of simulated neutrino interactions in a LArTPC detector to be used for machine learning, and uses them to train a sparse Convolutional Neural Network (C NN). The performance of this model when applied to the task of pixel classification based on interaction type is examined. This project found that the sparse CNN approach has the potential to have high accuracy in pixel classification, meaning it may be highly relevant to the development of a supernova neutrino trigger for the DUNE far detector.

Damish, S.↗

DOE OSTI2025

Heterogeneous Point Set Transformers for Segmentation of Multiple View Particle Detectors

NOvA is a long-baseline neutrino oscillation experiment that detects neutrino particles from the NuMI beam at Fermilab. Before data from this experiment can be used in analyses, raw hits in the detector must be matched to their source particles, and the type of each particle must be identified. This task has commonly been done using a mix of traditional clustering approaches and convolutional neural networks (CNNs). Due to the construction of the detector, the data is presented as two sparse 2D images: an XZ and a YZ view of the detector, rather than a 3D representation. We propose a point set neural network that operates on the sparse matrices with an operation that mixes information from both views. Our model uses less than 10% of the memory required using previous methods while achieving a 96.8% AUC score, a higher score than obtained when both views are processed independently (85.4%).

Robles, Edgar E. [UC, Irvine (main)]↗

DOE OSTI2026

Quantum block encoding for one-pair semiseparable matrices

Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. Historically, the development of efficient techniques for QBE has mostly focused on sparse matrices; less effort has been devoted to data-sparse (e.g., rank-structured) matrices. In this work we examine a particular case of rank structure, namely, one-pair semiseparable matrices. We present a new block encoding approach that relies on a suitable factorization of the given matrix as the product of triangular and diagonal factors. To encode the matrix, the algorithm needs $2\log(N)+7$ ancillary qubits. Assuming that the data input oracles can be implemented with polylogarithmic depth, or that a QRAM input model is available, our proposed method requires $\mathcal{O}({\rm polylog} (N))$ time and has an error of $\mathcal{O}(N^2)$, where $N$ is the matrix size.

Antonioli, Giacomo [Pisa U.; CERN] (ORCID:00090000↗

DOE OSTI2025

A Parametric, Data-Driven, Non-Intrusive Reduced-Order Model Framework for Crystal Plasticity Simulations of Voids

The influence of the internal structure at micrometer length scales on the deformation of polycrystalline materials can be effectively captured using crystal plasticity finite element methods (CPFEM). However, the complexity and nonlinearity of the deformation equations CPFEM solves demand significant computational power and resources to achieve accurate predictions, limiting its broader application. To address this challenge, we have identified a reduced-order representation of the complex data in order to establish a computationally efficient reduced-order models (ROM) and drastically reduce the computational expense of CPFEM. Specifically, in this work, we developed a parametric, data-driven, and non-intrusive ROM framework for CPFEM using proper orthogonal decomposition (POD) and sparse variational Gaussian process (SVGP) regression for single-crystal microstructures under tensile loading conditions. The developed protocol enables one to compress field into a latent/low-dimensional space described by principal component analysis (PCA) via the singular value decomposition (SVD) algorithm. As a result, the high-dimensional data are reduced to a significantly smaller amount of dimensions with POD bases and POD coefficients. Furthermore, we deployed an ensemble of SVGPs—extended from the classical Gaussian process (GP) regression for scalability and handling big data—in a massively parallel manner to train and predict latent POD coefficients using known POD bases from a set of previously obtained simulations results. Lastly, using the predicted POD coefficients, we reconstructed the full-field results and showed reasonable agreement compared with the true values obtained from running CPFEM. The developed framework is validated with a set of CPFEM simulations of a single embedded void in single-crystal aluminum alloy. While the framework is broadly applicable, this work specifically focuses on single-crystal microstructures, a single load case (e.g., tensile), and a specific void geometry (spherical).

Anisotropy↗

DOE OSTI2021

Seasonal Disorder in Urban Traffic Patterns: A Low Rank Analysis

This article proposes several advances to sparse nonnegative matrix factorization (SNMF) as a way to identify large-scale patterns in urban traffic data. The input to our model is traffic counts organized by time and location. Nonnegative matrix factorization additively decomposes this information, organized as a matrix, into a linear sum of temporal signatures. Penalty terms encourage this factorization to concentrate on only a few temporal signatures, with weights which are not too large. Our interest here is to quantify and compare the regularity of traffic behavior, particularly across different broad temporal windows. In addition to the rank and error, we adapt a measure introduced by Hoyer to quantify sparsity in the representation. Combining these, we construct several curves which quantify error as a function of rank (the number of possible signatures) and sparsity; as rank goes up and sparsity goes down, the approximation can be better and the error should decreases. Plots of several such curves corresponding to different time windows leads to a way to compare disorder/order at different time scalewindows. In this paper, we apply our algorithms and procedures to study a taxi traffic dataset from New York City. In this dataset, we find weekly periodicity in the signatures, which allows us an extra framework for identifying outliers as significant deviations from weekly medians. We then apply our seasonal disorder analysis to the New York City traffic data and seasonal (spring, summer, winter, fall) time windows. We do find seasonal differences in traffic order.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Forward sensitivity analysis and mode dependent control for closure modeling of Galerkin systems

Model reduction by projection-based approaches is often associated with losing some of the important features that contribute towards the dynamics of the retained scales. As a result, a mismatch occurs between the predicted trajectories of the original system and the truncated one. We put forth a framework to apply a continuous time control signal in the latent space of the reduced order model (ROM) to account for the effect of truncation. We set the control input using parameterized models by following energy transfer principles. Our methodology relies on observing the system behavior in the physical space and using the projection operator to restrict the feedback signal into the latent space. Then, we leverage the forward sensitivity method (FSM) to derive relationships between the feedback and the desired mode-dependent control. We test the performance of the proposed approach using two test cases, corresponding to viscous Burgers and vortex merger problems at high Reynolds number. Results show that the ROM trajectory with the applied FSM control closely matches its target values in both the data-dense and data-sparse regimes.

97 MATHEMATICS AND COMPUTING↗