Search NASA⌕ Search

SEARCH · Search NASA

Results for “satisfiability problems”

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

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources: Preprint

Integration of a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problem requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs) including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperformed other benchmark controllers regarding computation time without compromising operational performance.

DER↗
DOE OSTI2022

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗
DOE OSTI2022

Efficient Probabilistic Computing with Stochastic Perovskite Nickelates

Probabilistic computing has emerged as a viable approach to solve hard optimization problems. Devices with inherent stochasticity can greatly simplify their implementation in electronic hardware. In this report we demonstrate intrinsic stochastic resistance switching controlled via electric fields in perovskite nickelates doped with hydrogen. The ability of hydrogen ions to reside in various metastable configurations in the lattice leads to a distribution of transport gaps. With experimentally characterized p-bits, a shared-synapse p-bit architecture demonstrates highly parallelized and energy-efficient solutions to optimization problems such as integer factorization and Boolean satisfiability. The results introduce perovskite nickelates as scalable potential candidates for probabilistic computing and showcase the potential of light-element dopants in next-generation correlated semiconductors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
DOE OSTI2020

Scaling Turbulent Combustion Fields in Explosions

We considered the topic of explosions from spherical high-explosive (HE) charges. We studied how the turbulent combustion fields scale. On the basis of theories of dimensional analysis by Bridgman and similarity theories of Sedov and Barenblatt, we found that all fields scaled with the explosion length scale r0. This included the blast wave, the mean and root mean squared (RMS) profiles of thermodynamic variables, combustion variables, velocities, vorticity, and turbulent Reynolds stresses. This was a consequence of the formulation of the problem and our numerical method, which both satisfied the similarity conditions of Sedov. We performed numerical simulations of 1 g charges and 1 kg charges; the solutions were identical (within roundoff error) when plotted in scaled variables. We also explored scaling laws related to three-phase pyrotechnic explosions. We show that although the scaling formally broke down, the fireball still essentially scaled with the explosion length scale r0. However, the discrete Lagrange particles (DLP) (phase 2) and the heterogeneous continuum model (HCM) of the DLP wakes (phase 3) did not scale with r0, and mean and RMS profiles could differ by a factor of 10 in some regions. This was because the DLP particles and wakes introduced an additional scale that broke the similarity conditions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Enforcing global constraints for the dispersion closure problem: τ 2 -SIMPLE algorithm

Permeability and effective dispersion tensors are critical parameters to characterize flow and transport in porous media at the continuum scale. Homogenization theory defines a framework in which such effective properties are first computed from solving a closure problem in a repeating unit cell of the periodic microstructure and then used in a macroscopic formulation for efficient computation. The closure problem is formulated as a local boundary value problem subjected to global constraints, which guarantee the uniqueness of the solution and can be difficult to satisfy for complex geometries and at high flow conditions. These constraints also ensure that pore-scale pressure, velocity, and concentration fields can be accurately reconstructed from the closure variable. Building on a previous work, here we present a framework that allows to satisfy global constraints associated to both the permeability and the dispersion closure problems by introducing two artificial time scales. The algorithm, called τ 2 -SIMPLE, computes both permeability and effective dispersion given an arbitrarily complex geometry and flow condition. Furthermore, this algorithm is demonstrated to be accurate for both 2D and 3D geometries across varying flow conditions, and thus it can be used to quickly characterize effective properties from porous media images in many applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

ChemComp: A Compilation Framework for Computing with Chemical Reaction Networks

The acceleration of scientific computation, data analytics, and artificial intelligence is driving a surge in computational requirements. Yet, state-of-the-art high-performance computing systems are approaching physical limitations that impede further significant improvements in energy efficiency. As we move towards post-exascale computing systems, innovative approaches are necessary to overcome this barrier in power consumption. Novel analog and hybrid digital-analog architectures hold promise for enhancing energy efficiency by several orders of magnitude. Biochemical computation stands out among the various solutions being explored due to its potential to enable new classes of devices with immense computational capabilities. These devices can capitalize on the inherent efficacy of biological cells in solving optimization problems and are scalable through increasing reaction system size or vessel capacity, potentially satisfying scientific computing's high-performance requirements. Nonetheless, several theoretical and practical limitations persist, including problem formulation and mapping to chemical reaction networks (CRNs) and implementation of actual CRN devices. In this paper, we propose a framework for biochemical computation using systems chemistry. We present the initial components of our approach: an abstract chemical reaction dialect implemented as a multi-level intermediate representation (MLIR) compiler extension and a pathway to represent mathematical problems with CRNs. To showcase the potential of this approach, we emulate a simplified chemical reservoir device. This work lays the groundwork for leveraging chemistry's computing potential in creating energy-efficient, high-performance computing systems tailored to contemporary computational needs.

artificial intelligence↗
DOE OSTI2021

Extended convex hull-based distributed optimal energy flow of integrated electricity-gas systems

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hull-based constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A WKB based preconditioner for the 1D Helmholtz wave equation

Frequency-domain full-wave solutions to the cold-plasma problem have become ubiquitous in the study of radio frequency power in fusion plasmas. However, recent efforts at extreme levels of geometric fidelity have revealed fundamental limits in the problem size that can be solved by typical sparse direct solver based methods. These limits are of particular importance in the 3D study of RF launchers, where the number of degrees of freedom required can exceed 100 million. In such cases, it would be advantageous to solve the system via iterative means, but due to the large null space of the curl-curl operator, the convergence properties of algorithms like GMRES are poor. Here we present a physics-based preconditioner in the form of a WKB solution and demonstrate the iterative solution to the frequency-domain Helmholtz problem in 1D for several cases ranging from satisfying the WKB approximation to strongly violating it.

Green, David↗
DOE OSTI2020

A Quantum Analog Coprocessor for Correlated Electron Systems Simulation

Analog quantum simulation is an approach for studying physical systems that might otherwise be computationally intractable to simulate on classical high-performance computing (HPC) systems. The key idea behind analog quantum simulation is the realization of a physical system with a low-energy effective Hamiltonian that is the same as the low-energy effective Hamiltonian of some target system to be studied. Purpose-built nanoelectronic devices are a natural candidate for implementing the analog quantum simulation of strongly correlated materials that are otherwise challenging to study using classical HPC systems. However, realizing devices that are sufficiently large to study the properties of a non-trivial material system (e.g., those described by a Fermi-Hubbard model) will eventually require the fabrication, control, and measurement of at least 0(10) quantum dots, or other engineered quantum impurities. As a step toward large-scale analog or digital quantum simulation platforms based on nanoelectronic devices, we propose a new approach to analog quantum simulation that makes use of the large Hilbert space dimension of the electronic baths that are used to adjust the occupancy of one or a few engineered quantum impurities. This approach to analog quantum simulation allows us to study a wide array of quantum impurity models. We can further augment the computational power of such an approach by combining it with a classical computer to facilitate dynamical mean-field theory (DMFT) calculations. DMFT replaces the solution of a lattice impurity problem with the solution of a family of localized impurity problems with bath couplings that are adjusted to satisfy a self-consistency condition between the two models. In DMFT, the computationally challenging task is the high-accuracy solution of an instance of a quantum impurity model that is determined self-consistently in coordination with a mean-field calculation. We propose using one or a few engineered quantum impurities with adjustable couplings to baths to realize an analog quantum coprocessor that effects the solution of such a model through measurements of a physical quantum impurity, operating in coordination with a classical computer to achieve a self-consistent solution to a DMFT calculation. We focus on implementation details relevant to a number of technologies for which Sandia has design, fabrication, and measurement expertise. The primary technical advances outlined in this report concern the development of a supporting modeling capability. As with all analog quantum simulation platforms, the successful design and operation of individual devices depends critically on one's ability to predict the effective low-energy Hamiltonian governing its dynamics Our project has made this possible and lays the foundation for future experimental implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Fission Product Yield Data Adjustment in a Prototype Version of TSURFER

The TSURFER (Tool for Sensitivity/Uncertainty analysis of Response Functionals using Experimental Results) module of Oak Ridge National Laboratory’s (ORNL’s) SCALE code system has been updated to perform nuclear data adjustments for fixed-source irradiation/depletion problems. TSURFER uses a generalized linear least squares (GLLS) approach to consolidate a prior set of measured responses and corresponding calculated values to create the most self-consistent set of nuclear data. Traditionally, TSURFER adjustments have been performed for multigroup nuclear data such as reaction cross sections. In this work, TSURFER is expanded to perform adjustments to independent fission product yields and branching ratios that need equality constraints. To preserve equality constraints after the data adjustment procedure, an updated GLLS formulation includes a new Lagrange multiplier that forces data adjustment to sum to 0 for a given fission yield/branching ratio parent. A test problem illustrates that the newly updated TSURFER module satisfies the required constraint that adjustments for fission yield data sum to 0.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Quasi-periodic travelling gravity–capillary waves

We present a numerical study of spatially quasi-periodic travelling waves on the surface of an ideal fluid of infinite depth. This is a generalization of the classic Wilton ripple problem to the case when the ratio of wavenumbers satisfying the dispersion relation is irrational. We propose a conformal mapping formulation of the water wave equations that employs a quasi-periodic variant of the Hilbert transform to compute the normal velocity of the fluid from its velocity potential on the free surface. We develop a Fourier pseudo-spectral discretization of the travelling water wave equations in which one-dimensional quasi-periodic functions are represented by two-dimensional periodic functions on the torus. This leads to an overdetermined nonlinear least-squares problem that we solve using a variant of the Levenberg–Marquardt method. We investigate various properties of quasi-periodic travelling waves, including Fourier resonances, time evolution in conformal space on the torus, asymmetric wave crests, capillary wave patterns that change from one gravity wave trough to the next without repeating and the dependence of wave speed and surface tension on the amplitude parameters that describe a two-parameter family of waves.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Automated Symbolic Upscaling: 1. Model Generation for Extended Applicability Regimes

Abstract In porous media theory, upscaling techniques are fundamental to deriving rigorous Darcy‐scale models for flow and reactive transport in subsurface systems. Due to limitations in classical techniques, a number of ad hoc approaches have been proposed to address physical regimes in which reactive time scales are similar to, or faster than, diffusive time scales. In Part 1 of this two part series, we present a strategy for expanding the applicability of classical homogenization theory by generalizing the assumed closure form. We detail the implementation of this strategy on two reactive mass transport problems with moderately reactive physics. The strategy produces nontrivial homogenized models with emergent terms and effective parameters that couple reactive, diffusive, and advective transport. The differences in equation forms between the macroscopic and pore‐scale descriptions advise caution to further studies where the forms of macroscopic equations are assumed, as opposed to rigorously derived. Numerical validation is provided for each problem to show that the error estimates of homogenization theory are satisfied, and to justify the implemented strategy. In Part 2, the presented strategy is automated using symbolic computing to expedite its implementation.

Pietrzyk, Kyle↗
DOE OSTI2021

Multiobjective Dynamic Optimization for Optimal Load-Following of Natural Gas Combined Cycle Power Plants under Stress Constraints

With the increasing penetration of intermittent renewable energy sources into the electric grid, there is an associated need for conventional thermal power plants that are designed to operate at base-load conditions to cycle their load rapidly and frequently and operate under low-load conditions. Fast load-following operations lead to plant efficiency loss and the reduction of equipment life. A high-fidelity dynamic model of a natural gas combined cycle power plant, with rigorous equipment level submodels, is developed to capture the plant transient performance and the thermomechanical stress evolution at the high-pressure drum is computed to assess the drum life consumption. Stress evolution is modeled for the location of the edge at the drum/downcomer junction that experiences high circumferential stress amplitude during the fast load-following operation, leading to higher fatigue damage than locations considered under existing design standards. A dynamic optimization problem is solved for optimal load-following operation. Depending on the value of the stress constraint and the desired ramp rate, satisfying the desired stress constraint may be infeasible without relaxing the ramp rate. A multiobjective dynamic optimization problem is solved using a lexicographic approach that minimizes ramp rate relaxation and maximizes efficiency while satisfying stress constraints, avoiding spraying to saturation, and maintaining main steam and reheat steam temperature within bounds. It was observed that the optimal ramp rate can be highly nonlinear as opposed to the industry-standard linear ramp rate. Nonlinear optimal ramp-rate profiles not only help to avoid stress constraints that may be unavoidable by using the linear profile but also result in higher efficiency than the linear profile. Furthermore, the study shows that there is a strong tradeoff between the relaxation in the plant ramp rate and the time-average thermal efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

A Data-Driven Methodology for Contextual Unit Commitment Using Regression Residuals

Day after day, system operators are faced with the challenge of taking unit commitment (UC) decisions under uncertain net load conditions. The standard operating procedure for taking UC decisions begins by leveraging auxiliary data on covariates (such as the day of the week or latest weather information) to generate a point prediction for net load, which is used in solving a deterministic UC problem. Such an approach, however, is known to deliver a notoriously poor out-of-sample (OOS) performance, as it completely disregards the stochastic nature of net load. While stochastic programming models explicitly represent uncertainty, they mostly do so using a generic set of scenarios that neglect covariate observations, squandering useful auxiliary data that could be harnessed to glean insights into uncertainty. In this article, we discuss a contextual stochastic optimization approach to UC, which effectively exploits covariate observations while explicitly assessing uncertainty so as to boost the OOS performance of UC decisions. The key thrust of our approach is to leverage regression models, along with their empirical residuals, to set up and solve sample average approximation problems. Not only do we prove that our approach satisfies the requisite conditions for asymptotic optimality and consistency laid out in (Kannan et al., 2022), but we also assess its performance on several case studies conducted using real-world data collected in California ISO and New York ISO grids. In conclusion, results show that the proposed approach can significantly improve OOS performance compared to alternative methods proposed in the literature under varying dataset sizes.

Yurdakul, Ogun↗
DOE OSTI2020

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team

Here we present an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators. The problem aims to find a sequence of targets for each robot to visit and schedule the tasks at the targets with the human operators such that each target is visited exactly once by some robot, the scheduling constraints are satisfied and the maximum mission time of any robot is minimum. This problem is a generalization of the single Traveling Salesman Problem and is NP-Hard. Given k robots and m human operators, an algorithm is developed for solving the TASSP with an approximation ratio equal to 5/2- 1/k when m ≥ k and equal to 7/2 -1/k otherwise. Computational results are also presented to corroborate the performance of the proposed algorithm.

42 ENGINEERING↗
DOE OSTI2025

Constrained or unconstrained? Neural-network-based equation discovery from data

Throughout many fields, practitioners often rely on differential equations to model systems. Yet, for many applications, the theoretical derivation of such equations and/or the accurate resolution of their solutions may be intractable. Instead, recently developed methods, including those based on parameter estimation, operator subset selection, and neural networks, allow for the data-driven discovery of both ordinary and partial differential equations (PDEs), on a spectrum of interpretability. The success of these strategies is often contingent upon the correct identification of representative equations from noisy observations of state variables and, as importantly and intertwined with that, the mathematical strategies utilized to enforce those equations. Specifically, the latter has been commonly addressed via unconstrained optimization strategies. Representing the PDE as a neural network, we propose to discover the PDE (or the associated operator) by solving a constrained optimization problem and using an intermediate state representation similar to a physics-informed neural network (PINN). The objective function of this constrained optimization problem promotes matching the data, while the constraints require that the discovered PDE is satisfied at a number of spatial collocation points. We present a penalty method and a widely used trust-region barrier method to solve this constrained optimization problem, and we compare these methods on numerical examples. Our results on several example problems demonstrate that the latter constrained method outperforms the penalty method, particularly for higher noise levels or fewer collocation points. This work motivates further exploration into using sophisticated constrained optimization methods in scientific machine learning, as opposed to their commonly used, penalty-method or unconstrained counterparts. For both of these methods, we solve these discovered neural network PDEs with classical methods, such as finite difference methods, as opposed to PINNs-type methods relying on automatic differentiation. Here, we briefly highlight how simultaneously fitting the data while discovering the PDE improves the robustness to noise and other small, yet crucial, implementation details.

Data-driven discovery↗
DOE OSTI2020

τ-SIMPLE Algorithm for the closure problem in homogenization of stokes flows

Estimation of the permeability tensor is crucial for many natural and industrial porous media applications. Homogenization provides a rigorous framework to calculate effective parameters from pore-scale images of a representative unit cell of the porous medium by solving a boundary value problem, also known as closure problem, subject to global constraints. However, the latter are hard to satisfy for arbitrarily complex geometries. We have developed a novel computational algorithm to calculate rigorously the permeability tensor. The approach, here referred to as τ-SIMPLE, is based on introducing an artificial time scale τ to satisfy the global constraint within the SIMPLE iteration. Here, we show that the proposed algorithm has high accuracy for both two-dimensional and three-dimensional periodically arranged geometries.

54 ENVIRONMENTAL SCIENCES↗