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,639 records · Page 91

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗

Nonnegative canonical tensor decomposition with linear constraints: nnCANDELINC

Abstract There is an emerging interest for tensor factorization applications in big‐data analytics and machine learning. To speed up the factorization of extra‐large datasets, organized in multidimensional arrays (also known as tensors), easy to compute compression‐based tensor representations, such as, Tucker and tensor train formats, are used to approximate the initial large‐tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, often additional constraints need to be imposed, which lead us to canonical decomposition with linear constraints (CANDELINC), a canonical polyadic decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a preprocessing step, which lead to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank of a tensor to its Tucker core and comparing the real valued to nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real‐world examples.

97 MATHEMATICS AND COMPUTING↗

Sensitivity Analysis and Stochastic Simulations of Non-equilibrium Plasma Flow

We study parametric uncertainties involved in plasma flows and apply stochastic sensitivity analysis to rank the importance of all inputs to guide large-scale stochastic simulations. Specifically, we employ different gradient-based sensitivity methods, namely Morris, multi-element probabilistic collocation method (ME-PCM) on sparse grids, Quasi-Monte Carlo, and Monte Carlo methods. These approaches go beyond the standard ``One-At-a-Time" sensitivity analysis and provide a measure of the nonlinear interaction effects for the uncertain inputs. The objective is to perform systematic stochastic simulations of plasma flows treating only as {\em stochastic processes} the inputs with the highest sensitivity index, hence reducing substantially the computational cost. Two plasma flow examples are presented to demonstrate the capability and efficiency of the stochastic sensitivity analysis. The first one is a two-fluid model in a shock tube while the second one is a one-fluid/two-temperature model in flow past a cylinder.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Educating local radial basis functions using the highest gradient of interest in three dimensional geometries: EDUCATING LOCALIZED RBF-SCHEMES

We present a novel methodology to effectively localize radial basis function approximation methods in three dimensions. The local scheme requires shape parameter-dependent functions that can be used to approximate gradients of scattered data and to solve partial differential operators. The optimum shape parameter is obtained from the highest gradient of interest, where a known analytical function, when boundary conditions are not present, or a shape parameter-free global approximation are used to educate the localized scheme. The later option is applicable to problems where the operator needs to be solved multiple times, like in time evolution or stochastic integration. Past shape parameter's optimizations, for two-dimensional domains, based on the condition number of the interpolant matrix, were unable to provide satisfactory approximations. The applicability of our method is illustrated in the context of an analytical expression interpolation and during a Ginzburg-Landau relaxation of a free energy functional. In general, the optimum shape parameter depends on geometry, node distribution, and density, whereas the approximation errors decrease as the node density and the local stencil size increase. The effective localization of radial basis functions motivates its use in moving boundary problems and accelerates solutions through sparse matrix solvers.

free energy functional↗

A matrix-free approach for finite-strain hyperelastic problems using geometric multigrid

This paper investigates matrix-free algorithms for problems in quasi-static finite-strain hyperelasticity. Iterative solvers with matrix-free operator evaluation have emerged as an attractive alternative to sparse matrices in the fluid dynamics and wave propagation communities because they significantly reduce the memory traffic, the limiting factor in classical finite element solvers. Specifically, we study different matrix-free realizations of the finite element tangent operator and determine whether generalized methods of incorporating complex constitutive behavior might be feasible. Furthermore, in order to improve the convergence behavior of iterative solvers, we also propose a method by which to construct level tangent operators and employ them to define a geometric multigrid preconditioner. Additionally, the performance of the matrix-free operator and the geometric multigrid preconditioner is compared to the matrix-based implementation with an algebraic multigrid (AMG) preconditioner on a single node for a representative numerical example of a heterogeneous hyperelastic material in two and three dimensions. We find that matrix-free methods for finite-strain solid mechanics are very promising, outperforming linear matrix-based schemes by two to five times, and that it is possible to develop numerically efficient implementations that are independent of the hyperelastic constitutive law.

42 ENGINEERING↗

Accurate data-driven surrogates of dynamical systems for forward propagation of uncertainty

Stochastic collocation (SC) is a well-known non-intrusive method of constructing surrogate models for uncertainty quantification. In dynamical systems, SC is especially suited for full-field uncertainty propagation that characterizes the distributions of the high-dimensional solution fields of a model with stochastic input parameters. However, due to the highly nonlinear nature of the parameter-to-solution map in even the simplest dynamical systems, the constructed SC surrogates are often inaccurate. Here, this work presents an alternative approach, where we apply the SC approximation over the dynamics of the model, rather than the solution. By combining the data-driven sparse identification of nonlinear dynamics framework with SC, we construct dynamics surrogates and integrate them through time to construct the surrogate solutions. We demonstrate that the SC-over-dynamics framework leads to smaller errors, both in terms of the approximated system trajectories as well as the model state distributions, when compared against full-field SC applied to the solutions directly. We present numerical evidence of this improvement using three test problems: a chaotic ordinary differential equation, and two partial differential equations from solid mechanics.

42 ENGINEERING↗

Physics-Informed Active Learning With Simultaneous Weak-Form Latent Space Dynamics Identification

The parametric greedy latent space dynamics identification (gLaSDI) framework has demonstrated promising potential for accurate and efficient modeling of high-dimensional nonlinear physical systems. However, it remains challenging to handle noisy data. Here, to enhance robustness against noise, we incorporate the weak-form estimation of nonlinear dynamics (WENDy) into gLaSDI. In the proposed weak-form gLaSDI (WgLaSDI) framework, an autoencoder and WENDy are trained simultaneously to discover intrinsic nonlinear latent-space dynamics of high-dimensional data. Compared with the standard sparse identification of nonlinear dynamics (SINDy) employed in gLaSDI, WENDy enables variance reduction and robust latent space discovery, therefore leading to more accurate and efficient reduced-order modeling. Furthermore, the greedy physics-informed active learning in WgLaSDI enables adaptive sampling of optimal training data on the fly for enhanced modeling accuracy. The effectiveness of the proposed framework is demonstrated by modeling various nonlinear dynamical problems, including viscous and inviscid Burgers' equations, time-dependent radial advection, and the Vlasov equation for plasma physics. With data that contains 5%–10% Gaussian white noise, WgLaSDI outperforms gLaSDI by orders of magnitude, achieving 1%–7% relative errors. Compared with the high-fidelity models, WgLaSDI achieves 121 to 1779x speed-up.

97 MATHEMATICS AND COMPUTING↗

Informing forest carbon inventories under the Paris Agreement using ground-based forest monitoring data

Human interactions with forests have shaped Earth's climate for millennia and will continue to do so as we target net-zero emission goals. Accurately characterizing these climate impacts requires making reliable forest carbon data available for forest monitoring and planning. Here, we develop a semi-automated process for submitting forest carbon measurements from the largest relevant scientific database to the International Panel on Climate Change's Emission Factor Database, which currently has sparse forest carbon data. Building this bridge from scientific research to international policy is an important step towards managing forests in a net-zero motivated future. Humans have been influencing Earth's climate via transformative impacts on forests for millennia, and forests are now recognized as critical to climate change mitigation under the Paris Agreement. The efficacy of climate change mitigation planning and reporting depends on quality data on forest carbon (C) stocks and changes. The Emission Factor Database (EFDB) of the International Panel on Climate Change (IPCC) is intended to be a definitive source for such data, but needs comprehensive and well-documented data to be so. To facilitate submission of forest C estimates from scientific studies to EFDB, we develop and document a process for semi-automated data submission from the Global Forest C database (ForC v4.0), which is the largest compilation of ground-based forest C estimates. We then assess the data currently available through ForC and provide recommendations for improving forest data collection, analysis, and reporting. As of September 2024, ForC contained ~19,286 records potentially relevant to EFDB, 1068 of which had been submitted and posted to EFDB. These represented 19% of the total EFDB records for forest land. Records were unevenly distributed across variables and geographic regions. ForC records (37%) reviewed could not be submitted because the original publication lacked required information. In the future, ground-based forest C estimates should target gaps in the record, and studies should ensure that they report all information necessary for inclusion in EFDB. Given that climate change is rapidly impacting the world's forests, timely reporting of recent estimates will be critical to accurate forest C inventories.

54 ENVIRONMENTAL SCIENCES↗

On the Search for Low W 0

The magnitude of the vacuum expectation value of the Gukov-Vafa-Witten superpotential |W o | plays a central role in the phenomenology of type IIB flux compactifications. Recent analytical constructions have shown that perturbatively flat vacua can be used to obtain very low values of |W o |. We present systematic algorithms to carry out exhaustive numerical searches for such vacua. Here we also analyse them in the statistical context, as part of the entire ensemble of type IIB flux vacua at low |W o |. Our preliminary analysis indicates that these perturbatively flat vacua are statistically sparse in the whole set of vacua at low |W o | as calculated by Denef and Douglas. Two-moduli examples are used to illustrate these more general findings in specific settings. We find that these simple (two moduli) cases are good examples for existence proofs but they do not feature a large statistical tuning freedom for phenomenological applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Probing eddy size and its effective mixing length in stably stratified roughness sublayer flows

Stably stratified roughness sublayer flows are ubiquitous yet remain difficult to represent in models and to interpret using field experiments. Here, continuous high-frequency potential temperature profiles from the forest floor up to 6.5 times the canopy height observed with distributed temperature sensing (DTS) are used to link eddy topology to roughness sublayer stability correction functions and coupling between air layers within and above the canopy. The experiments are conducted at two forest stands classified as hydrodynamically sparse and dense. Near-continuous profiles of eddy sizes (length scales) and effective mixing lengths for heat are derived from the observed profiles using a novel conditional sampling approach. The approach utilizes potential temperature isoline fluctuations from a statically stable background state. The transport of potential temperature by an observed eddy is assumed to be conserved (adiabatic movement) and we assume that irreversible heat exchange between the eddy and the surrounding background occurs along the (vertical) periphery of the eddy. This assumption is analogous to Prandtl's mixing-length concept, where momentum is transported rapidly vertically and then equilibrated with the local mean velocity gradient. A distinct dependence of the derived length scales on background stratification, height above ground, and canopy characteristics emerges from the observed profiles. Implications of these findings for (1) the failure of Monin–Obukhov similarity in the roughness sublayer and (2) above-canopy flow coupling to the forest floor are examined. The findings have practical applications in terms of analysing similar DTS data sets with the proposed approach, modelling roughness sublayer flows, and interpreting nocturnal eddy covariance measurements above tall forested canopies.

54 ENVIRONMENTAL SCIENCES↗

Influence plots for LASSO

With many predictors in regression, fitting the full model can induce multicollinearity problems. Least Absolute Shrinkage and Selection Operation (LASSO) is useful when the effects of many explanatory variables are sparse in a high-dimensional dataset. Influential points can have a disproportionate impact on the estimated values of model parameters. Here, this paper describes a new influence plot that can be used to increase understanding of the contributions of individual observations and the robustness of results. This can serve as a complement to other regression diagnostics techniques in the LASSO regression setting. Using this influence plot, we can find influential points and their impact on shrinkage of model parameters and model selection. Lastly, we provide two examples to illustrate the methods.

97 MATHEMATICS AND COMPUTING↗

Assessing robustness of factor ranking for supersaturated designs

Supersaturated designs can potentially be a beneficial tool for efficiently exploring a large number of factors with a moderately sized design. However, because more factors are being considered than there are runs, the stability of the identified factors depends heavily on effect sparsity and the lack of highly influential observations. A helpful tool for the analysis of supersaturated designs is least absolute shrinkage and selection operation (LASSO), which is useful when the effects of many explanatory variables are sparse in a high-dimensional dataset. To understand the impact of individual observations on the selected factors, the LASSO influence plot was created. This work describes an application of this plot and its variants that can be used to identify influential points, increase understanding of the impact of individual observations on model parameters, and the robustness of results in analyses with supersaturated designs. These graphical methods can serve as a complement to other regression diagnostics techniques in the LASSO regression setting.

3-D LASSO influence plots↗

Dispersion-enhanced sequential batch sampling for adaptive contour estimation

In computer simulation and optimal design, sequential batch sampling offers an appealing way to iteratively stipulate optimal sampling points based upon existing selections and efficiently construct surrogate modeling. Nonetheless, the issue of near duplicates poses tremendous quandary for sequential learning. It refers to the situation that selected critical points cluster together in each sampling batch, which are individually but not collectively informative towards the optimal design. Near duplicates severely diminish the computational efficiency as they barely contribute extra information towards update of the surrogate. To address this issue, we impose a dispersion criterion on concurrent selection of sampling points, which essentially forces a sparse distribution of critical points in each batch, and demonstrate the effectiveness of this approach in adaptive contour estimation. Specifically, we adopt Gaussian process surrogate to emulate the simulator, acquire variance reduction of the critical region from new sampling points as a dispersion criterion, and combine it with the modified expected improvement (EI) function for critical batch selection. The critical region here is the proximity of the contour of interest. This proposed approach is vindicated in numerical examples of a two-dimensional four-branch function, a four-dimensional function with a disjoint contour of interest and a time-delay dynamic system.

97 MATHEMATICS AND COMPUTING↗

Modeling the effects of river flow on population dynamics of piping plovers (Charadrius melodus) and least terns (Sternula antillarum) nesting on the Missouri River

Humans make extensive use of rivers and floodplains for economic benefits including agriculture, hydropower, commerce and recreation. Economic development of floodplains subsequently requires control of river levels to avoid flood damage. This process began in the Missouri River basin in the 1890s with the construction of a series of hydropower dams in Montana and escalated to new levels with the approval of the Pick-Sloan plan in the 1944 Flood Control Act. Maximizing these human uses of the river led to changes in and losses of hydrological and ecological processes, ultimately resulting in the federal listing of three fish and wildlife species under the Endangered Species Act: the pallid sturgeon (Scaphirhyncus albus; 1983), the piping plover (Charadrius melodus; 1984), and the interior population of least tern (Sternula antillarum; 1985). The listing of terns and plovers did not affect river management until the United States Army Corps of Engineers (USACE) proposed to modify the governing document of the Missouri River Mainstem System, the Master Manual, a process which was completed in 2003. Although there was little disagreement over the habitat conditions that terns and plovers used for nesting, there was substantial disagreement over the amount of habitat necessary for terns and plovers to meet population recovery goals. Answering this question requires forecasting species-specific population responses to dynamic habitat affected by both human actions (reservoir management and habitat restoration) and natural variability in precipitation. Piping plovers and least terns nest along the Missouri River from Fort Peck, Montana to just north of Sioux City, Iowa (Figure 1). Both species prefer to nest on sand and fine gravel substrates with no or sparse vegetation cover (Prindiville Gaines and Ryan, 1988; Sherfy et al., 2012), such as riverine sandbars (emergent sandbar habitat; ESH). Piping plovers also nest on reservoir shorelines that lack vegetation cover (Anteau et al., 2012). The amount of ESH available for nesting in a given year is strongly affected by the amount of water entering the Missouri River system through precipitation and the management of water flow from six reservoirs operated by the USACE on the mainstem Missouri River. Prior to the construction of dams, the Missouri River experienced bimodal peak flows in spring and early summer in concordance with the melting of plains and mountain snowpack (Galat and Lipkin, 2000). Flows decreased during summer months, with river stage then dependent upon rainfall. The combination of consistent high flows and occasional extreme high flows, together with the meandering characteristic of the river, regularly reshaped and scoured vegetation from ESH.

adaptive management↗

Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers

High–dimensional datasets are becoming ubiquitous in many applications and therefore unsupervised tensor methods to interrogate them are needed. Here, we report a new unsupervised machine learning (ML) approach (NTFk) based on nonnegative tensor factorization integrated with a custom k–means clustering. We demonstrate the ability of NTFk to extracting temporal and spatial features of phase separation of copolymers as they are modeled by self–consistent field theory. Microphase separation of block copolymers has been extensively studied both experimentally and theoretically. However, the interpretation of computer simulations and/or experimental data, representing temporal and spatial changes of molecular species concentration is still a challenging task. Thus, extracting the phase diagram from simulations or experimental data as well as the interpretation of data requires discernment of the model/experimental parameters (such as, temperature, concentrations, the number of molecular species and the interaction between species) impact on the microphase separation process. An attractive and unique aspect of the introduced ML method is that it ensures the nonnegativity of the extracted latent features. Nonnegativity is an essential constraint needed to obtain interpretable and sparse latent features that are parts–based representation of the data. The custom clustering in NTFk serves to estimate the number of latent features in the data.

97 MATHEMATICS AND COMPUTING↗

Interactive volumetric segmentation for textile micro-tomography data using wavelets and nonlocal means

This work addresses segmentation of volumetric images of woven carbon fiber textiles from micro-tomography data. We propose a semi-supervised algorithm to classify carbon fibers that requires sparse input as opposed to completely labeled images. The main contributions are: (a) design of effective discriminative classifiers, for three-dimensional textile samples, trained on wavelet features for segmentation; (b) coupling of previous step with nonlocal means as simple, efficient alternative to the Potts model; and (c) demonstration of reuse of classifier to diverse samples containing similar content. We evaluate our work by curating test sets of voxels in the absence of a complete ground truth mask. The algorithm obtains an average 0.95 F1 score on test sets and average F1 score of 0.93 on new samples. Finally, we conclude with discussion of failure cases and propose future directions toward analysis of spatiotemporal high-resolution micro-tomography images.

3D image processing↗

Out With the Old: Empirical Trends in U.S. Land‐Based Wind Turbine Decommissioning and Repowering

A growing number of wind turbines (WTs) across the globe are now reaching or exceeding their expected service lifetime; WT decommissioning is on the rise. Accordingly, questions pertaining to WT end-of-life have risen in importance in policy and practice. Yet, research on the various factors relating to WT decommissioning is relatively sparse. Moreover, the key assumptions underpinning that prior research (e.g., the lifespan of WTs, characteristics of WTs being decommissioned, and whether the site is repowered with new WTs) have never been empirically tested across a large set of decommissioned WTs. Leveraging a uniquely comprehensive and spatially explicit dataset of decommissioned WTs in the United States, this research analyzes spatial, technological, and temporal trends in WT decommissioning and develops a novel predictive model for WT decommissioning. Our analysis pinpoints more than 12,400 WTs that have been fully decommissioned in the United States., the majority of which have been relatively old (> 30 years) and small (< 200 kW). While a WT's age alone is a good predictor of the likelihood of decommissioning, other factors such as the size of the WT and recent performance are also important and significant predictors. Most sites where decommissioning has occurred have seen subsequent repowering, with repowered plants featuring substantially fewer WTs (−86 on average) and higher rated plant capacity (+62 MW on average). Many existing WTs in the U.S. are approaching the end of their expected life with roughly 7500 being 20 or more years old. Findings can help policymakers and stakeholders begin preparing for this potential wave of future decommissioning and repowering.

Decommissioning / End-of-life↗