Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Sparse estimation”

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 307 records · Page 17

In Situ Monitoring of Groundwater Contamination for Sustainable Remediation Using the Kalman Filter - 18423

Groundwater monitoring is critical for nuclear-related facilities as well as radioactively contaminated sites. Recent advances in sensing, data analytics and simulation capabilities provide substantial opportunities to improve and change current monitoring procedures. In particular, we need a paradigm shift from contaminant-only or compliance-only monitoring programs to comprehensive monitoring, i.e., including other ancillary environmental variables for a holistic understanding of the groundwater systems and plume behaviors. Such new approaches are needed for the effective implementation of sustainable remediation (enhanced and natural attenuation), and they have great potential for cost reduction in site monitoring. This paper reviews recent developments for improving long-term monitoring, with focus on the effective use of in situ sensors, data analytics and simulation capabilities. In particular, we highlight a recent application of the Kalman filter algorithm to estimate contaminant concentrations continuously in real time, based on in-situ measured water quality parameters (e.g. electrical conductance and pH) and sparse groundwater sampling. The results show that we can reduce the groundwater sampling frequency significantly, while capturing the dynamics of short- and long-term contaminant concentration changes. Such advanced and integrated monitoring systems will be beneficial for local residents (e.g., to ensure the safety by detecting adverse events early, enabling a swift response) as well as for site operators (e.g., to gain/improve public acceptance, to be better prepared for litigations and false claims, and to reduce overall monitoring cost). (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

The Iterated Fission Matrix Method

The fission matrix (FM) method has been successfully demonstrated for different applications. One of the interesting features of this method, which is not possible via standard criticality source Monte Carlo calculations, is the capability to calculate higher forward and adjoint Eigenmodes; however, the accuracy of the estimates for higher eigenvalues strongly depends on the spatial discretization adopted for the fission matrix. A fine mesh ensures accurate results but requires matrices of large size. This is considered a limitation to the applicability of the FM method due to the memory requirements for storage of large full matrices. The adoption of sparse matrix storage (e.g., in MCNP) partially overcomes this problem; nonetheless, the sparse matrix indexing increases the complexity of the implementation of the FM algorithm and introduces the additional task of sparsifying the fission matrix. This summary presents a new method, named the iterated fission matrix (IFM), that allows to estimate higher eigenvalues of multiplying systems on much smaller meshes, but with the same level of accuracy in terms of spatial discretization errors, as compared to the FM method. The following Sections describe this new approach and provide a demonstration using two case studies: a PWR fuel assembly, and a 2D PWR core. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Exploration with Scalable Gaussian Process Reinforcement Learning

Exploration is a challenging problem in reinforcement learning (RL), especially in environments with sparse rewards. Quantifying and utilizing the parametric uncertainty has been shown to be paramount for successful exploration [Osband et al., 2018]. Bayesian, or approximately Bayesian, methods present a principled means of estimating the parametric uncertainty in RL problems. Gaussian processes, nonparametric Bayesian models, are often impractical due to poor scalability and computational bottlenecks. We introduce a scalable Gaussian process RL (GPRL) method which directly induces sparsity in the covariance matrix to facilitate faster computation. This is a departure from previous GPRL methods which instead rely on data reduction and subsampling. We compare various covariance-based exploration techniques (Thompson sampling, upper confidence bound, and probabilistic maximum variance) which leverage our scalable GP framework in sparse reward environments. Finally, we show favorable comparison against the bootstrapped deep Q-Network.

97 MATHEMATICS AND COMPUTING↗

Satellite Embedding-Based Population Imputation for Areas with Missing Building Footprint Data: A Computer Vision-Based Approach

High-resolution population modeling is important for supporting effective decision-making across diverse sectors. LandScan Mosaic generates population estimates at the level of individual buildings and aggregates them to 3 arc-second grids, and this approach performs well in regions where building footprint data are comprehensive and reliable. However, large portions of the globe still suffer from incomplete, sparse, or entirely missing building stock datasets, creating a structural limitation for strictly building-based population models. To address this research gap, this study proposes a computer vision-based framework that employs Google Earth Engine satellite embeddings and UNet, which allows us to directly impute grid-level population estimates in building-data-deficient areas. Applied to Taiwan as a case study, the framework achieved strong predictive performance with R$^{2}$ of 0.89, RMSE of 18.70, and MAE of 8.41, outperforming traditional machine learning approaches. Notably, the proposed framework effectively addressed building false-positive errors inherent in Global Human Settlement Layer (GHSL) data, correctly identifying uninhabited areas that were erroneously classified as populated. The framework also offers significant advantages for global population mapping, particularly in terms of scalability and temporal consistency, thereby extending the coverage and accuracy of high-resolution population products in data-scarce regions worldwide. Urban planners, decision makers, and related stakeholders can obtain granular population distributions to support more accurate and targeted infrastructure investment, service delivery, resource allocation, and risk assessment decisions.

97 MATHEMATICS AND COMPUTING↗

Estimating Highway Volumes Using Vehicle Probe Data - Proof of Concept: Preprint

This paper examines the feasibility of using sampled commercial probe data in combination with validated continuous counter data to accurately estimate vehicle volume across the entire roadway network, for any hour during the year. Currently either real time or archived volume data for roadways at specific times are extremely sparse. Most volume data are average annual daily traffic (AADT) measures derived from the Highway Performance Monitoring System (HPMS). Although methods to factor the AADT to hourly averages for typical day of week exist, actual volume data is limited to a sparse collection of locations in which volumes are continuously recorded. This paper explores the use of commercial probe data to generate accurate volume measures that span the highway network providing ubiquitous coverage in space, and specific point-in-time measures for a specific date and time. The paper examines the need for the data, fundamental accuracy limitations based on a basic statistical model that take into account the sampling nature of probe data, and early results from a proof of concept exercise revealing the potential of probe type data calibrated with public continuous count data to meet end user expectations in terms of accuracy of volume estimates.

25 ENERGY STORAGE↗

Generating data ensembles over a model grid from sparse climate measurements.

Parameterizations in high-end climate models can be evaluated with observed climate and meteorological data. Often this evaluation is achieved by averaging measured quantities over time and space to match the spatial and temporal resolution of a gridded climate model without any regard for the statistical errors in doing so. We present a statistical method to interpolate sparsely located surface measurements into a uniform spatial grid representative of global and regional models of the atmosphere and climate. This method provides estimates of mean values over the entire domain containing the measurement sites as well as the uncertainty in the estimated quantities at the grid locations through multiple simulations to create 'data ensembles.' We demonstrate this method using measurements of surface sensible heat flux over the southern Great Plains region gathered through the Department of Energy's Atmospheric Radiation Measurement (ARM) program. Application to the numerous other climate variables measured through the ARM program and the development of a software tool to streamline data management and implementation of the statistical models is also discussed.

54 ENVIRONMENTAL SCIENCES↗

Asymptotic consistency of the WSINDy algorithm in the limit of continuum data

In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold σ c . We provide explicit bounds on σ c in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE.

asymptotic consistency↗

Simulation Planning Using Component Based Cost Model

Successful simulations for scientific discovery on high-performance computing platforms require careful planning, including verification of specific application configuration and runtime parameters, estimation of resource requirements, and steering and monitoring of the simulation. However, simulation planning is an aspect of scientific computing that is extremely sparse in available literature or training. In this paper we focus on the resource management aspect of such planning through formulation of a component-based cost model. We illustrate the methodology and formulation through FLASH, a highly configurable simulation code used in multiple scientific domains.

Dubey, Anshu↗

Identification of interactions in fractional-order systems with high dimensions

This article proposes an approach to identify fractional-order systems with sparse interaction structures and high dimensions when observation data are supposed to be experimentally available. This approach includes two steps: first, it is to estimate the value of the fractional order by taking into account the solution properties of fractional-order systems; second, it is to identify the interaction coefficients among the system variables by employing the compressed sensing technique. An error analysis is provided analytically for this approach and a further improved approach is also proposed. Moreover, the applicability of the proposed approach is fully illustrated by two examples: one is to estimate the mutual interactions in a complex dynamical network described by fractional-order systems, and the other is to identify a high fractional-order and homogeneous sequential differential equation, which is frequently used to describe viscoelastic phenomena. All the results demonstrate the feasibility of figuring out the system mechanisms behind the data experimentally observed in physical or biological systems with viscoelastic evolution characters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multicanonical sampling of rare events in random matrices

A method based on multicanonical Monte Carlo is applied to the calculation of large deviations in the largest eigenvalue of random matrices. The method is successfully tested with the Gaussian orthogonal ensemble, sparse random matrices, and matrices whose components are subject to uniform density. Specifically, the probability that all eigenvalues of a matrix are negative is estimated in these cases down to the values of {approx}10{sup -200}, a region where simple random sampling is ineffective. The method can be applied to any ensemble of matrices and used for sampling rare events characterized by any statistics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Gradients for Large-Scale Tensor Decomposition

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of loss functions such as Bernoulli loss for binary data or Huber loss for robust estimation. Here, the stochastic gradient is formed from randomly sampled elements of the tensor and is efficient because it can be computed using the sparse matricized-tensor times Khatri--Rao product tensor kernel. For dense tensors, we simply use uniform sampling. For sparse tensors, we propose two types of stratified sampling that give precedence to sampling nonzeros. Numerical results demonstrate the advantages of the proposed approach and its scalability to large-scale problems.

97 MATHEMATICS AND COMPUTING↗

A parallel WLS state estimator on shared memory computers

This paper describes our experience with developing a parallel weighted- least-square (WLS) state estimation (SE) program for shared-memory parallel computers. Since the key computational kernel of the WLS algorithm based on the Newton-Raphson approach is a solver of sparse linear equations, a significant part of our effort was focused on selecting, implementing and evaluating this algorithm. An optimized shared memory version of the conjugate gradient (CG) algorithm was found to be competitive to state-of-the-art implementation of LU solvers for the SE problem on the SGI Altix, a shared memory architecture. We also ported the full SE algorithm including CG to the Cray MTA-2 shared memory multithreaded architecture and investigated its performance.

97 MATHEMATICS AND COMPUTING↗

Small-Footprint Lidar Estimations of Sagebrush Canopy Characteristics

Separating lidar returns for use in determining canopy height and shape in low-height vegetation is difficult because the vegetation canopy return is often close to the ground return in time and space. In addition, height underestimation is likely exacerbated in sparsely vegetated shrub ecosystems. This study compares lidar point-cloud data to sagebrush canopy characteristics measured in the field. It was determined that cumulative prediction error could account for as much as 35.6% of the average height and 37.4% of the average canopy area of shrubs sampled. When scaling from the individual shrub scale to coarser scales, prediction error averaged over a number of shrubs decreases as observation numbers increase. High density (in this case an average of 9.46 returns per m2), small footprint lidar (in this case a footprint diameter of 18 cm at nadir) may provide sufficient accuracy for characterizing sagebrush structure and cover and estimating biomass across landscapes.

54 ENVIRONMENTAL SCIENCES↗

All-purpose, all-sky photometric redshifts for the Legacy Imaging Surveys Data Release 8

ABSTRACT In this paper, we present photometric redshift (photo-z) estimates for the Dark Energy Spectroscopic Instrument (DESI) Legacy Imaging Surveys, currently the most sensitive optical survey covering the majority of the extragalactic sky. Our photo-z methodology is based on a machine-learning approach, using sparse Gaussian processes augmented with Gaussian mixture models (GMMs) that allow regions of parameter space to be identified and trained separately in a purely data-driven way. The same GMMs are also used to calculate cost-sensitive learning weights that mitigate biases in the spectroscopic training sample. By design, this approach aims to produce reliable and unbiased predictions for all parts of the parameter space present in wide area surveys. Compared to previous literature estimates using the same underlying photometry, our photo-zs are significantly less biased and more accurate at z > 1, with negligible loss in precision or reliability for resolved galaxies at z < 1. Our photo-z estimates offer accurate predictions for rare high-value populations within the parent sample, including optically selected quasars at the highest redshifts (z > 6), as well as X-ray or radio continuum selected populations across a broad range of flux (densities) and redshift. Deriving photo-z estimates for the full Legacy Imaging Surveys Data Release 8, the catalogues provided in this work offer photo-z estimates predicted to be of high quality for ≳9 × 108 galaxies over ${\sim}19\, 400\, \text{deg}^{2}$ and spanning 0 < z ≲ 7, offering one of the most extensive samples of redshift estimates ever produced.

79 ASTRONOMY AND ASTROPHYSICS↗

Ensemble Estimation of Historical Evapotranspiration for the Conterminous U.S.

Abstract Evapotranspiration (ET) is the largest component of the water budget, accounting for the majority of the water available from precipitation. ET is challenging to quantify because of the uncertainties associated with the many ET equations currently in use, and because observations of ET are uncertain and sparse. In this study, we combine information provided by available ET data and equations to produce a new monthly data set for ET for the conterminous U.S. (CONUS). These maps are produced from 1895 to 2018 at an 800 m spatial scale, marking a finer resolution than currently available products over this time period. In our approach, the relative performance of a suite of ET equations is assessed using water balance, flux tower, and remotely sensed ET estimates. At the observation locations, we use error distributions to quantify relative weights for the equations and use these in a modified Bayesian model averaging weighted ensemble approach. The relative weights are spatially generalized using a random forest regression, which is applied to wall‐to‐wall explanatory variable maps to generate CONUS‐wide relative weight maps and ensemble estimates. We assess the performance of the ensemble using a reserved subset of the observations and compare this performance against other national‐scale map products for historical to modern ET. The ensemble ET maps are shown to provide an improved accuracy over the alternative comparison products. These ET maps could be useful for a variety of hydrologic modeling and assessment applications that benefit from a long record, such as the study of periods of water scarcity through time.

Environmental Sciences & Ecology↗

Accuracy of Some Approximate Gaussian Filters for the Navier--Stokes Equation in the Presence of Model Error

Bayesian state estimation of a dynamical system from a stream of noisy measurements is important in many geophysical and engineering applications where high dimensionality of the state space, sparse observations, and model error pose key challenges. In this work, three computationally feasible, approximate Gaussian data assimilation/filtering algorithms are considered in various regimes of turbulent 2D Navier--Stokes dynamics in the presence of model error. The first source of error arises from the necessary use of reduced models for the forward dynamics of the filters, while a particular type of representation error arises from the finite resolution of observations which mix up information about resolved and unresolved dynamics. Two stochastically parameterized filtering algorithms, referred to as cSPEKF and GCF, are compared with 3DVAR---a prototypical time-sequential algorithm known to be accurate for filtering dissipative systems for a suitably inflated “background” covariance. We provide the first evidence that the stochastically parameterized algorithms, which do not rely on detailed knowledge of the underlying dynamics and do not require covariance inflation, can compete with or outperform an optimally tuned 3DVAR algorithm, and they can overcome competing sources of error in a range of dynamical scenarios.

97 MATHEMATICS AND COMPUTING↗

Machine learning and shallow groundwater chemistry to identify geothermal prospects in the Great Basin, USA

This study discovers various geothermal prospects in the Great Basin, USA based on shallow groundwater chemical (geochemical) data. The geochemical data are expected to include hidden (latent) information that is a proxy for geothermal prospectivity. We processed the sparse geochemical data in the Great Basin at 14,341 locations including 18 attributes. Next, a non-negative matrix factorization with customized k-means clustering is applied to the geochemical data matrix that automatically finds three hidden geothermal signatures representing modestly, moderately, and highly confident geothermal prospects. The algorithm also evaluated the probability of occurrence of these types of resources through the studied region. There is a consistency between regional geothermal prospectivity as estimated by our ML methodology and the traditional play fairway analysis conducted over a portion of the study area. We also identify the dominant data attributes associated with each signature. Finally, our ML analyses allow us to reconstruct attributes from sparse into continuous over the study domain. The predicted continuous attributes can be used for future detailed geothermal explorations in the Great Basin.

15 GEOTHERMAL ENERGY↗

Numerical characterization of support recovery in sparse regression with correlated design

Sparse regression is employed in diverse scientific settings as a feature selection method. A pervasive aspect of scientific data is the presence of correlations between predictive features. These correlations hamper both feature selection and estimation and jeopardize conclusions drawn from estimated models. On the other hand, theoretical results on sparsity-inducing regularized regression have largely addressed conditions for selection consistency via asymptotics, and disregard the problem of model selection, whereby regularization parameters are chosen. In this numerical study, we address these issues through exhaustive characterization of the performance of several regression estimators, coupled with a range of model selection strategies. These estimators and selection criteria were examined across correlated regression problems with varying degrees of signal to noise, distributions of non-zero model coefficients, and model sparsity. Our results reveal a fundamental tradeoff between false positive and false negative control in all regression estimators and model selection criteria examined. Additionally, we numerically explore a transition point modulated by the signal-to-noise ratio and spectral properties of the design covariance matrix at which the selection accuracy of all considered algorithms degrades. Overall, we find that SCAD coupled with BIC or empirical Bayes model selection performs the best feature selection across the regression problems considered.

97 MATHEMATICS AND COMPUTING↗