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,693 records · Page 94

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↗

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↗

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↗

Discrimination of Medicine Radix Astragali from Different Geographic Origins Using Multiple Spectroscopies Combined with Data Fusion Methods

Raman spectra and ultraviolet–visible absorption spectra of four different geographic origins of Radix Astragali were collected. These data were analyzed using kernel principal component analysis combined with sparse representation classification. The results showed that the recognition rate reached 70.44% using Raman spectra for data input and 90.34% using ultraviolet–visible absorption spectra for data input. A new fusion method based on Raman combined with ultraviolet–visible data was investigated and the recognition rate was increased to 96.43%. The experimental results suggested that the proposed data fusion method effectively improved the utilization rate of the original data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Numerical studies of three-dimensional stochastic Darcy's equation and stochastic advection-diffusion-dispersion equation

In this study, we solve the three-dimensional stochastic Darcy's equation and stochastic advection-diffusion-dispersion equation using a probabilistic collocation method (PCM) on sparse grids. Karhunen-Lo\`{e}ve (KL) decomposition is employed to represent the three-dimensional log hydraulic conductivity $Y=\ln K_s$. The numerical examples which demonstrate the convergence of PCM are presented. It appears that the faster convergence rate in the variance can be obtained by using the Jacobi-chaos representing the truncated Gaussian distributions than using the Hermite-chaos for the Gaussian distribution. The effect of dispersion coefficient on the mean and standard deviation of the hydraulic head and solute concentration is investigated. Additionally, we also study how the statistical properties of the hydraulic head and solute concentration vary while using different types of random distributions and different standard deviations of random hydraulic conductivity.

97 MATHEMATICS AND COMPUTING↗

Image Reconstruction from Under sampled Fourier Data Using the Polynomial Annihilation Transform

Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, l 1 regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more l 1 regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the l1l1 regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an l 1 regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the l 1 regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.

97 MATHEMATICS AND COMPUTING↗

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↗

Two-Level Least Squares Methods in Krylov Subspaces

Two-level least squares acceleration approaches are applied to the Chebyshev acceleration method and the restarted conjugate residual method in solving systems of linear algebraic equations with sparse unsymmetric coefficient matrices arising from finite volume or finite element approximations of boundary-value problems on irregular grids. Application of the proposed idea to other iterative restarted processes also is considered. The efficiency of the algorithms suggested is investigated numerically on a set of model Dirichlet problems for the convection-diffusion equation.

97 MATHEMATICS AND COMPUTING↗

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.↗

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)↗

An Analysis of the Published Mineral Resource Estimates of the Haji-Gak Iron Deposit, Afghanistan

The Haji-Gak iron deposit of eastern Bamyan Province, eastern Afghanistan, was studied extensively and resource calculations were made in the 1960s by Afghan and Russian geologists. Recalculation of the resource estimates verifies the original estimates for categories A (in-place resources known in detail), B (in-place resources known in moderate detail), and C{sub 1} (in-place resources estimated on sparse data), totaling 110.8 Mt, or about 6% of the resources as being supportable for the methods used in the 1960s. C{sub 2} (based on a loose exploration grid with little data) resources are based on one ore grade from one drill hole, and P{sub 2} (prognosis) resources are based on field observations, field measurements, and an ore grade derived from averaging grades from three better sampled ore bodies. C{sub 2} and P{sub 2} resources are 1,659.1 Mt or about 94% of the total resources in the deposit. The vast P{sub 2} resources have not been drilled or sampled to confirm their extent or quality. The purpose of this article is to independently evaluate the resources of the Haji-Gak iron deposit by using the available geologic and mineral resource information including geologic maps and cross sections, sampling data, and the analog-estimating techniques of the 1960s to determine the size and tenor of the deposit.

58 GEOSCIENCES↗

Implementation of the Iterative Proportion Fitting Algorithm for Geostatistical Facies Modeling

In geostatistics, most stochastic algorithm for simulation of categorical variables such as facies or rock types require a conditional probability distribution. The multivariate probability distribution of all the grouped locations including the unsampled location permits calculation of the conditional probability directly based on its definition. In this article, the iterative proportion fitting (IPF) algorithm is implemented to infer this multivariate probability. Using the IPF algorithm, the multivariate probability is obtained by iterative modification to an initial estimated multivariate probability using lower order bivariate probabilities as constraints. The imposed bivariate marginal probabilities are inferred from profiles along drill holes or wells. In the IPF process, a sparse matrix is used to calculate the marginal probabilities from the multivariate probability, which makes the iterative fitting more tractable and practical. This algorithm can be extended to higher order marginal probability constraints as used in multiple point statistics. The theoretical framework is developed and illustrated with estimation and simulation example.

58 GEOSCIENCES↗

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↗

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↗

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↗

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↗

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↗

A Case Study on a Combination NDVI Forecasting Model Based on the Entropy Weight Method

It is critically meaningful to accurately predict NDVI (Normalized Difference Vegetation Index), which helps guide regional ecological remediation and environmental managements. In this study, a combination forecasting model (CFM) was proposed to improve the performance of NDVI predictions in the Yellow River Basin (YRB) based on three individual forecasting models, i.e., the Multiple Linear Regression (MLR), Artificial Neural Network (ANN), and Support Vector Machine (SVM) models. The entropy weight method was employed to determine the weight coefficient for each individual model depending on its predictive performance. Results showed that: (1) ANN exhibits the highest fitting capability among the four orecasting models in the calibration period, whilst its generalization ability becomes weak in the validation period; MLR has a poor performance in both calibration and validation periods; the predicted results of CFM in the calibration period have the highest stability; (2) CFM generally outperforms all individual models in the validation period, and can improve the reliability and stability of predicted results through combining the strengths while reducing the weaknesses of individual models; (3) the performances of all forecasting models are better in dense vegetation areas than in sparse vegetation areas.

54 ENVIRONMENTAL SCIENCES↗