Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

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

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

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

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

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

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

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

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

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

Performance Improvements on SNS and HFIR Instrument Data Reduction Workflows Using Mantid

Performance of data reduction workflows at the High Flux Isotope Reactor (HFIR) and the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory (ORNL) is mainly determined by the time spent loading raw measurement events stored in large and sparse datasets. This paper describes: (1) our long-term view to leverage SNS and HFIR data management needs with our experience at ORNL’s world-class high performance computing (HPC) facilities, and (2) our short-term efforts to speed up current workflows using Mantid, a data analysis and reduction community framework used across several neutron scattering facilities. We show that minimally invasive short-term improvements in metadata management have a moderate impact in speeding up current production workflows. We propose a more disruptive domain-specific solution: the No Cost Input Output (NCIO) framework, we provide an overview, the risks and challenges in NCIO’s adoption by HFIR and SNS stakeholders.

Godoy, William↗
DOE OSTI2022

Just-in-Time Compilation and Link-Time Optimization for OpenMP Target Offloading

Following the mass adoption of external accelerators for high performance computing, the overall performance of many applications has become increasingly dependent on relatively small accelerated kernels. As static analysis is fundamentally limited by dynamic values and external definitions, standard ahead-of-time compilation is not always sufficient to achieve the best performance. Furthermore, many users looking to port an existing application to run on an external accelerator will not want to fundamentally restructure their programs. These and other problems can be addressed through both link-time optimization (LTO) and just-in-time (JIT) compilation, but until now had sparse and inconsistent support from the compiler. In this work, we present a new compilation method that enables device-side LTO as well as a transparent JIT compilation tool-chain for OpenMP target offloading. Our contributions include an entirely new device linking and embedding scheme to enable LTO as well as a novel JIT engine to efficiently optimize OpenMP offloading regions at run-time. We also introduce a persistent caching system to improve end-to-end runtime using the JIT engine and minimize kernel launching overheads. We measure the performance of our LTO and JIT implementation via several real-world scientific applications. With our optimizations we observe significant improvements through LTO on large applications as well as significant end-to-end execution time improvement using JIT.

Tian, Shilei↗
DOE OSTI2023

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗
DOE OSTI2025

A universal inequality on the unitary 2D CFT partition function

We prove the conjecture proposed by Hartman, Keller and Stoica (HKS) [1]: the grand-canonical free energy of a unitary 2D CFT with a sparse spectrum below the scaling dimension $\frac{c}{12}$ + ϵ and below the twist $\frac{c}{12}$ is universal in the large c limit for all β L β R ≠ 4π 2 . The technique of the proof allows us to derive a one-parameter (with parameter α ∈ (0, 1]) family of universal inequalities on the unitary 2D CFT partition function with general central charge c ⩾ 0, using analytical modular bootstrap. We derive an iterative equation for the domain of validity of the inequality on the (β L , β R ) plane. The infinite iteration of this equation gives the boundary of maximal-validity domain, which depends on the parameter α in the inequality.

AdS-CFT Correspondence↗
DOE OSTI2020

On the Virasoro six-point identity block and chaos

We study six-point correlation functions in two dimensional conformal field theory, where the six operators are grouped in pairs with equal conformal dimension. Assuming large central charge $c$ and a sparse spectrum, the leading contribution to this correlation function is the six-point Virasoro identity block - corresponding to each distinct pair of operators fusing into the identity and its descendants. We call this the star channel. One particular term in the star channel identity block is the stress tensor $SL(2,\mathbb{R})$ (global) block, for which we derive an explicit expression. In the holographic context, this object corresponds to a direct measure of nonlinear effects in pure gravity. We calculate additional terms in the star channel identity block that contribute at the same order at large $c$ as the global block using the novel theory of reparametrizations, which extends the shadow operator formalism in a natural way. We investigate these blocks' relevance to quantum chaos in the form of six-point scrambling in an out-of time ordered correlator. Interestingly, the global block does not contribute to the scrambling mode of this correlator, implying that, to leading order, six-point scrambling is insensitive to the three-point graviton coupling in the bulk dual. Finally, we compare our findings with a different OPE channel, called the comb channel, and find the same result for the chaos exponent in this decomposition.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

The stranger things of symmetric product orbifold CFTs

Symmetric product orbifold theories are valuable due to their universal features at large N. Here we will demonstrate that they have features that are not as pervasive: we provide evidence of strange behaviour under deformations within their moduli space. To this end, we consider the symmetric product orbifold of tensor products of N = 2 super-Virasoro minimal models, and classify them according to two criteria. The first criterion is the existence of a single-trace twisted exactly marginal operator that triggers the deformation. The second criterion is a sparseness condition on the growth of light states in the elliptic genera. In this context we encounter a strange variety: theories that obey the first criterion but the second criterion falls into a Hagedorn-like growth. We explain why this may be counter-intuitive and discuss how it might be accounted for in conformal perturbation theory. We also find a new infinite class of theories that obey both criteria, which are necessary conditions for each moduli space to contain a supergravity point.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗
DOE OSTI2022

Improving Simulations of Vegetation Dynamics over the Tibetan Plateau: Role of Atmospheric Forcing Data and Spatial Resolution

The efficacy of vegetation dynamics simulations in offline land surface models (LSMs) largely depends on the quality and spatial resolution of meteorological forcing data. In this study, the Princeton Global Meteorological Forcing Data (PMFD) and the high spatial resolution and upscaled China Meteorological Forcing Data (CMFD) were used to drive the Simplified Simple Biosphere model version 4/Top-down Representation of Interactive Foliage and Flora Including Dynamics (SSiB4/TRIFFID) and investigate how meteorological forcing datasets with different spatial resolutions affect simulations over the Tibetan Plateau (TP), a region with complex topography and sparse observations. By comparing the monthly Leaf Area Index (LAI) and Gross Primary Production (GPP) against observations, we found that SSiB4/TRIFFID driven by upscaled CMFD improved the performance in simulating the spatial distributions of LAI and GPP over the TP, reducing RMSEs by 24.3% and 20.5%, respectively. The multi-year averaged GPP decreased from 364.68 gC m –2 yr –1 to 241.21 gC m –2 yr –1 with the percentage bias dropping from 50.2% to –1.7%. When using the high spatial resolution CMFD, the RMSEs of the spatial distributions of LAI and GPP simulations were further reduced by 7.5% and 9.5%, respectively. This study highlights the importance of more realistic and high-resolution forcing data in simulating vegetation growth and carbon exchange between the atmosphere and biosphere over the TP.

54 ENVIRONMENTAL SCIENCES↗