Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Convex Optimization of Integrated Power-Gas Energy Flow Model With Applications to Probabilistic Energy Flow

Energy flow calculation is a fundamental problem of the integrated power and gas system (IPGS) operation and planning. However, the nonlinear gas flow model introduces major challenges to the energy flow calculation. In this paper, we propose a tractably convex optimization model to solve the energy flow problem in IPGSs. It is demonstrated that the proposed optimization model has the same optimal solution as the original nonlinear steady energy flow model. Also, piecewise linearization is adopted to tightly linearize the nonlinear objective function of the model, which transforms the formulated convex optimization into a linear program one. Thus, the computation complexity of the proposed energy flow model is significantly reduced as compared with the existing methods. In addition, the proposed model can be extended to probabilistic energy flow estimation. Extensive case studies are conducted to validate the effectiveness of the proposed energy flow model using three IPGSs.

42 ENGINEERING↗
DOE OSTI2020

A Comprehensive Scheduling Framework using SP-ADMM for Residential Demand Response with Weather and Consumer Uncertainties

This paper presents a comprehensive scheduling framework for residential demand response (DR) programs considering both the day-ahead and real-time electricity markets. In the first stage, residential customers determine the operating status of their responsive devices such as heating, ventilation, and air conditioning (HVAC) systems and electric water heaters (EWHs), while the distribution system operator (DSO) computes the amount of electricity to be purchased in the day-ahead electricity market. In the second stage, the DSO purchases insufficient (or sells surplus) electricity in the real-time electricity market to maintain the supply-demand balance. Due to its computational complexity and data privacy issues, the proposed model cannot be directly solved in a centralized manner, especially with a large number of uncertain scenarios. Therefore, this paper proposes a combination of stochastic programming (SP) and the alternating direction method of multipliers (ADMM) algorithm, called SP-ADMM, to decompose the original model and then solve each sub-problem in a distributed manner while considering multiple uncertain scenarios. The simulation study is performed on the IEEE 33-bus system including 121 residential houses. Here, the results demonstrate the effectiveness of the proposed approach for large-scale residential DR applications under weather and consumer uncertainties.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Application of Quantum Computing to Biochemical Systems: A Look to the Future

Chemistry is considered as one of the more promising applications to science of near-term quantum computing. Recent work in transitioning classical algorithms to a quantum computer has led to great strides in improving quantum algorithms and illustrating their quantum advantage. Because of the limitations of near-term quantum computers, the most effective strategies split the work over classical and quantum computers. There is a proven set of methods in computational chemistry and materials physics that has used this same idea of splitting a complex physical system into parts that are treated at different levels of theory to obtain solutions for the complete physical system for which a brute force solution with a single method is not feasible. These methods are variously known as embedding, multi-scale, and fragment techniques and methods. We review these methods and then propose the embedding approach as a method for describing complex biochemical systems, with the parts not only treated with different levels of theory, but computed with hybrid classical and quantum algorithms. Such strategies are critical if one wants to expand the focus to biochemical molecules that contain active regions that cannot be properly explained with traditional algorithms on classical computers. While we do not solve this problem here, we provide an overview of where the field is going to enable such problems to be tackled in the future.

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

Microfabricated Devices and Ion Trapping Capabilities

Next generation ion traps will likely need to support tens if not hundreds of ions in order to achieve several logical qubits. As we scale to those sizes, the same problems we face now – rf dissipation, control I/O, and optical access – will only grow and become more complicated. While many of these challenges can potentially be solved with technology integration, independently researching the feasibility of that integration and other solutions may help reduce the time and risk in scaling up to larger traps, by testing on smaller less complex devices. We should also consider other fabrication techniques that may help scale to larger devices, such as: through-substrate-vias (TSVs), different metal coatings, exotic rf routing, on chip laser sources, or even a secondary macroscopic trap to reload ions from. To have these technologies ready for full scale integration when we need them, ion traps with some of these capabilities need to be produced now. Developing the rigorous fabrication methods for producing reliable traps takes time and experimentation. We propose developing larger ion traps and reliable integrated technology in conjunction to make both available faster.

36 MATERIALS SCIENCE↗
DOE OSTI2023

AMG Preconditioners based on parallel hybrid coarsening and multi-objective graph matching

We describe preliminary results from a multi-objective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on high-end parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package \texttt{PSCToolkit} to exploit multi-threaded parallelism at the node level on multi-core processors. Our matching proposal balances the need to simultaneously compute high weights and large cardinalities by a new formulation of the weighted matching problem combining both these objectives using a parameter $\lambda$. We compute the matching by a parallel $2/3-\varepsilon$-approximation algorithm for maximum weight matchings. Results with the new matching algorithm show that for a suitable choice of the parameter $\lambda$ we compute effective preconditioners in the presence of anisotropy, i.e., smaller solve times, setup times, iterations counts, and operator complexity.

D'Ambra, Pasqua↗
DOE OSTI2023

Immersive Digital Twins and Decision Making

This work focuses on developing and implementing immersive digital twins to support decision-making processes in construction automation and energy simulation analysis. The use of digital twins enables users to explore and interact with virtual replicas of physical systems, providing a unique and valuable perspective for problem-solving. In the context of construction automation, we present two case studies that integrate immersive visualization and worker-machine interaction. In the context of energy simulation analysis using digital twins, we describe our digital twin framework that combines interactive visualization with machine learning techniques to approximate computationally expensive simulations, allowing for faster and more efficient analysis of complex energy systems. Through these research endeavors, we demonstrate the potential of immersive digital twins in decision-making across various domains.

digital twins↗
DOE OSTI2025

Characterizing the hadronization of parton showers using the HOMER method

We update the HOMER method, a technique to solve a restricted version of the inverse problem of hadronization – extracting the Lund string fragmentation function f(z) from data using only observable information. Here, we demonstrate its utility by extracting f(z) from synthetic Pythia simulations using high-level observables constructed on an event-by-event basis, such as multiplicities and shape variables. Four cases of increasing complexity are considered, corresponding to e + e − collisions at a center-of-mass energy of 90 ≥ v producing either a string stretched between a $q$ and $\bar{q}$ containing no gluons; the same string containing one gluon g with fixed kinematics; the same but the gluon has varying kinematics; and the most realistic case, strings with an unrestricted number of gluons that is the end-result of a parton shower. We demonstrate the extraction of f(z) in each case, with the result of only a relatively modest degradation in performance of the HOMER method with the increased complexity of the string system.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Cloud Services Enable Efficient AI-Guided Simulation Workflows across Heterogeneous Resources

Applications which fuse machine learning and simulation are rarely best served by a single computing resource. Highly parallel simulation codes are best deployed on super- computers, while AI tasks used to decide which simulations to perform may be best suited to specialized accelerators. Here we present a Function-as-a-Service (FaaS) system for executing complex, distributed computational campaigns that achieves performance parity with conventional workflow systems without the complexities of secure network connections between compute providers. One innovation enabling high performance is a subsystem that directly moves task data between sites, separate from the cloud-hosted FaaS system used to distribute task instructions. We also introduce a flexible scheduling system that allows us access factor of 2 trade offs between the amount of resources required to solve a problem at each compute site. We anticipate that this system will upgrade multi-site applications from demonstration projects to routine practice in computational science.

Ward, Logan↗
DOE OSTI2025

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Computing Bottleneck Structures at Scale for High-Precision Network Performance Analysis

The Theory of Bottleneck Structures is a recently-developed framework for studying the performance of data networks. It describes how local perturbations in one part of the network propagate and interact with others. This framework is a powerful analytical tool that allows network operators to make accurate predictions about network behavior and thereby optimize performance. Previous work implemented a software package for bottleneck structure analysis, but applied it only to toy examples. In this work, we introduce the first software package capable of scaling bottleneck structure analysis to production-size networks. Here, we benchmark our system using logs from ESnet, the Department of Energy's high-performance data network that connects research institutions in the U.S. Using the previously published tool as a baseline, we demonstrate that our system achieves vastly improved performance, constructing the bottleneck structure graphs in 0.21 s and calculating link derivatives in 0.09 s on average. We also study the asymptotic complexity of our core algorithms, demonstrating good scaling properties and strong agreement with theoretical bounds. These results indicate that our new software package can maintain its fast performance when applied to even larger networks. They also show that our software is efficient enough to analyze rapidly changing networks in real time. Overall, we demonstrate the feasibility of applying bottleneck structure analysis to solve practical problems in large, real-world data networks.

benchmark↗
DOE OSTI2021

Data-driven optimization of mixed-integer bi-level multi-follower integrated planning and scheduling problems under demand uncertainty

The coordination of interconnected elements across the different layers of the supply chain is essential for all industrial processes and the key to optimal decision-making. Yet, the modeling and optimization of such interdependent systems are still burdensome. Here we address the simultaneous modeling and optimization of medium-term planning and short-term scheduling problems under demand uncertainty using mixed-integer bi-level multi-follower programming and data-driven optimization. Bi-level multi-follower programs model the natural hierarchy between different layers of supply chain management holistically, while scenario analysis and data-driven optimization allow us to retrieve the guaranteed feasible solutions of the integrated formulation under various demand considerations. We address the data-driven optimization of this challenging class of problems using the DOMINO framework, which was initially developed to solve single-leader single-follower bi-level optimization problems to guaranteed feasibility. This framework is extended to solve single-leader multi-follower stochastic formulations and its performance is characterized by well-known single and multi-product process scheduling case studies. Through our data-driven algorithmic approach, we present guaranteed feasible solutions to linear and nonlinear mixed-integer bi-level formulations of simultaneous planning and scheduling problems and further characterize the effects of the scheduling level complexity on the solution performance, which spans over several hundred continuous and binary variables, and thousands of constraints.

42 ENGINEERING↗
DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Accelerated impurity solver for DMFT and its diagrammatic extensions

Here, we present ComCTQMC, a GPU accelerated quantum impurity solver. It uses the continuous-time quantum Monte Carlo (CTQMC) algorithm wherein the partition function is expanded in terms of the hybridisation function (CT-HYB). ComCTQMC supports both partition and worm-space measurements, and it uses improved estimators and the reduced density matrix to improve observable measurements whenever possible. ComCTQMC efficiently measures all one and two-particle Green's functions, all static observables which commute with the local Hamiltonian, and the occupation of each impurity orbital. ComCTQMC can solve complex-valued impurities with crystal fields that are hybridized to both fermionic and bosonic baths. Most importantly, ComCTQMC utilizes graphical processing units (GPUs), if available, to dramatically accelerate the CTQMC algorithm when the Hilbert space is sufficiently large. We demonstrate acceleration by a factor of over 600 (100) in a simulation of δ-Pu at 600 K with (without) crystal fields. In easier problems, the GPU offers less impressive acceleration or even decelerates the CTQMC. Here we describe the theory, algorithms, and structure used by ComCTQMC in order to achieve this set of features and level of acceleration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Bayesian Poroelastic Aquifer Characterization From InSAR Surface Deformation Data. Part I: Maximum A Posteriori Estimate

Characterizing the properties of groundwater aquifers is essential for predicting aquifer response and managing groundwater resources. In this work, we develop a high-dimensional scalable Bayesian inversion framework governed by a three-dimensional quasi-static linear poroelastic model to characterize lateral permeability variations in groundwater aquifers. In this work, we determine the maximum a posteriori (MAP) point of the posterior permeability distribution from centimeter-level surface deformation measurements obtained from Interferometric Synthetic Aperture Radar (InSAR). The scalability of our method to high parameter dimension is achieved through the use of adjoint-based derivatives, inexact Newton methods to determine the MAP point, and a Mat´ern class sparse prior precision operator. Together, these guarantee that the MAP point is found at a cost, measured in number of forward/adjoint poroelasticity solves, that is independent of the parameter dimension. We apply our methodology to a test case for a municipal well in Mesquite, Nevada, in which InSAR and GPS surface deformation data are available. We solve problems with up to 320,824 state variable degrees of freedom (DOFs) and 16,896 parameter DOFs. A consistent treatment of noise level is employed so that the aquifer characterization result does not depend on the pixel spacing of surface deformation data. Our results show that the use of InSAR data significantly improves characterization of lateral aquifer heterogeneity, and the InSAR-based aquifer characterization recovers complex lateral displacement trends observed by independent daily GPS measurements.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

ARENA: Adversary-Resistant Evolving Neural Architectures

Neural networks are becoming the cornerstone for national security prediction tasks. However, designing them requires significant research and trial/error, as they have many hyperparameters, including their computation graph (“architecture”). Neural architecture search (NAS) employs secondary optimizers to search for architectures maximizing objectives like accuracy. Evolutionary algorithms (EAs) are the most used class of optimizer for NAS. However, existing Python libraries for writing EAs limit the complexity of experiments a user can design. In this project, we built ARENA, a Python framework that encodes complex, hyper-realistic EAs. ARENA collects detailed information as it runs and is flexible enough to encode non-EA search algorithms. We tested ARENA on 4 toy optimization problems by encoding 3 search algorithms for each—random search, an EA, and simulated annealing. We also designed an EA that performs NAS on the MNIST dataset. Our experiments suggest the potential for immediate mission impact through solving lab-wide optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The simulation of 3D hypervelocity spallation using a hydrocode PAGOSA with FLIP+MPM

n this work, a hydrocode PAGOSA with FLIP+MPM is presented and exercised to investigate the fracture in ductile material. The merit of PAGOSA with FLIP+MPM to solve the advection problem is first illustrated by a solid piston periodically moving in a sealed tube with air. Furthermore, the ability of PAGOSA with FLIP+MPM to capture the fracture in material is shown by a simple stretching fracture in ductile material. In both of two benchmark problems, the PAGOSA results and analytical solutions are also presented for comparison. Then PAGOSA with FLIP+MPM is used to model complex spall in ductile material, which is a challenging problem in engineering applications. The convergences of PAGOSA with FLIP+MPM—based on both the mesh size and the marker density—are investigated by monitoring free surface velocity. To further show the ability of PAGOSA with FLIP+MPM to predict fracture in ductile material, the numerical results are compared with the experimental results and other published numerical results. Moreover, the effect of the spall parameter in PAGOSA with FLIP+MPM on the numerical simulation is also analyzed by investigating the free surface velocity. Finally, the effects of the peak compressive stress, the tensile strain rate, and the loading rate on the spallation are further investigated. The numerical results show that PAGOSA with FLIP+MPM can improve PAGOSA's performance when applied to predicting fracture in ductile materials, and is robust enough to accurately predict spall fracture in ductile materials.

42 ENGINEERING↗