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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2025

The Observed and Projected Changes of Global Monsoons: Current Status and Future Perspectives

The global monsoon system, encompassing the Asian-Australian, African, and American monsoons, sustains two-thirds of the world’s population by regulating water resources and agriculture. Monsoon anomalies pose severe risks, including floods and droughts. Recent research associated with the implementation of the Global Monsoons Model Intercomparison Project under the umbrella of CMIP6 has advanced our understanding of its historical variability and driving mechanisms. Observational data reveal a 20th-century shift: increased rainfall pre-1950s, followed by aridification and partial recovery post-1980s, driven by both internal variability (e.g., Atlantic Multidecadal Oscillation) and external forcings (greenhouse gases, aerosols), while ENSO drives interannual variability through ocean-atmosphere interactions. Future projections under greenhouse forcing suggest long-term monsoon intensification, though regional disparities and model uncertainties persist. Models indicate robust trends but struggle to quantify extremes, where thermodynamic effects (warming-induced moisture rise) uniformly boost heavy rainfall, while dynamical shifts (circulation changes) create spatial heterogeneity. Volcanic eruptions and proposed solar radiation modification (SRM) further complicate predictions: tropical eruptions suppress monsoons, whereas high-latitude events alter cross-equatorial flows, highlighting unresolved feedbacks. The emergent constraint approach is booming in terms of correcting future projections and reducing uncertainty with respect to the global monsoons. Critical challenges remain. Model biases and sparse 20th-century observational data hinder accurate attribution. The interplay between natural variability and anthropogenic forcings, along with nonlinear extreme precipitation risks under warming, demands deeper mechanistic insights. Additionally, SRM’s regional impacts and hemispheric monsoon interactions require systematic evaluation. Addressing these gaps necessitates enhanced observational networks, refined climate models, and interdisciplinary efforts to disentangle multiscale drivers, ultimately improving resilience strategies for monsoon-dependent regions.

climate extreme events↗
DOE OSTI2022

A Case Study of the Weather Research and Forecasting Model Applied to the Joint Urban 2003 Tracer Field Experiment. Part III: Boundary-Layer Parametrizations

Numerical weather prediction is often used to supply the mean wind and turbulence fields for atmospheric transport and dispersion plume models as they provide dense geographic coverage in comparison to typically sparse monitoring networks. Here, the Weather Research and Forecasting (WRF) model 4.0 was run over the month-long period of the Joint Urban 2003 field campaign conducted in Oklahoma City. We compare three different simulations in their ability to reproduce the observations, each using a different boundary-layer parametrization. Specifically, we examine the Mellor–Yamada–Janjic (MYJ), Yonsei University (YSU), and Mellor–Yamada–Nakanishi–Niino (MYNN) boundary-layer parametrizations. All three predict the wind speed well during the day but overpredict it at night. The MYNN parametrization is better than MYJ at predicting the daytime turbulence in the surface layer, but both underpredict the nocturnal turbulence. Additionally, the MYJ parametrization is best at predicting the reciprocal Obukhov length, while MYNN and YSU both significantly overpredict thermal stability. Reconstructing the reciprocal Obukhov length from other simulated parameters produces more accurate values for both parametrizations. All three models overpredict the boundary-layer height, particularly under convective conditions. The MYJ parametrization overestimates boundary-layer height the most, while YSU and MYNN have comparable performance with MYNN having an advantage in predicting the stable boundary-layer height. Several days were found where the WRF simulations predict significant deviations from the prevailing diurnal pattern in wind direction, which are not found in the observations.

54 ENVIRONMENTAL SCIENCES↗
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 OSTI2023

Stochastic projective splitting

Here, we present a new, stochastic variant of the projective splitting (PS) family of algorithms for inclusion problems involving the sum of any finite number of maximal monotone operators. This new variant uses a stochastic oracle to evaluate one of the operators, which is assumed to be Lipschitz continuous, and (deterministic) resolvents to process the remaining operators. Our proposal is the first version of PS with such stochastic capabilities. We envision the primary application being machine learning (ML) problems, with the method’s stochastic features facilitating “mini-batch” sampling of datasets. Since it uses a monotone operator formulation, the method can handle not only Lipschitz-smooth loss minimization, but also min–max and noncooperative game formulations, with better convergence properties than the gradient descent-ascent methods commonly applied in such settings. The proposed method can handle any number of constraints and nonsmooth regularizers via projection and proximal operators. We prove almost-sure convergence of the iterates to a solution and a convergence rate result for the expected residual, and close with numerical experiments on a distributionally robust sparse logistic regression problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Three-dimensional fracture continuum characterization aided by surface time-domain electromagnetics and hydrogeophysical joint inversion—proof-of-concept

Efficient and safe production of hydraulically fractured reservoirs benefits from the prediction of their geometrical attributes. Geophysical methods have the potential to provide data that are sensitive to fracture geometries, alleviating the typically sparse nature of in situ reservoir observations. Moreover, surface-based methods can be logistically and economically attractive since they avoid operational interference with the injection well infrastructure. Here, we investigate the potential of the surface-based time-domain electromagnetic (EM) method. EM methods can play an important role owing to their sensitivity to injection-induced fluid property changes. Two other advantageous factors are the EM signal-enhancing effect of vertical steel-cased wells and the fact that injected proppants can be enhanced to produce a stronger electrical conductivity contrast with the reservoir’s connate fluid. Nevertheless, an optimal fracture characterization will no doubt require the integration of EM and reservoir injection and production data. We hence carry out our investigations within a hydrogeophysical parameter estimation framework where EM data and injection flow rates are combined in a fully coupled way. Given the interdisciplinary nature of coupled hydrogeophysical inverse modeling, we dedicate one section to laying out key aspects in a didactic manner.

58 GEOSCIENCES↗
DOE OSTI2020

Approximate inverse-based block preconditioners in poroelasticity

We focus on the fully implicit solution of the linear systems arising from a three-field mixed finite element approximation of Biot’s poroleasticity equations. The objective is to develop algebraic block preconditioners for the efficient solution of such systems by Krylov subspace methods. In this work, we investigate the use of approximate inverse-based techniques to decouple the native system of equations and obtain explicit sparse approximations of the Schur complements related to the physics-based partitioning of the unknowns by field type. Here, the proposed methods are tested in various numerical experiments including real-world applications dealing with petroleum and geotechnical engineering.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Closure of Earth’s Global Seasonal Cycle of Energy Storage

Abstract The global seasonal cycle of energy in Earth’s climate system is quantified using observations and reanalyses. After removing long-term trends, net energy entering and exiting the climate system at the top of the atmosphere (TOA) should agree with the sum of energy entering and exiting the ocean, atmosphere, land, and ice over the course of an average year. Achieving such a balanced budget with observations has been challenging. Disagreements have been attributed previously to sparse observations in the high-latitude oceans. However, limiting the local vertical integration of new global ocean heat content estimates to the depth to which seasonal heat energy is stored, rather than integrating to 2000 m everywhere as done previously, allows closure of the global seasonal energy budget within statistical uncertainties. The seasonal cycle of energy storage is largest in the ocean, peaking in April because ocean area is largest in the Southern Hemisphere and the ocean’s thermal inertia causes a lag with respect to the austral summer solstice. Seasonal cycles in energy storage in the atmosphere and land are smaller, but peak in July and September, respectively, because there is more land in the Northern Hemisphere, and the land has more thermal inertia than the atmosphere. Global seasonal energy storage by ice is small, so the atmosphere and land partially offset ocean energy storage in the global integral, with their sum matching time-integrated net global TOA energy fluxes over the seasonal cycle within uncertainties, and both peaking in April.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

On the emerging potential of quantum annealing hardware for combinatorial optimization

Abstract Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2021

A Segregated Approach for Modeling the Electrochemistry in the 3-D Microstructure of Li-Ion Batteries and Its Acceleration Using Block Preconditioners

Abstract Battery performance is strongly correlated with electrode microstructure. Electrode materials for lithium-ion batteries have complex microstructure geometries that require millions of degrees of freedom to solve the electrochemical system at the microstructure scale. A fast-iterative solver with an appropriate preconditioner is then required to simulate large representative volume in a reasonable time. In this work, a finite element electrochemical model is developed to resolve the concentration and potential within the electrode active materials and the electrolyte domains at the microstructure scale, with an emphasis on numerical stability and scaling performances. The block Gauss-Seidel (BGS) numerical method is implemented because the system of equations within the electrodes is coupled only through the nonlinear Butler–Volmer equation, which governs the electrochemical reaction at the interface between the domains. The best solution strategy found in this work consists of splitting the system into two blocks—one for the concentration and one for the potential field—and then performing block generalized minimal residual preconditioned with algebraic multigrid, using the FEniCS and the Portable, Extensible Toolkit for Scientific Computation libraries. Significant improvements in terms of time to solution (six times faster) and memory usage (halving) are achieved compared with the MUltifrontal Massively Parallel sparse direct Solver. Additionally, BGS experiences decent strong parallel scaling within the electrode domains. Last, the system of equations is modified to specifically address numerical instability induced by electrolyte depletion, which is particularly valuable for simulating fast-charge scenarios relevant for automotive application.

25 ENERGY STORAGE↗
DOE OSTI2024

In the nuclear explosion monitoring context, what is an anomaly?

Abstract In the early years of nuclear explosion monitoring, experts used downwind detections with meaningful ratios of radioactive species to identify an explosion. Today’s reality is sparse networks of radionuclide monitoring stations looking for weak signals. Analysts need to discriminate between industrial background radioactivity and nuclear explosion signals, even using the detection of one isotope. Aerosol and xenon measurements potentially related to nuclear tests in 2006 and 2013 announced by the Democratic People’s Republic of Korea and from worldwide civilian background radioactivity are considered when defining radionuclide detection anomalies to objectively guide the use of limited analyst resources and reduce the possibility of not detecting nuclear explosions.

Miley, Harry S.↗
DOE OSTI2025

Frictionless knowledge injection for few-shot learning

Cutting-edge machine learning methods often require large volumes of curated training data, precluding their use in national security problems with rare events in massive datasets. We present a method for incorporating abstract knowledge into models tailored for sparse data. A subject matter expert defines salient concepts using data examples, which are encoded in the model’s embedding space. Models are then trained to respect these concepts. This method enables knowledge injection, yielding effective models with limited labeled data and the ability to assess model sensitivity for subject matter expertise across the nonproliferation mission space, as demonstrated with Raman spectra analysis.

Stomps, Jordan [ORNL] (ORCID:0000000178114479)↗
DOE OSTI2023

A Geo-Data Science Method for Assessing Unconventional Rare-Earth Element Resources in Sedimentary Systems

Abstract Rare-earth elements (REEs) supply raw materials that constitute many of our modern critical infrastructure, defense, technology, and electrification needs. Despite REE accumulations occurring in conventional bedrock and ion-adsorption deposits sourced from weathering of igneous rocks, unconventional host materials such as coal and related sedimentary strata have been identified as promising sources of REEs to meet growing demand. To maximize the potential of unconventional resources such as REE-coal systems, new approaches are needed overcome challenges from mineral systems with no known deposits and areas with sparse geochemical data. This article presents a systematic knowledge-data resource assessment method for predicting and identifying REE resource potential and occurrence in these unconventional systems. The method utilizes a geologic and geospatial knowledge-data approach informed and guided by REE accumulation mechanisms to systematically assess and identify areas of higher enrichment. An assessment of the Powder River Basin is presented as a test case to demonstrate the method workflow and results. The key output is a potential enrichment score map reported with varying confidence levels based on the amount of supporting evidence. Results from the test case indicate several locations with promising potential for different types of coal-REE deposits, demonstrating the viability of the method for exploration and assessment of unconventional REE resources. The method is flexible by design and, with sufficient applicable knowledge and data, can be adapted for assessing critical mineral systems in other sedimentary systems as well.

58 GEOSCIENCES↗
DOE OSTI2026

A Data-Driven Method for Modeling Creep-Fatigue Stress- Strain Behavior Using Neural ODEs

In this paper, we introduce a data-driven machine learning approach for modeling one-dimensional stress–strain behavior under cyclic loading, utilizing experimental data from the nickel-based Alloy 617. The study employs uniaxial creep–fatigue test data acquired under various loading histories and compares two distinct neural network-based ODE models. The first model, known as the black-box model, comprehensively describes the strain–stress relationship using a Neural ODE equation. To interpret this black-box model, we apply the Sparse Identification of Nonlinear Dynamical Systems (SINDy) technique, transforming the black-box model into an equation-based model using symbolic regression. The second model, the Neural flow rule model, incorporates Hooke’s Law for the linear elastic component, with the nonlinear part characterized by a Neural ODE. Both models are trained with experimental data to accurately reflect the observed stress–strain behavior. We conduct a detailed comparison with the standard Chaboche model, which includes three back stresses. Our results demonstrate that the neural network-based ODE models precisely capture the experimental creep–fatigue mechanical behavior, exceeding the standard Chaboche model’s accuracy. Furthermore, an interpretable model derived from the black-box neural ODE model through symbolic regression achieves accuracy comparable to the Chaboche model, enhancing its interpretability. The results highlight the potential of neural network-based ODE models to depict complex creep–fatigue behavior, eliminating the necessity for experts to define a specific, material-focused model form.

creep-fatigue↗
DOE OSTI2022

Optimizing first- and last-mile public transit services leveraging transportation network companies (TNC)

First-mile last-mile (FMLM) mobility services that connect riders to public transit can lead to improved transit accessibility and network efficiency if such services are convenient and reliable. However, many current FMLM services are inefficient and costly because they are inflexible (e.g., fixed supply of shuttles) and do not leverage collected data for optimized decision making. At the same time, new forms of shared mobility can provide added flexibility and real-time analytics to FMLM systems when carefully integrated. This study evaluates performance and cost implications of public/private coordination between transit shuttles and transportation network companies (TNC) in the FMLM context. A real-time operations model was developed to simulate daily operations for an existing FMLM system using real-world demand data. Three supply strategies were tested with varying levels of flexibility: (1) Status Quo (two 23-passenger on-demand shuttles), (2) Hybrid (one 23-passenger on-demand shuttle + TNC), and (3) TNC Only (exclusively use TNC services). Results indicated that the added flexibility of the Hybrid service design (using shuttles and TNCs) improved service performance (a 7.7% improvement), reduced daily operating costs (– 6.0%), and improved service reliability (95th percentile travel times decreased by up to 40% during peak periods). In addition, the Hybrid service design was more robust to variations in demand. Here, the Hybrid service was significantly cheaper to operate (– 31.6%) at reduced demand levels (50% of normal), and improved service performance (a 10.2% improvement) when demand levels were increased (150% of normal). These findings emphasize the importance of flexibility in FMLM service designs, especially when demand is sparse and variable.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Solving larger maximum clique problems using parallel quantum annealing

Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we consider in this work, is sparsely connected and moderately sized (on the order of thousands of qubits), thus necessitating a minor-embedding of a logical problem onto the physical qubit hardware. The combination of relatively small hardware sizes and the necessity of a minor-embedding can mean that solving large optimization problems is not possible on current quantum annealers. In this research, we show that a hybrid approach combining parallel quantum annealing with graph decomposition allows one to solve larger optimization problem accurately. We apply the approach to the Maximum Clique problem on graphs with up to 120 nodes and 6395 edges.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗