Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem structuring methods”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Coefficient-to-Basis Network: a fine-tunable operator learning framework for inverse problems with adaptive discretizations and theoretical guarantees

We propose a Coefficient-to-Basis Network (C2BNet), a novel framework for solving inverse problems within the operator learning paradigm. C2BNet efficiently adapts to different discretizations through fine-tuning, using a pre-trained model to significantly reduce computational cost while maintaining high accuracy. Unlike traditional approaches that require retraining from scratch for new discretizations, our method enables seamless adaptation without sacrificing predictive performance. Furthermore, we establish theoretical approximation and generalization error bounds for C2BNet by exploiting low-dimensional structures in the underlying datasets. Our analysis demonstrates that C2BNet adapts to low-dimensional structures without relying on explicit encoding mechanisms, highlighting its robustness and efficiency. To validate our theoretical findings, we conducted extensive numerical experiments that showcase the superior performance of C2BNet on several inverse problems. The results confirm that C2BNet effectively balances computational efficiency and accuracy, making it a promising tool to solve inverse problems in scientific computing and engineering applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Solving puzzles in deformed JT gravity: phase transitions and non-perturbative effects

Recent work has shown that certain deformations of the scalar potential in Jackiw-Teitelboim gravity can be written as double-scaled matrix models. However, some of the deformations exhibit an apparent breakdown of unitarity in the form of a negative spectral density at disc order. We show here that the source of the problem is the presence of a multi-valued solution of the leading order matrix model string equation. While for a class of deformations we fix the problem by identifying a first order phase transition, for others we show that the theory is both perturbatively and non-perturbatively inconsistent. Aspects of the phase structure of the deformations are mapped out, using methods known to supply a non-perturbative definition of undeformed JT gravity. Some features are in qualitative agreement with a semi-classical analysis of the phase structure of two-dimensional black holes in these deformed theories.

2D gravity↗
DOE OSTI2022

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A deep learning approach for semantic segmentation of unbalanced data in electron tomography of catalytic materials

In computed TEM tomography, image segmentation represents one of the most basic tasks with implications not only for 3D volume visualization, but more importantly for quantitative 3D analysis. In case of large and complex 3D data sets, segmentation can be an extremely difficult and laborious task, and thus has been one of the biggest hurdles for comprehensive 3D analysis. Heterogeneous catalysts have complex surface and bulk structures, and often sparse distribution of catalytic particles with relatively poor intrinsic contrast, which possess a unique challenge for image segmentation, including the current state-of-the-art deep learning methods. To tackle this problem, we apply a deep learning-based approach for the multi-class semantic segmentation of a γ-Alumina/Pt catalytic material in a class imbalance situation. Specifically, we used the weighted focal loss as a loss function and attached it to the U-Net’s fully convolutional network architecture. We assessed the accuracy of our results using Dice similarity coefficient (DSC), recall, precision, and Hausdorff distance (HD) metrics on the overlap between the ground-truth and predicted segmentations. Our adopted U-Net model with the weighted focal loss function achieved an average DSC score of 0.96 ± 0.003 in the γ-Alumina support material and 0.84 ± 0.03 in the Pt NPs segmentation tasks. We report an average boundary-overlap error of less than 2 nm at the 90th percentile of HD for γ-Alumina and Pt NPs segmentations. The complex surface morphology of γ-Alumina and its relation to the Pt NPs were visualized in 3D by the deep learning-assisted automatic segmentation of a large data set of high-angle annular dark-field (HAADF) scanning transmission electron microscopy (STEM) tomography reconstructions.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Electrical conductivity of a warm neutron star crust in magnetic fields: Neutron-drip regime

We compute the anisotropic electrical conductivity tensor of the inner crust of a compact star at nonzero temperature by extending a previous work on the conductivity of the outer crust. The physical scenarios, where such crust is formed, involve protoneutron stars born in supernova explosions, binary neutron star mergers, and accreting neutron stars. The temperature-density range studied covers the transition from a semidegenerate to a highly degenerate electron gas and assumes that the nuclei form a liquid, i.e., the temperature is above the melting temperature of the lattice of nuclei. The electronic transition probabilities include (i) the screening of electron-ion interaction in the hard-thermal-loop approximation for the QED plasma, (ii) the correlations of the ionic component in a one-component plasma, and (iii) finite nuclear size effects. The conductivity tensor is obtained from the Boltzmann kinetic equation in relaxation time approximation accounting for the anisotropy introduced by a magnetic field. The sensitivity of the results towards the matter composition of the inner crust is explored by using several compositions of the inner crust, which were obtained using different nuclear interactions and methods of solving the many-body problem. The standard deviations of relaxation time and components of the conductivity tensor from the average are below ≤25% except close to crust-core transition, where nonspherical nuclear structures are expected. Finally, our results can be used in dissipative magnetohydrodynamics simulations of warm compact stars.

Physics↗
DOE OSTI2022

Soil-related developments of the Biome-BGCMuSo v6.2 terrestrial ecosystem model

Terrestrial biogeochemical models are essential tools to quantify climate–carbon cycle feedback and plant–soil relations from local to global scale. In this study, a theoretical basis is provided for the latest version of the Biome-BGCMuSo biogeochemical model (version 6.2). Biome-BGCMuSo is a branch of the original Biome-BGC model with a large number of developments and structural changes. Earlier model versions performed poorly in terms of soil water content (SWC) dynamics in different environments. Moreover, lack of detailed nitrogen cycle representation was a major limitation of the model. Since problems associated with these internal drivers might influence the final results and parameter estimation, additional structural improvements were necessary. In this paper the improved soil hydrology as well as the soil carbon and nitrogen cycle calculation methods are described in detail. Capabilities of the Biome-BGCMuSo v6.2 model are demonstrated via case studies focusing on soil hydrology, soil nitrogen cycle, and soil organic carbon content estimation. Soil-hydrology-related results are compared to observation data from an experimental lysimeter station. The results indicate improved performance for Biome-BGCMuSo v6.2 compared to v4.0 (explained variance increased from 0.121 to 0.8 for SWC and from 0.084 to 0.46 for soil evaporation; bias changed from -0.047 to -0.007 m 3 m -3 for SWC and from -0.68 to -0.2 mm d -1 for soil evaporation). Simulations related to nitrogen balance and soil CO 2 efflux were evaluated based on observations made in a long-term field experiment under crop rotation. The results indicated that the model is able to provide realistic nitrate content estimation for the topsoil. Soil nitrous oxide (N 2 O) efflux and soil respiration simulations were also realistic, with overall correspondence with the observations (for the N 2 O efflux simulation bias was between -0.13 and -0.1 mgNm -2 d -1 , and normalized root mean squared error (NRMSE) was 32.4 %–37.6 %; for CO 2 efflux simulations bias was 0.04–0.17 gCm -2 d -1 , while NRMSE was 34.1 %–40.1 %). Sensitivity analysis and optimization of the decomposition scheme are presented to support practical application of the model. The improved version of Biome-BGCMuSo has the ability to provide more realistic soil hydrology representation as well as nitrification and denitrification process estimation, which represents a major milestone.

58 GEOSCIENCES↗
DOE OSTI2022

High-order dimensionally-split Cartesian embedded boundary method for non-dissipative schemes

Centered finite-difference schemes are commonly used for high-fidelity turbulent flow simulations in canonical configurations because of their non-dissipative property and computational efficiency. However, their use in flow simulations over complex geometries is limited by the requirements of a structured grid and a stable boundary treatment in the absence of artificial (numerical) dissipation. Cartesian embedded boundary (EB) approaches provide an efficient structured-grid framework to apply difference schemes over complex domains. However, they are often restricted to low orders of accuracy because of numerical instabilities at the embedded boundaries and the issues of small-cell problem that are difficult to address with high-order accuracy. The present work discusses a systematic approach to obtain high-order EB methods with non-dissipative centered schemes in the interior. This approach, based on satisfying the primary and secondary conservation conditions, is employed to derive EB schemes that are up to sixth-order accurate in the interior and fourth-order accurate globally for hyperbolic, parabolic as well as incompletely parabolic problems. The proposed finite-difference discretization is, by construction, dimensionally split and addresses the small-cell problem without any cell/geometry transformations, thus, highly simplifying implementation in a flow solver. Various linear and non-linear numerical tests are performed to evaluate the stability and the accuracy of the proposed EB schemes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The latent variable proximal point algorithm for variational problems with inequality constraints

The latent variable proximal point (LVPP) algorithm is a framework for solving infinite-dimensional variational problems with pointwise inequality constraints. The algorithm is a saddle point reformulation of the Bregman proximal point algorithm. At the continuous level, the two formulations are equivalent, but the saddle point formulation is more amenable to discretization because it introduces a structure-preserving transformation between a latent function space and the feasible set. Working in this latent space is much more convenient for enforcing inequality constraints than the feasible set, as discretizations can employ general linear combinations of suitable basis functions, and nonlinear solvers can involve general additive updates. LVPP yields numerical methods with observed mesh-independence for obstacle problems, contact, fracture, plasticity, and others besides; in many cases, for the first time. The framework also extends to more complex constraints, providing means to enforce convexity in the Monge–Ampère equation and handling quasi-variational inequalities, where the underlying constraint depends implicitly on the unknown solution. Here, in this paper, we describe the LVPP algorithm in a general form and apply it to ten problems from across mathematics.

Inequality constraints↗
DOE OSTI2023

Stress‐constrained topology optimization of structures subjected to nonproportional loading

Abstract This work considers the topology optimization of hyperelastic structures for maximum stiffness (minimum compliance) subject to constraints on their volume and maximum stress. In contrast to almost all previous works, we subject the structures to nonproportional loading, wherein the maximum stress does not necessarily occur at the final load step. As such, the stress is constrained at each load step. The augmented Lagrangian method is used to formulate the optimization problem with its many constraints. In numerical examples, we investigate different load trajectories for the same terminal load and compare the optimized designs and their performances. The results show the importance of considering the entire load trajectory as the load history significantly influences the optimized designs.

42 ENGINEERING↗
DOE OSTI2025

Extended Galerkin Neural Network Approximation of Singular Variational Problems with Error Control

We present extended Galerkin neural networks, a variational framework for approximating general boundary value problems (BVPs) with error control. The main contributions of this work are (1) a rigorous theory guiding the construction of new weighted least squares variational formulations suitable for use in neural network approximation of general BVPs, and (2) an “extended” feedforward network architecture which incorporates and is even capable of learning singular solution structures, thus greatly improving approximability of singular solutions. Furthermore, numerical results are presented for several problems, including steady Stokes flow around reentrant corners and in convex corners with Moffatt eddies in order to demonstrate efficacy of the method.

a posteriori error estimate↗
DOE OSTI2022

Long-Term Stability of PVD/Sputtered Au Electrical Contacts to Thermoelectric Bi 2 Te 2 : Re-evaluation of SAND2015-7203

The fabrication of long-lived electrical contacts to thermoelectric Bi 2 Te 3 -based modules is a challenging problem due to chemical incompatibilities and rapid diffusion rates. Previously, technical guidance from SAND report 2015-7203 selected electroplated Au as the preferred method for fabrication of long-lived contacts because of concerns that the grain structure of sputtered/physical vapor deposited (PVD) Au contacts can evolve during aging. We have re- evaluated PVD Au contacts and show that they are appropriate for long-life service. We measure grain size and morphology at different aging times under accelerated temperature gradient conditions, and we show that the PVD Au contacts are stable and remain relatively unchanged. The PVD Au fabricated here is not subject to the deterioration observed in the previous report.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Long-Term Stability of PVD/Sputtered Au Electrical Contacts to Thermoelectric Bi 2 Te 2 (Re-evaluation of SAND2015-7203)

The fabrication of long-lived electrical contacts to thermoelectric Bi 2 Te 3 -based modules is a challenging problem due to chemical incompatibilities and rapid diffusion rates. Previously, technical guidance from SAND report 2015-7203 selected electroplated Au as the preferred method for fabrication of long-lived contacts because of concerns that the grain structure of sputtered/physical vapor deposited (PVD) Au contacts can evolve during aging. We have re-evaluated PVD Au contacts and show that they are appropriate for long-life service. We measure grain size and morphology at different aging times under accelerated temperature gradient conditions, and we show that the PVD Au contacts are stable and remain relatively unchanged. The PVD Au fabricated here is not subject to the deterioration observed in the previous report.

36 MATERIALS SCIENCE↗
DOE OSTI2025

INTEGRATION OF DATA ANALYTICS WITH SYSTEM HEALTH PROGRAMS

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry developed and regulatory programs. However, these programs have proven to be labor intensive and expensive. There is an opportunity to significantly enhance the collection, analysis, and use of this information to provide more cost-effective plant operation. Additionally, there is an acute industry need to leverage advanced technology to reduce costs and improve operational effectiveness. The goal of this paper is to provide effective and efficient analytical methods and tools to support risk-informed decisions for the equipment reliability and asset management programs at nuclear power plants. This is accomplished by creating a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). Here we are supporting typical system engineer decisions regarding maintenance activity scheduling and component ageing management. This is performed in a risk-informed context where herein the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow. A challenge is that the structure of this workflow strongly depends on the decision that needs to be made, the type of data available, and the constraints that need to be considered. Current methods are designed to provide specific answers to specific problems; however, these methods might prove to be inadequate even when problem settings slightly change (e.g., different types of requirements, additional dependencies between system reliability and economics). We tackled this challenge by designing framework in a flexible and modular fashion such that the user can assemble and customize his/her own workflow that integrates SSC economic lifecycle models (e.g., maintenance and replacement costs), system reliability models, and optimization methods.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Draft Rules for Alloy 617 Creep-Fatigue Design Using an EPP+SMT Approach

The report describes an improved new creep-fatigue design method for structural components in high temperature nuclear service. The new method uses an integrated elastic-perfectly plastic (EPP) analysis and Simplified Model Test (SMT) approach that greatly simplifies the design process by avoiding the separate evaluation of creep and fatigue damages and eliminating the requirement of stress classification. The report includes draft design rules, presented in a format compatible with an ASME nuclear Code Case, as well as a commentary on the rules and the validation of the rules using pressurized SMT (p-SMT) test data. Areas of potential improvement have been identified for further evaluation. The report also develops EPP+SMT design charts for Alloy 617 at temperatures between 800°C and 950°C by extrapolating high strain range, short hold test data to low strain range and long hold times, typical for structural components in high temperature nuclear service. The design charts are currently limited to 10,000 cycles to avoid excessive extrapolation outside the test database. More robust alternate extrapolation procedures will be considered in future work. The report includes several verification problems comparing the new EPP+SMT design method with current ASME creep-fatigue design methods. The comparison demonstrates that the EPP+SMT method significantly reduces the over-conservatism in current methods. Finally, the report includes a fully-documented sample problem with multiple load cases detailing the application of proposed EPP+SMT design rules.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Exploring Gradient-Based Multi-directional Controls in GANs

Generative Adversarial Networks (GANs) have been widely applied in modeling diverse image distributions. However, despite its impressive applications, the structure of the latent space in GANs largely remains as a black-box, leaving its controllable generation an open problem, especially when spurious correlations between different semantic attributes exist in the image distributions. To address this problem, previous methods typically learn linear directions or individual channels that control semantic attributes in the image space. However, they often suffer from imperfect disentanglement, or are unable to obtain multi-directional controls. Furthermore, in this work, in light of the above challenges, we propose a novel approach that discovers nonlinear controls, which enables multi-directional manipulation as well as effective disentanglement, based on gradient information in the learned GAN latent space. More specifically, we first learn interpolation directions by following the gradients from classification networks trained separately on the attributes, and then navigate the latent space by exclusively controlling channels activated for the target attribute in the learned directions. Empirically, with small training data, our approach is able to gain fine-grained controls over a diverse set of bi-directional and multi-directional attributes, and we showcase its ability to achieve disentanglement significantly better than state-of-the-art methods both qualitatively and quantitatively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗