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 1,225 records · Page 68

Feeder Power Disaggregation: A Data-Efficient Matrix Completion Approach

This paper presents a data-driven algorithm for the feeder power disaggregation problem in distribution systems. Leveraging spatio-temporal power patterns in residential homes, residential power is discomposed into three components: sparse-switching loads, periodic loads, and photovoltaic (PV) generation, which are characterized through the design of two sparse matrices and a low-rank matrix. The matrix completion process is data-efficient because of the matrix sparsity and low rankness, along with the use of power system models. The proposed approach is tested using real-world residential data set on a 33-bus distribution system, demonstrating accurate power disaggregation with efficient matrix completion.

distribution system↗

Online Voltage Event Detection Using Synchrophasor Data with Structured Sparsity-Inducing Norms

This paper develops an accurate and computationally efficient data-driven framework to detect voltage events from PMU data streams. It develops an innovative Proximal Bilateral Random Projection (PBRP) algorithm to quickly decompose the PMU data matrix into a low-rank matrix, a row-sparse event-pattern matrix and a noise matrix. Here, the row-sparse pattern matrix significantly distinguishes events from normal behavior. These matrices are then fed into a clustering algorithm to separate voltage events from normal operating conditions. Large-scale numerical study results on real-world PMU data show that the proposed algorithm is computationally more efficient and achieves higher F scores than state-of-the-art benchmarks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling

Here, we present a sparse linear system solver that is based on a multifrontal variant of Gaussian elimination and exploits low-rank approximation of the resulting dense frontal matrices. We use hierarchically semiseparable (HSS) matrices, which have low-rank off-diagonal blocks, to approximate the frontal matrices. For HSS matrix construction, a randomized sampling algorithm is used together with interpolative decompositions. The combination of the randomized compression with a fast ULV HSS factoriz ation leads to a solver with lower computational complexity than the standard multifrontal method for many applications, resulting in speedups up to 7 fold for problems in our test suite. The implementation targets many-core systems by using task parallelism with dynamic runtime scheduling. Numerical experiments show performance improvements over state-of-the-art sparse direct solvers. The implementation achieves high performance and good scalability on a range of modern shared memory parallel systems, including the Intel Xeon Phi (MIC). The code is part of a software package called STRUMPACK - STRUctured Matrices PACKage, which also has a distributed memory component for dense rank-structured matrices.

97 MATHEMATICS AND COMPUTING↗

A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications

A new class of distance-two interpolation methods for algebraic multigrid (AMG) that can be formulated in terms of sparse matrix-matrix multiplications is presented and analyzed. Compared with similar distance-two prolongation operators, the proposed algorithms exhibit improved efficiency and portability to various computing platforms, since they allow one to easily exploit existing high-performance sparse matrix kernels. The new interpolation methods have been implemented in hypre, a widely used parallel multigrid solver library. With the proposed interpolations, the overall time of hypre's BoomerAMG setup can be considerably reduced, while sustaining equivalent, sometimes improved, convergence rates. Numerical results for a variety of test problems on parallel machines are presented that support the superiority of the proposed interpolation operators over the existing ones in hypre.

97 MATHEMATICS AND COMPUTING↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors

Hierarchical models with gamma hyperpriors provide a flexible, sparse-promoting framework to bridge L 1 and L 2 regularizations in Bayesian formulations to inverse problems. Despite the Bayesian motivation for these models, existing methodologies are limited to maximum a posteriori estimation. The potential to perform uncertainty quantification has not yet been realized. This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement. In addition, it lends itself naturally to conduct model selection for the choice of hyperparameters. Here, we illustrate the performance of our methodology in several computed examples, including a deconvolution problem and sparse identification of dynamical systems from time series data.

Bayesian shrinkage↗

Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. Furthermore, this is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this article, we present a performance study of an enlarged Krylov method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.

97 MATHEMATICS AND COMPUTING↗

Compressed basis GMRES on high-performance graphics processing units

Krylov methods provide a fast and highly parallel numerical tool for the iterative solution of many large-scale sparse linear systems. To a large extent, the performance of practical realizations of these methods is constrained by the communication bandwidth in current computer architectures, motivating the investigation of sophisticated techniques to avoid, reduce, and/or hide the message-passing costs (in distributed platforms) and the memory accesses (in all architectures). This article leverages Ginkgo’s memory accessor in order to integrate a communication-reduction strategy into the (Krylov) GMRES solver that decouples the storage format (i.e., the data representation in memory) of the orthogonal basis from the arithmetic precision that is employed during the operations with that basis. Given that the execution time of the GMRES solver is largely determined by the memory accesses, the cost of the datatype transforms can be mostly hidden, resulting in the acceleration of the iterative step via a decrease in the volume of bits being retrieved from memory. Together with the special properties of the orthonormal basis (whose elements are all bounded by 1), this paves the road toward the aggressive customization of the storage format, which includes some floating-point as well as fixed-point formats with mild impact on the convergence of the iterative process. We develop a high-performance implementation of the “compressed basis GMRES” solver in the Ginkgo sparse linear algebra library using a large set of test problems from the SuiteSparse Matrix Collection. We demonstrate robustness and performance advantages on a modern NVIDIA V100 graphics processing unit (GPU) of up to 50% over the standard GMRES solver that stores all data in IEEE double-precision.

97 MATHEMATICS AND COMPUTING↗

Gravity Gradiometry: A Novel Application for Compressed Sensing

During the past decade, compressed sensing (CS) has proven to be extremely useful for sparse signal reconstruction. Here the method of CS is applied to fast mass distribution determination based on cold atom gravity gradiometer measurements. Specifically we consider an array of M gradiometers placed around a 2D target area in order to determine the interior mass distribution in cases where the set of (M) sensor measurements under samples the distribution. This was done by assuming that the system’s sparsity comes from the mass distributions only having K non-zero masses, which led to a non-orthogonal basis dictionary. This lack of orthogonality caused interesting behaviors, including weakened noise performance, and breaking of the typical CS motivated logarithmic scaling of required M values for larger K values. However, for low K values M scaled as expected. Modifications to the gravity sensor model to promote orthogonality and test its impact on signal recovery postponed the onset of anomalous scaling; suggesting that lack of orthogonality is the primary cause. While CS works for this sparse, but intrinsically ill-posed problem, this sensor system displayed increased noise sensitivity and a smaller upper bound on the size of recoverable K sets. However, while these limitations decrease CS performance, significant improvements over traditional sensing approaches are still possible.

74 ATOMIC AND MOLECULAR PHYSICS↗

Feeder Power Disaggregation: A Data-Efficient Matrix Completion Approach: Preprint

This paper presents a data-driven algorithm for the feeder power disaggregation problem in distribution systems. Leveraging spatio-temporal power patterns in residential homes, residential power is discomposed into three components: sparse-switching loads, periodic loads, and photovoltaic generation, using two sparse matrices and a rank-one matrix. The matrix completion process is data-efficient because of the matrix sparsity and low rankness, along with the use of power system models. The proposed approach is tested using real-world residential datasets on a 33-bus distribution system, demonstrating accurate power disaggregation with efficient matrix completion.

distribution system↗

Computationally Robust Line Outage Detection and Identification in Three-Phase Networks

Detection and identification of individual phase outages remains a challenging problem due to insufficient metering in three-phase unbalanced power networks. This problem was tackled for the transmission systems in our previous work as documented in [1]. In this paper, this work is extended to detect phase outages in three-phase unbalanced systems using only the sparse estimation method. In addition, further improvements are introduced to increase the estimation accuracy for the virtual power injections at the terminal buses of disconnected lines, once the disconnected line is identified by sparse estimation methods. Simulation results are provided to experimentally validate the increased accuracy in detecting phase outages while decreasing the computational time by using the proposed approach.

Sparse Estimation, Line Outage, Phase Outage, LASS↗

Continuously amplified warming in the Alaskan Arctic: Implications for estimating global warming hiatus: SPATIAL COVERAGE AND BIAS IN TREND

Historically, in-situ measurements have been notoriously sparse over the Arctic. As a consequence, the existing gridded data of Surface Air Temperature (SAT) may have large biases in estimating the warming trend in this region. Using data from an expanded monitoring network with 31 stations in the Alaskan Arctic, we demonstrate that the SAT has increased by 2.19 °C in this region, or at a rate of 0.23 °C/decade during 1921-2015. Mean- while, we found that the SAT warmed at 0.71 °C/decade over 1998-2015, which is two to three times faster than the rate established from the gridded datasets. Focusing on the "hiatus" period 1998-2012 as identied by the Intergovernmental Panel on Climate Change (IPCC) report, the SAT has increased at 0.45 °C/decade, which captures more than 90% of the regional trend for 1951- 2012. We suggest that sparse in-situ measurements are responsible for underestimation of the SAT change in the gridded datasets. It is likely that enhanced climate warming may also have happened in the other regions of the Arctic since the late 1990s but left undetected because of incomplete observational coverage.

54 ENVIRONMENTAL SCIENCES↗

Calibration of the E3SM Land Model Using Surrogate‐Based Global Optimization

Abstract Calibration of the Energy Exascale Earth System Model (E3SM), land model (ELMv0) is challenging because of its model complexity, strong model nonlinearity, and significant computational requirements. Therefore, only a limited number of simulations can be allowed in any attempt to find a near‐optimal solution within an affordable time. The goal of this study is to calibrate some of the ELMv0 parameters to improve model projection of carbon fluxes. We propose a computationally efficient global optimization procedure using sparse‐grid based surrogates. We first use advanced sparse grid (SG) interpolation to construct a surrogate system of the ELMv0, and then calibrate the surrogate model in the optimization process. As the surrogate model is a polynomial whose evaluation is fast, it can be efficiently evaluated a sufficiently large number of times in the optimization, which facilitates the global search. We calibrate eight parameters against five years of net ecosystem exchange, total leaf area index, and latent heat flux data from the U.S. Missouri Ozark flux tower. The calibrated model is then used for predicting the three variables in the following 4 years. The results indicate that an accurate surrogate model can be created for the ELMv0 with a relatively small number of SG points, i.e., a few ELMv0 simulations that can be fully parallel. And, the application of the optimized parameters leads to a better model performance and a higher predictive capability than the default parameter values in the ELMv0.

54 ENVIRONMENTAL SCIENCES↗

From Isolated Ions to Multilayer Functional Materials Using Ion Soft Landing

The ability to deposit intact polyatomic ions with well-defined composition, charge state, and kinetic energy onto surfaces makes preparative mass spectrometry, also called ion soft-landing, particularly attractive for preparing uniform molecular and ionic layers. Early studies characterized structures, charge states, and reactivity of sparsely distributed soft-landed species. Recent development of high-flux ionization sources has opened up new opportunities for the precisely-controlled preparation of both two-dimensional assemblies and three-dimensional multilayer architectures using ion soft-landing. Previously unknown phenomena have been uncovered following deposition of large numbers of ions onto supports thereby opening several exciting research directions in this field. Furthermore, faster ion deposition has enabled fabrication of novel functional devices. This review discusses important phenomena and highlights key developments pertaining to preparation of well-defined interfaces for studies in energy storage, catalysis, soft materials, and biology.

Laskin, Julia↗

On‐site surrogates for large‐scale calibration

Abstract Motivated by a computer model calibration problem from the oil and gas industry, involving the design of a honeycomb seal, we develop a new Bayesian methodology to cope with limitations in the canonical apparatus stemming from several factors. We propose a new strategy of on‐site design and surrogate modeling for a computer simulator acting on a high‐dimensional input space that, although relatively speedy, is prone to numerical instabilities, missing data, and nonstationary dynamics. Our aim is to strike a balance between data‐faithful modeling and computational tractability in a calibration framework—tailoring the computer model to a limited field experiment. Situating our on‐site surrogates within the canonical calibration apparatus requires updates to that framework. We describe a novel yet intuitive Bayesian setup that carefully decomposes otherwise prohibitively large matrices by exploiting the sparse blockwise structure. Empirical illustrations demonstrate that this approach performs well on toy data and our motivating honeycomb example.

Huang, Jiangeng↗

Spatial and temporal variation in forest transpiration across a forested boreal peatland complex

Transpiration is a globally important component of evapotranspiration. Careful upscaling of transpiration from point measurements is thus crucial for quantifying water and energy fluxes. In spatially heterogeneous landscapes common across the boreal biome, upscaled transpiration estimates are difficult to determine due to variation in local environmental conditions (e.g., basal area, soil moisture, permafrost). Here, we sought to determine stand-level attributes that influence transpiration scalars for a forested boreal peatland complex consisting of sparsely treed wetlands and densely treed permafrost plateaus as land cover types. The objectives were to quantify spatial and temporal variability in stand-level transpiration, and to identify sources of uncertainty when scaling point measurements to the stand-level. Using heat ratio method sap flow sensors, we determined sap velocity for black spruce and tamarack for 2-week periods during peak growing season in 2013, 2017 and 2018. We found greater basal area, drier soils, and the presence of permafrost increased daily sap velocity in individual trees, suggesting that local environmental conditions are important in dictating sap velocity. When sap velocity was scaled to stand-level transpiration using gridded 20 × 20 m resolution data across the ~10 ha Scotty Creek ForestGEO plot, we observed significant differences in daily plot transpiration among years (0.17–0.30 mm), and across land cover types. Daily transpiration was lowest in grid-cells with sparsely treed wetlands compared to grid-cells with well-drained and densely treed permafrost plateaus, where daily transpiration reached 0.80 mm, or 30% of the daily evapotranspiration. When transpiration scalars (i.e., sap velocity) were not specific to the different land cover types (i.e., permafrost plateaus and wetlands), scaled stand-level transpiration was overestimated by 42%. To quantify the relative contribution of tree transpiration to ecosystem evapotranspiration, we recommend that sampling designs stratify across local environmental conditions to accurately represent variation associated with land cover types, especially with different hydrological functioning as encountered in rapidly thawing boreal peatland complexes.

54 ENVIRONMENTAL SCIENCES↗

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗

Sparsity Applications for Gradient‐Based Optimization of Wind Farms

Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.

17 WIND ENERGY↗