Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparsity 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.

98 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Developing a heavy-duty vehicle activity database to estimate start and idle emissions

Heavy-duty vehicle start and idling activities were characterized from two datasets to improve emission estimates in the MOtor Vehicle Emission Simulator (MOVES): 1. Fleet DNA from the National Renewable Energy Laboratory (NREL) and 2. A dataset collected by the University of California, Riverside for the California Air Resources Board. Furthermore, the combined dataset includes 564 commercial vehicles, over 23,000 vehicle days of operation and covers seven of the nine heavy-duty source types defined by MOVES. The start and idle activities are characterized and illustrated across MOVES source types, vocations, fleets, days, and hours. This study provides the most comprehensive analysis yet made publicly available to characterize start and idle activity for heavy-duty vehicles within the United States. The results also show there is significant uncertainty in the average heavy-duty idle and start activity due to the large variation in activity across fleets and vocations, and sparsity of nation-wide vehicle population data by vocation.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2018

Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems

We develop a framework for goal-oriented optimal design of experiments (GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This framework differs from classical Bayesian optimal design of experiments (ODE) in the following sense: we seek experimental designs that minimize the posterior uncertainty in the experiment end-goal, e.g. a quantity of interest (QoI), rather than the estimated parameter itself. This is suitable for scenarios in which the solution of an inverse problem is an intermediate step and the estimated parameter is then used to compute a QoI. In such problems, a GOODE approach has two benefits: the designs can avoid wastage of experimental resources by a targeted collection of data, and the resulting design criteria are computationally easier to evaluate due to the often low-dimensionality of the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which are natural analogues of classical Bayesian A- and D-optimal criteria. We analyze the connections to other ODE criteria, and provide interpretations for the GOODE criteria by using tools from information theory. Then, we develop an efficient gradient-based optimization framework for solving the GOODE optimization problems. Additionally, we present comprehensive numerical experiments testing the various aspects of the presented approach. The driving application is the optimal placement of sensors to identify the source of contaminants in a diffusion and transport problem. As a result, we enforce sparsity of the sensor placements using an L1-norm penalty approach, and propose a practical strategy for specifying the associated penalty parameter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Many-isocenter optimization for robotic radiotherapy

Despite significant dosimetric gains, clinical implementation of the 4π non-coplanar radiotherapy on the widely available C-arm gantry system is hindered by limited clearance, and the need to perform complex coordinated gantry and couch motion. A robotic radiotherapy platform would be conducive to such treatment but a new conflict between field size and MLC modulation resolution needs to be managed for versatile applications. This study investigates the dosimetry and delivery efficiency of purposefully creating many isocenters to achieve simultaneously high MLC modulation resolution and large tumor coverage. An integrated optimization framework was proposed for simultaneous beam orientation optimization (BOO), isocenter selection, and fluence map optimization (FMO). The framework includes a least-square dose fidelity objective, a total variation term for regularizing the fluence smoothness, and a group sparsity term for beam selection. A minimal number of isocenters were identified for efficient target coverage. Colliding beams excluded, high-resolution small-field 4π intensity-modulated radiotherapy (IMRT) treatment plans with 50 cm source-to-isocenter distance (SID-50) on 10 Head and Neck (H&N) cancer patients were compared with low-resolution large-field plans with 100 cm SID (SID-100). With the same or better target coverage, the average reduction of [Dmean, Dmax] of 20-beam SID-50 plans from 20-beam SID-100 plans were [2.09 Gy, 1.19 Gy] for organs at risk (OARs) overall, [3.05 Gy, 0.04 Gy] for parotid gland, [3.62 Gy, 5.19 Gy] for larynx, and [3.27 Gy, 1.10 Gy] for mandible. R50 and integral dose were reduced by 5.3% and 9.6%, respectively. Wilcoxon signed-rank test showed significant difference (p < 0.05) in planning target volume (PTV) homogeneity, PTV Dmax, R50, Integral dose, and OAR Dmean and Dmax. The estimated delivery time of 20-beam [SID-50, SID-100] plans were [19, 18] min and [14, 9] min, assuming 5 fractions and 30 fractions, respectively. Finally, with clinically acceptable delivery efficiency, many-isocenter optimization is dosimetrically desirable for treating large targets with high modulation resolution on the robotic platform.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

Low-rank matrix decomposition and spatio-temporal sparse recovery for STAP radar

We develop space-time adaptive processing (STAP) methods by leveraging the advantages of sparse signal processing techniques in order to detect a slowly-moving target. We observe that the inherent sparse characteristics of a STAP problem can be formulated as the low-rankness of clutter covariance matrix when compared to the total adaptive degrees-of-freedom, and also as the sparse interference spectrum on the spatio-temporal domain. By exploiting these sparse properties, we propose two approaches for estimating the interference covariance matrix. In the first approach, we consider a constrained matrix rank minimization problem (RMP) to decompose the sample covariance matrix into a low-rank positive semidefinite and a diagonal matrix. The solution of RMP is obtained by applying the trace minimization technique and the singular value decomposition with matrix shrinkage operator. Our second approach deals with the atomic norm minimization problem to recover the clutter response-vector that has a sparse support on the spatio-temporal plane. We use convex relaxation based standard sparse-recovery techniques to find the solutions. With extensive numerical examples, we demonstrate the performances of proposed STAP approaches with respect to both the ideal and practical scenarios, involving Doppler-ambiguous clutter ridges, spatial and temporal decorrelation effects. As a result, the low-rank matrix decomposition based solution requires secondary measurements as many as twice the clutter rank to attain a near-ideal STAP performance; whereas the spatio-temporal sparsity based approach needs a considerably small number of secondary data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Sparse Bayesian mass mapping with uncertainties: hypothesis testing of structure

ABSTRACT A crucial aspect of mass mapping, via weak lensing, is quantification of the uncertainty introduced during the reconstruction process. Properly accounting for these errors has been largely ignored to date. We present a new method to reconstruct maximum a posteriori (MAP) convergence maps by formulating an unconstrained Bayesian inference problem with Laplace-type l1-norm sparsity-promoting priors, which we solve via convex optimization. Approaching mass mapping in this manner allows us to exploit recent developments in probability concentration theory to infer theoretically conservative uncertainties for our MAP reconstructions, without relying on assumptions of Gaussianity. For the first time, these methods allow us to perform hypothesis testing of structure, from which it is possible to distinguish between physical objects and artefacts of the reconstruction. Here, we present this new formalism, and demonstrate the method on simulations, before applying the developed formalism to two observational data sets of the Abell 520 cluster. Initial reconstructions of the Abell 520 catalogues reported the detection of an anomalous ‘dark core’ – an overdense region with no optical counterpart – which was taken to be evidence for self-interacting dark matter. In our Bayesian framework, it is found that neither Abell 520 data set can conclusively determine the physicality of such dark cores at $99{{\ \rm per\ cent}}$ confidence. However, in both cases the recovered MAP estimators are consistent with both sets of data.

Price, M. A.↗
DOE OSTI2020

Where did the tumor start? An inverse solver with sparse localization for tumor growth models

In this work, we present a numerical scheme for solving an inverse problem for parameter estimation in tumor growth models for glioblastomas, a form of aggressive primary brain tumor. The growth model is a reaction–diffusion partial differential equation (PDE) for the tumor concentration. We use a PDE-constrained optimization formulation for the inverse problem. The unknown parameters are the reaction coefficient (proliferation), the diffusion coefficient (infiltration), and the initial condition field for the tumor PDE. Segmentation of magnetic resonance imaging (MRI) scans drive the inverse problem where segmented tumor regions serve as partial observations of the tumor concentration. Like most cases in clinical practice, we use data from a single time snapshot. Moreover, the precise time relative to the initiation of the tumor is unknown, which poses an additional difficulty for inversion. We perform a frozen-coefficient spectral analysis and show that the inverse problem is severely ill-posed. We introduce a biophysically motivated regularization on the structure and magnitude of the tumor initial condition. In particular, we assume that the tumor starts at a few locations (enforced with a sparsity constraint on the initial condition of the tumor) and that the initial condition magnitude in the maximum norm is equal to one. We solve the resulting optimization problem using an inexact quasi-Newton method combined with a compressive sampling algorithm for the sparsity constraint. Our implementation uses PETSc and AccFFT libraries. We conduct numerical experiments on synthetic and clinical images to highlight the improved performance of our solver over a previously existing solver that uses standard two-norm regularization for the calibration parameters. The existing solver is unable to localize the initial condition. Our new solver can localize the initial condition and recover infiltration and proliferation. In clinical datasets (for which the ground truth is unknown), our solver results in qualitatively different solutions compared to the two-norm regularized solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Performance of reanalysis and mesoscale models off the coast of Hawai'i

The eastern Hawai'i coast in the United States is characterized by considerable wind resource fuelled by persistent trade winds, making it an important area for energy research. The need is strong for reanalyses and higher-resolution regional simulations where observations have been historically limited, such as Hawai'i's offshore environments. However, studies using offshore observations in other parts of the world have shown that significant errors can occur in reanalyses and wind datasets, which can lead to inaccurate estimates of wind energy generation, payback periods, and extreme weather risks at project locations. The degree of such errors is influenced by a number of factors, including spatial resolution and the handling of processes within the planetary boundary layer (PBL). In this work, we provide a wind resource characterization from year-long lidar buoy measurements off the eastern coast of O'ahu, Hawai'i, an environment previously unobserved at the rotor level, and use the characterization to evaluate the performance of two simulation datasets. The O'ahu deployment location is meteorologically unique and less complex than land-based wind resource characterizations, being strongly characterized by trade winds with minimal land–atmosphere interaction influences. Despite the unique and fairly consistent meteorological conditions, we hypothesize that distinct simulation datasets will exhibit diverse ranges of errors similar to those that have been seen for other offshore locations. We find the European Centre for Medium-Range Weather Forecasts (ECMWF) Reanalysis version 5 (ERA5) to strongly underestimate observed wind speeds at the O'ahu location (bias = −1.54 m s −1 at a height of 140 m above sea level), while a regional Weather Research and Forecasting Model (WRF) simulation produced by the University of Hawai'i (UH-WRF) provides a significantly smaller wind speed bias (−0.25 m s −1 ), highlighting the value of running regional, higher-resolution simulations. The large bias noted for ERA5 is driven by significant underestimation of fast wind speeds (>9 m s −1 ), which the study site is largely characterized by, along with discontinuities in the ERA5 diurnal cycle. We also speculate that the relative sparsity of observations for data assimilation in this remote part of the world could influence the performance of ERA5 and that challenges with characterizing island effects could impact the performance of both datasets.

17 WIND ENERGY↗