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 289 records · Page 16

Structured Multifrontal Sparse Solver

StruMF is an algebraic structured preconditioner for the interative solution of large sparse linear systems. The preconditioner corresponds to a multifrontal variant of sparse LU factorization in which some dense blocks of the factors are approximated with low-rank matrices. It is algebraic in that it only requires the linear system itself, and the approximation threshold that determines the accuracy of individual low-rank approximations. Favourable rank properties are obtained using a block partitioning which is a refinement of the partitioning induced by nested dissection ordering.

Napov, Artem↗

GraphSAGE-Sparse v.0.2.0

SAND2022-12899 O GraphSAGE-Sparse is an implementation of the GraphSAGE Graph Neural Network that adds support for sparse data structures, as well as improved functionality through the Tensorflow 2 functional API. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Background: A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from highdimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN) from transcript profiling data. Results: The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l 1-constrained fitting) problem and solved finally by formulating a Linear Program (LP). A bound on the Generalization Error of this approach is given in terms of the LeaveOne-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM) initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known regulatory associations. In each S. cerevisiae LP-SLGN, the number of nodes with a particular degree follows an approximate power law suggesting that its degree distributions is similar to that observed in real-world networks. Inspection of these LP-SLGNs suggests biological hypotheses amenable to experimental verification.

59 BASIC BIOLOGICAL SCIENCES↗

Estimating Sparse Direct Effects in Multivariate Regression With the Spike-and-Slab LASSO

The multivariate regression interpretation of the Gaussian chain graph model simultaneously parametrizes (i) the direct effects of p predictors on q outcomes and (ii) the residual partial covariances between pairs of outcomes. We introduce a new method for fitting sparse versions of these models with spike-and-slab LASSO (SSL) priors. We develop an Expectation Conditional Maximization algorithm to obtain sparse estimates of the p × q matrix of direct effects and the q × q residual precision matrix. Our algorithm iteratively solves a sequence of penalized maximum likelihood problems with self-adaptive penalties that gradually filter out negligible regression coefficients and partial covariances. Because it adaptively penalizes individual model parameters, our method is seen to outperform fixed-penalty competitors on simulated data. We establish the posterior contraction rate for our model, buttressing our method’s excellent empirical performance with strong theoretical guarantees. Using our method, we estimated the direct effects of diet and residence type on the composition of the gut microbiome of elderly adults.

EM algorithm↗

Covariate Dependent Sparse Functional Data Analysis

This study proposes a method to incorporate covariate information into sparse functional data analysis. The method aims at cases where each subject has a limited number of longitudinal measurements and is associated with static covariates. This research is motivated by several use cases in practice. One representative example is void swelling, a nuclear-specific material degradation mechanism. Void swelling is affected by many covariates, including alloy composition and irradiation type. How to accurately model the complicated joint effects of such covariates on the swelling process is the key to mitigating the effect of swelling and ensuring safe operation. Unlike most of the existing methods, the proposed method can handle high-dimensional covariates with the informative covariate identification procedure and sparse and irregularly spaced measurements, that is, does not require complete or dense observations. The main innovation of the proposed method is that we model the variation coming from covariates and the variation left conditioned on covariates, such that the functional principal component analysis and Gaussian process can be conducted in a unified manner. Further, we also propose a systematic approach to identify important covariates in the hypothesis testing context. The methodology is demonstrated on applications in nuclear engineering and healthcare and simulation studies.

42 ENGINEERING↗

Accelerated Gibbs Sampling for Infinite Sparse Factor Analysis

The Indian Buffet Process (IBP) gives a probabilistic model of sparse binary matrices with an unbounded number of columns. This construct can be used, for example, to model a fixed numer of observed data points (rows) associated with an unknown number of latent features (columns). Markov Chain Monte Carlo (MCMC) methods are often used for IBP inference, and in this technical note, we provide a detailed review of the derivations of collapsed and accelerated Gibbs samplers for the linear-Gaussian infinite latent feature model. We also discuss and explain update equations for hyperparameter resampling in a 'full Bayesian' treatment and present a novel slice sampler capable of extending the accelerated Gibbs sampler to the case of infinite sparse factor analysis by allowing the use of real-valued latent features.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Sparse-Grid High-Order Stochastic Collocation Method for Bayesian Inference in Groundwater Reactive Transport Modeling

Although Bayesian analysis has become vital to the quantification of prediction uncertainty in groundwater modeling, its application has been hindered due to the computational cost associated with numerous model executions needed for exploring the posterior probability density function (PPDF) of model parameters. This is particularly the case when the PPDF is estimated using Markov Chain Monte Carlo (MCMC) sampling. In this study, we develop a new approach that improves computational efficiency of Bayesian inference by constructing a surrogate system based on an adaptive sparse-grid high-order stochastic collocation (aSG-hSC) method. Unlike previous works using first-order hierarchical basis, we utilize a compactly supported higher-order hierar- chical basis to construct the surrogate system, resulting in a significant reduction in the number of computational simulations required. In addition, we use hierarchical surplus as an error indi- cator to determine adaptive sparse grids. This allows local refinement in the uncertain domain and/or anisotropic detection with respect to the random model parameters, which further improves computational efficiency. Finally, we incorporate a global optimization technique and propose an iterative algorithm for building the surrogate system for the PPDF with multiple significant modes. Once the surrogate system is determined, the PPDF can be evaluated by sampling the surrogate system directly with very little computational cost. The developed method is evaluated first using a simple analytical density function with multiple modes and then using two synthetic groundwater reactive transport models. The groundwater models represent different levels of complexity; the first example involves coupled linear reactions and the second example simulates nonlinear ura- nium surface complexation. The results show that the aSG-hSC is an effective and efficient tool for Bayesian inference in groundwater modeling in comparison with conventional MCMC sim- ulations. The computational efficiency is expected to be more beneficial to more computational expensive groundwater problems.

Zhang, Guannan↗

Hierarchy-Direction Selective Approach for Locally Adaptive Sparse Grids

We consider the problem of multidimensional adaptive hierarchical interpolation. We use sparse grids points and functions that are induced from a one dimensional hierarchical rule via tensor products. The classical locally adaptive sparse grid algorithm uses an isotropic refinement from the coarser to the denser levels of the hierarchy. However, the multidimensional hierarchy provides a more complex structure that allows for various anisotropic and hierarchy selective refinement techniques. We consider the more advanced refinement techniques and apply them to a number of simple test functions chosen to demonstrate the various advantages and disadvantages of each method. While there is no refinement scheme that is optimal for all functions, the fully adaptive family-direction-selective technique is usually more stable and requires fewer samples.

Stoyanov, Miroslav K↗

Discussion of CoSA: Clustering of Sparse Approximations

The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.

97 MATHEMATICS AND COMPUTING↗

Evaluation of a Class of Simple and Effective Uncertainty Methods for Sparse Samples of Random Variables and Functions

When very few samples of a random quantity are available from a source distribution of unknown shape, it is usually not possible to accurately infer the exact distribution from which the data samples come. Under-estimation of important quantities such as response variance and failure probabilities can result. For many engineering purposes, including design and risk analysis, we attempt to avoid under-estimation with a strategy to conservatively estimate (bound) these types of quantities -- without being overly conservative -- when only a few samples of a random quantity are available from model predictions or replicate experiments. This report examines a class of related sparse-data uncertainty representation and inference approaches that are relatively simple, inexpensive, and effective. Tradeoffs between the methods' conservatism, reliability, and risk versus number of data samples (cost) are quantified with multi-attribute metrics use d to assess method performance for conservative estimation of two representative quantities: central 95% of response; and 10 -4 probability of exceeding a response threshold in a tail of the distribution. Each method's performance is characterized with 10,000 random trials on a large number of diverse and challenging distributions. The best method and number of samples to use in a given circumstance depends on the uncertainty quantity to be estimated, the PDF character, and the desired reliability of bounding the true value. On the basis of this large data base and study, a strategy is proposed for selecting the method and number of samples for attaining reasonable credibility levels in bounding these types of quantities when sparse samples of random variables or functions are available from experiments or simulations.

97 MATHEMATICS AND COMPUTING↗

Applying Waveform Correlation to Mining Blasts Using a Global Sparse Network

Agencies that monitor for underground nuclear tests are interested in techniques that automatically characterize mining blasts to reduce the human analyst effort required to produce high-quality event bulletins. Waveform correlation is effective in finding similar waveforms from repeating seismic events, including mining blasts. We report the results of an experiment that uses waveform templates recorded by multiple International Monitoring System stations of the Comprehensive Nuclear-Test-Ban Treaty for up to 10 years prior to detect and identify mining blasts that occur during single weeks of study. We discuss approaches for template selection, threshold setting, and event detection that are specialized for mining blasts and a sparse, global network. We apply the approaches to two different weeks of study for each of two geographic regions, Wyoming and Scandinavia, to evaluate the potential for establishing a set of standards for waveform correlation processing of mining blasts that can be effective for operational monitoring systems with a sparse network. We compare candidate events detected with our processing methods to the Reviewed Event Bulletin of the International Data Centre to develop an intuition about potential reduction in analyst workload.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Applying Waveform Correlation to Mining Blasts Using a Global Sparse Network

Agencies that monitor for underground nuclear tests are interested in techniques that automatically characterize mining blasts to reduce the human analyst effort required to produce high-quality event bulletins. Waveform correlation is effective in finding similar waveforms from repeating seismic events, including mining blasts. We report the results of an experiment that uses waveform templates recorded by multiple International Monitoring System stations of the Preparatory Commission for the Comprehensive Nuclear-Test-Ban Treaty Organization for up to 10 years prior to the time period of interest to detect and identify mining blasts that occur during single weeks of study. We discuss approaches for template selection, threshold setting, and event detection that are specialized for mining blasts and a sparse, global network. We apply the approaches to two different weeks of study for each of two geographic regions, Wyoming and Scandinavia, to evaluate the potential for establishing a set of standards for waveform correlation processing of mining blasts that can be effective for operational monitoring systems with a sparse network. We compare candidate events detected with our processing methods to the Reviewed Event Bulletin of the International Data Centre to develop an intuition about potential reduction in analyst workload.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

A Sparse Grid Method for Bayesian Uncertainty Quantification with Application to Large Eddy Simulation Turbulence Models

There is wide agreement that the accuracy of turbulence models suffer from their sensitivity with respect to physical input data, the uncertainties of user-elected parameters, as well as the model inadequacy. However, the application of Bayesian inference to systematically quantify the uncertainties in parameters, by means of exploring posterior probability density functions (PPDFs), has been hindered by the prohibitively daunting computational cost associated with the large number of model executions, in addition to daunting computation time per one turbulence simulation. In this effort, we perform in this paper an adaptive hierarchical sparse grid surrogate modeling approach to Bayesian inference of large eddy simulation (LES). First, an adaptive hierarchical sparse grid surrogate for the output of forward models is constructed using a relatively small number of model executions. Using such surrogate, the likelihood function can be rapidly evaluated at any point in the parameter space without simulating the computationally expensive LES model. This method is essentially similar to those developed in Zhang et al. (Water Resour Res 49:6871–6892, 2013) for geophysical and groundwater models, but is adjusted and applied here for a much more challenging problem of uncertainty quantification of turbulence models. Through a numerical demonstration of the Smagorinsky model of two-dimensional flow around a cylinder at sub-critical Reynolds number, our approach is proven to significantly reduce the number of costly LES executions without losing much accuracy in the posterior probability estimation. Here, the model parameters are calibrated against synthetic data related to the mean flow velocity and Reynolds stresses at different locations in the flow wake. The influence of the user-elected LES parameters on the quality of output data will be discussed.

97 MATHEMATICS AND COMPUTING↗

Sparse Dense and Compact Linearizations of the AC OPF (Online Supplement)

This document is an online supplement for Sparse, Dense, and Compact Linearizations of the AC OPF. Here we present complete derivations of the formulations examined, details of the lazy constraint algorithm, and full computational results supporting Sparse, Dense, and Compact Linearizations of the AC OPF.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Applying Waveform Correlation to Aftershock Sequences Using a Global Sparse Network

Agencies that monitor for underground nuclear tests are interested in techniques that automatically characterize earthquake aftershock sequences to reduce the human analyst effort required to produce high-quality event bulletins. Waveform correlation is effective in detecting similar seismic waveforms from repeating earthquakes, including aftershock sequences. We report the results of an experiment that uses waveform templates recorded by multiple stations of the Comprehensive Nuclear-Test-Ban Treaty International Monitoring System during the first twelve hours after a mainshock to detect and identify aftershocks that occur during the subsequent week. We discuss approaches for station and template selection, threshold setting, and event detection that are specialized for aftershock processing for a sparse, global network. We apply the approaches to three aftershock sequences to evaluate the potential for establishing a set of standards for aftershock waveform correlation processing that can be effective for operational monitoring systems with a sparse network. We compare candidate events detected with our processing methods to the Reviewed Event Bulletin of the International Data Center to develop an intuition about potential reduction in analyst workload.

58 GEOSCIENCES↗

CO 2 Injection Monitoring with a Scalable, Automated Sparse Seismic Array

Conference presentation at American Institute of Chemical Engineers (AIChE) Annual Meeting, Virtual, November 16–20, 2020. The scalable, automated sparse seismic array (SASSA) method has been ideated as a cost-effective alternative or complementary to conventional 3D seismic methods. Based on a sparse array of receivers deployed strategically on Earth’s surface and one or more fixed seismic sources, the SASSA method can be used to study specific portions of the subsurface to detect the movement of CO 2 in a reservoir with lower environmental footprint and shorter turnaround time to deliver results than conventional 3D seismic methods. Energy & Environmental Research Center (EERC) carried out seismic monitoring of an oilfield undergoing CO 2 enhanced oil recovery in Montana, USA, using the SASSA method.

02 PETROLEUM↗