Search NASA⌕ Search

SEARCH · Search NASA

Results for “Sparsity”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Processes contributing to cloud dissipation and formation events on the North Slope of Alaska

Abstract. Clear-sky periods across the high latitudes have profound impacts on the surface energy budget and lower atmospheric stratification; however an understanding of the atmospheric processes leading to low-level cloud dissipation and formation events is limited. A method to identify clear periods at Utqiaġvik (formerly Barrow), Alaska, during a 5-year period (2014–2018) is developed. A suite of remote sensing and in situ measurements from the high-latitude observatory are analyzed; we focus on comparing and contrasting atmospheric properties during low-level (below 2 km) cloud dissipation and formation events to understand the processes controlling clear-sky periods. Vertical profiles of lidar backscatter suggest that aerosol presence across the lower atmosphere is relatively invariant during the periods bookending clear conditions, which suggests that a sparsity of aerosol is not frequently a cause for cloud dissipation on the North Slope of Alaska. Further, meteorological analysis indicates two active processes ongoing that appear to support the formation of low clouds after a clear-sky period: namely, horizontal advection, which was dominant in winter and early spring, and quiescent air mass modification, which was dominant in the summer. During summer, the dominant mode of cloud formation is a low cloud or fog layer developing near the surface. This low cloud formation is driven largely by air mass modification under relatively quiescent synoptic conditions. Near-surface aerosol particles concentrations changed by a factor of 2 around summer formation events. Thermodynamic adjustment and increased aerosol presence under quiescent atmospheric conditions are hypothesized as important mechanisms for fog formation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Reassessing long-standing meteorological records: an example using the national hottest day in Ireland

This analysis highlights the potential value in reanalysing early national meteorological records from around the world. These were oftentimes measured via techniques that preceded standardisation of instrumentation and methods of observation and thus could be subject to considerable biases and uncertainties. This analysis uses the techniques pioneered by WMO record assessment teams. The highest currently recognised air temperature (33.3 °C) ever recorded in the Republic of Ireland was logged at Kilkenny Castle in 1887. The original observational record however no longer exists. Given that Ireland is now the only country in Europe to have a national heat record that was set in the 19th century, a reassessment of the verity of this record is both timely and valuable. The present analysis undertakes a fundamental reassessment of the plausibility of the 1887 temperature record using methods similar to those used to assess various weather extremes under WMO auspices over recent years. Specifically, we undertake an inter-station reassessment using sparse available records and make recourse to the new and improved 20CRv3 sparse-input reanalysis product. Neither surrounding available stations nor the reanalysis offer substantive support for the Kilkenny record of 33.3 °C being correct. Moreover, recent data rescue efforts have uncovered several earlier extreme values, one of which exceeds the Kilkenny value (33.5 °C on 16 July 1876 recorded at the Phoenix Park). However, the sparsity of early observational networks, a distinct lack of synoptic support from 20CRv3 for many of the extreme heat values, and the fact that these measurements were obtained using non-standard exposures lead us to conclude that there is grossly insufficient evidence to support any of these 19th century extremes as robust national heat record candidates. Data from the early 20th century onwards benefit from a denser network of stations undertaking measurements in a more standardised manner, many under the direct auspices of Met Éireann and its predecessors, adhering to WMO guidance and protocols. This enables more robust cross-checking of records. We argue that the Met Éireann-recognised 20th century heat record from Boora in 1976 is verified as the most plausible robust national temperature record based upon the synoptic situation and comparisons with nearby neighbouring stations. This measurement of 32.5°C thus likely constitutes the highest reliably recorded temperature measurement in the Republic of Ireland. Ultimately, the formal decision on any reassessment and reassignment of the national record rests with the national meteorological service, Met Éireann.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

A clustering-based approach to ocean model–data comparison around Antarctica

The Antarctic Continental Shelf seas (ACSS) are a critical, rapidly changing element of the Earth system. Analyses of global-scale general circulation model (GCM) simulations, including those available through the Coupled Model Intercomparison Project, Phase 6 (CMIP6), can help reveal the origins of observed changes and predict the future evolution of the ACSS. However, an evaluation of ACSS hydrography in GCMs is vital: previous CMIP ensembles exhibit substantial mean-state biases (reflecting, for example, misplaced water masses) with a wide inter-model spread. Because the ACSS are also a sparely sampled region, grid-point-based model assessments are of limited value. Our goal is to demonstrate the utility of clustering tools for identifying hydrographic regimes that are common to different source fields (model or data), while allowing for biases in other metrics (e.g., water mass core properties) and shifts in region boundaries. We apply K-means clustering to hydrographic metrics based on the stratification from one GCM (Community Earth System Model version 2; CESM2) and one observation-based product (World Ocean Atlas 2018; WOA), focusing on the Amundsen, Bellingshausen and Ross seas. When applied to WOA temperature and salinity profiles, clustering identifies “primary” and “mixed” regimes that have physically interpretable bases. For example, meltwater-freshened coastal currents in the Amundsen Sea and a region of high-salinity shelf water formation in the southwestern Ross Sea emerge naturally from the algorithm. Both regions also exhibit clearly differentiated inner- and outer-shelf regimes. The same analysis applied to CESM2 demonstrates that, although mean-state model biases in water mass T–S characteristics can be substantial, using a clustering approach highlights that the relative differences between regimes and the locations where each regime dominates are well represented in the model. CESM2 is generally fresher and warmer than WOA and has a limited fresh-water-enriched coastal regimes. Given the sparsity of observations of the ACSS, this technique is a promising tool for the evaluation of a larger model ensemble (e.g., CMIP6) on a circum-Antarctic basis.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Efficient derivative computation for unsteady fatigue-constrained nonlinear aero-structural wind turbine blade optimization

Gradient-based optimization offers significant efficiency advantages for wind turbine blade design, but its application has often been limited by the cost and accuracy of finite-difference derivative calculations, especially when fatigue constraints are considered. In this work, we systematically compare and evaluate four differentiation techniques, namely algorithmic differentiation, implicit differentiation, sparsity exploitation, and parallelization, to determine their effectiveness in computing accurate gradients through time-domain aero-structural simulations. By integrating these techniques with unsteady nonlinear aerodynamic and structural models, we develop software designed for accurate gradient computation. We show that combining these techniques addresses memory and runtime challenges associated with long simulations required by design load cases. Specifically, the most effective combination reduces derivative computation wall time by over an order of magnitude compared to finite differencing while maintaining superior accuracy. We demonstrate this approach in a proof-of-concept aero-structural optimization of a wind turbine blade that improves the cost of energy by 12.78 %. This comparative study establishes a viable approach for fatigue-aware blade design that balances computational efficiency with modeling accuracy.

17 WIND ENERGY↗
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↗
DOE OSTI2021

New methods to improve the vertical extrapolation of near-surface offshore wind speeds

Accurate characterization of the offshore wind resource has been hindered by a sparsity of wind speed observations that span offshore wind turbine rotor-swept heights. Although public availability of floating lidar data is increasing, most offshore wind speed observations continue to come from buoy-based and satellite-based near-surface measurements. The aim of this study is to develop and validate novel vertical extrapolation methods that can accurately estimate wind speed time series across rotor-swept heights using these near-surface measurements. We contrast the conventional logarithmic profile against three novel approaches: a logarithmic profile with a long-term stability correction, a single-column model, and a machine-learning model. These models are developed and validated using 1 year of observations from two floating lidars deployed in US Atlantic offshore wind energy areas. We find that the machine-learning model significantly outperforms all other models across all stability regimes, seasons, and times of day. Machine-learning model performance is considerably improved by including the air–sea temperature difference, which provides some accounting for offshore atmospheric stability. Finally, we find no degradation in machine-learning model performance when tested 83 km from its training location, suggesting promising future applications in extrapolating 10 m wind speeds from spatially resolved satellite-based wind atlases.

17 WIND ENERGY↗
DOE OSTI2020

Graph Neural Networks for Particle Reconstruction in High Energy Physics detectors

Pattern recognition problems in high energy physics are notably different from traditional machine learning applications in computer vision. Reconstruction algorithms identify and measure the kinematic properties of particles produced in high energy collisions and recorded with complex detector systems. Two critical applications are the reconstruction of charged particle trajectories in tracking detectors and the reconstruction of particle showers in calorimeters. These two problems have unique challenges and characteristics, but both have high dimensionality, high degree of sparsity, and complex geometric layouts. Graph Neural Networks (GNNs) are a relatively new class of deep learning architectures which can deal with such data effectively, allowing scientists to incorporate domain knowledge in a graph structure and learn powerful representations leveraging that structure to identify patterns of interest. In this work we demonstrate the applicability of GNNs to these two diverse particle reconstruction problems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Rapid Memory Footprint Access Diagnostics

Footprint and reuse distance measure temporal locality and therefore do not capture the significance of access patterns (spacial locality). A strided access pattern has the largest possible footprint but usually has the best performance. To highlight exposed memory latency, we separate footprint into strided (prefetchable) and irregular (non-prefetchable) access components and calculate the growth rate of each. To rapidly compute these footprint access diagnostics, we present two methods, whole-program and precise. Current footprint analyses can cause 200× or more slowdown with realistic inputs and are therefore impractical. Our whole-program method reduces the overhead to 10% by computing upper bounds, but still yields inter-procedural insight through a call path profile. Our precise method uses additional static analysis and profiling to refine the upper bounds for intra-procedural loop nests. We evaluate our approaches using benchmarks that vary access patterns (strided \vs unpredictable), sparsity (all words in a cache line \vs some), and reuse (varying and repeated accesses per element). Notably, for loop nests with unpredictable accesses, the precise method's accuracy is within 10% of ideal. The whole-program method has sufficient accuracy to diagnose bottlenecks.

data locality, memory footprint, footprint access ↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Optimal Transport for Super Resolution Applied to Astronomy Imaging

Super resolution is an essential tool in optics, especially on interstellar scales, due to physical laws restricting possible imaging resolution. We propose using optimal transport and entropy for super resolution applications. We prove that the reconstruction is accurate when sparsity is known and noise or distortion is small enough. We prove that the optimizer is stable and robust to noise and perturbations. We compare this method to a state of the art convolutional neural network and get similar results for much less computational cost and greater methodological flexibility.

Rawson, Michael G.↗
DOE OSTI2023

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↗
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
DOE OSTI2024

Deep Nonparametric Estimation of Operators between Infinite Dimensional Spaces

Learning operators between infinitely dimensional spaces is an important learning task arising in machine learning, imaging science, mathematical modeling and simulations, etc. This paper studies the nonparametric estimation of Lipschitz operators using deep neural networks. Non-asymptotic upper bounds are derived for the generalization error of the empirical risk minimizer over a properly chosen network class. Under the assumption that the target operator exhibits a low dimensional structure, our error bounds decay as the training sample size increases, with an attractive fast rate depending on the intrinsic dimension in our estimation. Our assumptions cover most scenarios in real applications and our results give rise to fast rates by exploiting low dimensional structures of data in operator estimation. We also investigate the influence of network structures (e.g., network width, depth, and sparsity) on the generalization error of the neural network estimator and propose a general suggestion on the choice of network structures to maximize the learning efficiency quantitatively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Why Is Attention Sparse In Particle Transformer?

Transformer-based models have achieved state-of-the-art performance in jet tagging at the CERN Large Hadron Collider (LHC), with the Particle Transformer (ParT) representing a leading example of such models. A striking feature of ParT is its sparse, nearly binary, attention structure, raising questions about the origin of this behavior and whether it encodes physically meaningful correlations. In this work, we investigate the source of ParT's sparse attention by comparing models trained on multiple benchmark datasets and examine the relative contributions of the attention term and the physics-inspired interaction matrix before softmax. We find that binary sparsity arises primarily from the attention mechanism itself, with the interaction matrix playing a secondary role. Moreove, we show that ParT is able to identify key jet substructure elements, such as leptons in semileptonic top decays, even without explicit particle identification inputs. These results provide new insight into the interpretability of transformer-based jet taggers and clarify the conditions under which sparse attention patterns emerge in ParT.

Legge, Timothy [UC, San Diego]↗
DOE OSTI2020

Inverse point source location with the Helmholtz equation on a bounded domain

The problem of recovering acoustic sources, more specifically monopoles, from point-wise measurements of the corresponding acoustic pressure at a limited number of frequencies is addressed. To this purpose, a family of sparse optimization problems in measure space in combination with the Helmholtz equation on a bounded domain is considered in this study. A weighted norm with unbounded weight near the observation points is incorporated into the formulation. Optimality conditions and conditions for recovery in the small noise case are discussed, which motivates concrete choices of the weight. The numerical realization is based on an accelerated conditional gradient method in measure space and a finite element discretization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Linear convergence of accelerated conditional gradient algorithms in spaces of measures

A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding coefficients. Under general assumptions, a sub-linear [see formula in PDF] rate in the objective functional is obtained, which is sharp in most cases. To improve efficiency, one can fully resolve the finite-dimensional subproblems occurring in each iteration of the method. We provide an analysis for the resulting procedure: under a structural assumption on the optimal solution, a linear [see formula in PDF] convergence rate is obtained locally.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗