Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING 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 1,351 records · Page 75

Risk Assessment of Rare Events in Probabilistic Power Flow via Hybrid Multi-Surrogate Method

The risks associated with rare events threatening the security of power system operation are of paramount importance to power system planners and operators. To analyze the risks caused by high-impact, low-frequency rare events, an immensely large number of samples are typically required for the Monte-Carlo (MC) method on the high-fidelity power system model to achieve a sufficient accuracy, thereby rendering this approach computationally prohibitive. To handle this problem efficiently, it is desirable to construct a surrogate model for the power system response. However, the straightforward MC sampling of the low-fidelity surrogate can lead to biased results in the low-probability tail regions that are vital to risk assessment. Moreover, a single surrogate is unable to handle the topology uncertainties caused by random branch outages. To overcome these issues, we propose a hybrid multi-surrogate (HMS) method based on the polynomial chaos expansion (PCE) with low-probability tail events reevaluated by the high-fidelity model through a probabilistic analysis. This method improves the computational efficiency of the MC method for rare-event risk assessment by leveraging multi-fidelity models while retaining the desired accuracy. Simulations conducted in three test systems verify the excellent performances of the HMS method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Models and Strategies for Optimal Demand Side Management in the Chemical Industries

Deregulation and the increase of renewable electricity generation from wind and solar photovoltaics have transformed the U.S. electricity market. Economic and environmental benefits notwithstanding, the presence of renewables has increased variability and uncertainty on the supply side of the grid. Managing demand, rather than generation – a strategy referred to as “demand response (DR)” – is an attractive approach for mitigating this imbalance. DR efforts aim to reduce electricity usage during peak demand times, lessening stress on the grid. Industrial users are particularly attractive entities for DR participation since they present large, localized loads that can provide significant relief on grid demand and –unlike other large loads, such as buildings – are minimally dependent on human needs and preferences. In this project, we accomplished three main objectives. (1) We developed data-driven low-order DR scheduling-relevant dynamic models of chemical processes. Concurrently, we studied the formulation and solution of the associated optimal DR production scheduling problems. (a) A prototype air separation unit (ASU) model was used to generate simulated operating data for initial modeling efforts, which enabled the later use of industrial data for data-driven modeling. (b) We utilized Hammerstein-Wiener (HW) and Finite Step Response (FSR) models to represent nonlinear plant dynamics. (c) The HW models were linearized using exact linearization so they could potentially be embedded in power system models, which are formulated as mixed integer linear programs (MILPs). (d) We solved DR optimization problems under uncertainty and found that even naïve predictions of electricity price and product demand led to significant cost savings benefits. (2) Our DR scheduling optimization problem formulations are amenable to real-time solution. (a) We utilized Lagrangian Relaxation (LR) to efficiently solve the optimization problem by decoupling subproblems linked by complicating constraints. (b) We have achieved computation times for the 3-day DR scheduling problem of an ASU as low as 1.88 minutes. (3) Our representations of the DR behavior of chemical process as grid-level batteries were embedded in power system models. (a) For a small-scale grid, we found that incorporating the dynamics of the chemical plant in the optimal power flow calculations resulted in better resource management leading to up to 15% and 46% cost reduction for the grid and chemical plant operations, respectively, during periods of power line congestion. We have published several works dedicated to modeling and solving DR optimization problems from the user side. These were published in top peer-reviewed journals and are summarized in this report. The most recent work (and papers in preparation) considers DR scheduling from the grid side. Future efforts will consider networked plants (e.g., air separation units operating on a common pipeline) for DR participation, which is expected to amplify the capabilities of industrial DR participants to perform load-shifting. Our consideration of uncertainty in DR has inspired future directions in this area as well: we plan to develop multistage methods to fully account for the effects of uncertainty in DR scheduling.

24 POWER TRANSMISSION AND DISTRIBUTION↗

AP-Cloud: Adaptive Particle-in-Cloud method for optimal solutions to Vlasov–Poisson equation

We propose a new adaptive Particle-in-Cloud (AP-Cloud) method for obtaining optimal numerical solutions to the Vlasov–Poisson equation. Unlike the traditional particle-in-cell (PIC) method, which is commonly used for solving this problem, the AP-Cloud adaptively selects computational nodes or particles to deliver higher accuracy and efficiency when the particle distribution is highly non-uniform. Unlike other adaptive techniques for PIC, our method balances the errors in PDE discretization and Monte Carlo integration, and discretizes the differential operators using a generalized finite difference (GFD) method based on a weighted least square formulation. As a result, AP-Cloud is independent of the geometric shapes of computational domains and is free of artificial parameters. Efficient and robust implementation is achieved through an octree data structure with 2:1 balance. We analyze the accuracy and convergence order of AP-Cloud theoretically, and verify the method using an electrostatic problem of a particle beam with halo. Simulation results show that the AP-Cloud method is substantially more accurate and faster than the traditional PIC, and it is free of artificial forces that are typical for some adaptive PIC techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimating the carbon footprint of computational fluid dynamics

In this study, computational resources have grown exponentially in the past few decades. These machines make possible research and design in fields as diverse as medicine, astronomy, and engineering. Despite ever-increasing computational capabilities, direct simulation of complex systems has remained challenging owing to the degrees of freedom involved. At the cusp of exascale computing, high-resolution simulation of practical problems with minimal model assumptions may soon experience a renaissance. However, growing reliance on modern computers comes at the cost of a growing carbon footprint. To illustrate this, we examine historic computations in fluid dynamics where larger computers have afforded the opportunity to simulate flows at increasingly relevant Reynolds numbers. Under a variety of flow configurations, the carbon footprint of such simulations is found to scale roughly with the fourth power of Reynolds number. This is primarily explained by the computation cost in core-hours, which is also described by similar scaling, though regional differences in renewable energy use also play a role. Using the established correlation, we examine a large database of simulations to develop estimates for the carbon footprint of computational fluid dynamics in a given year. Collectively, the analysis provides an additional benchmark for new computations where, in addition to balancing considerations of model fidelity, carbon footprint should also be considered.

42 ENGINEERING↗

Enhancing the Q-Factor of a Practical Qubit Niobium Three-Dimensional λ/4-Resonator Through Surface Treatment

Quantum computing stands as a revolutionary frontier in information technology, with the potential to solve complex problems far beyond the capacity of classical computers. At the heart of this disruptive innovation are qubits, forming the fundamental backbone of quantum computing. A leading-edge solution for constructing robust, enduring qubits involves embedding a Josephson junction within a high Q-factor, superconducting three-dimensional cavity. Further, our recent innovation lies in developing a uniquely optimized, quarter-wave resonator-based superconducting cavity, functioning at 6 GHz, specifically tailored for quantum computers. In this work, we elucidate our advancement towards elevating the Q-factor tenfold, an achievement made possible through the enhancement of machining precision, the application of rigorous postprocessing techniques—including mechanical, chemical, and surface treatments—as well as the refinement of our testing methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Covariance-Free Bifidelity Control Variates Importance Sampling for Rare Event Reliability Analysis

Multifidelity modeling has been steadily gaining attention as a tool to address the problem of exorbitant model evaluation costs that makes the estimation of failure probabilities a significant computational challenge for complex real-world problems, particularly when failure is a rare event. To implement multifidelity modeling, estimators that efficiently combine information from multiple models/sources are necessary. In past works, the variance reduction techniques of control variates (CV) and importance sampling (IS) have been leveraged for this task. In this paper, we present the CVIS framework—a creative take on a coupled CV and IS estimator for bifidelity reliability analysis. The framework addresses some of the practical challenges of the CV method by using an estimator for the control variate mean and sidestepping the need to estimate the covariance between the original estimator and the control variate through a clever choice for the tuning constant. Furthermore, the task of selecting an efficient IS distribution is also considered, with a view towards maximally leveraging the bifidelity structure and maintaining expressivity. Additionally, a diagnostic is provided that indicates both the efficiency of the algorithm as well as the relative predictive quality of the models utilized. Finally, the behavior and performance of the framework is explored through analytical and numerical examples.

Markov chain Monte Carlo↗

Formulations and Valid Inequalities for Optimal Black Start Allocation in Power Systems

The restoration of a power system after a blackout starts around units with enhanced technical capabilities, referred to as black start units (BSUs). We examine the planning problem of optimally allocating these units on the grid subject to a budget constraint. We present a mixed integer programming model based on current literature in power systems. Binary variables are associated with the allocation of BSUs and with the energization state of buses, branches, and generators of the power system over a time horizon. We extract a substructure of the feasible region which imposes the requirement that each island that appears during the restoration process must have at least one operational generator. We discuss three equivalent reformulations for this requirement. We introduce a family of exponentially many, polynomially separable, valid inequalities to strengthen the formulation. Under simplifying assumptions, we show that the convex hull of the feasible region is a full-dimensional polyhedron, and prove that some of the constraints we introduced are facet-defining. We perform experiments to examine the difference in strength between the formulations as well as the computational times to solve the problem to near optimality for synthetic instances of the IEEE-39, IEEE-118, Illinois-200, WECC-225, IEEE-300, South Carolina-500, and Texas-2000 power systems. We illustrate a use case of the model. We conclude by suggesting extensions of the current work for future research.

Black Start Allocation↗

Physics-Informed Gaussian Process Regression for States Estimation and Forecasting in Power Grids

Real-time state estimation and forecasting are critical for the efficient operation of power grids. In this paper, a physics-informed Gaussian process regression (PhI-GPR) method is presented and used for forecasting and estimating the phase angle, angular speed, and wind mechanical power of a three-generator power grid system using sparse measurements. In standard data-driven Gaussian process regression (GPR), parameterized models for the prior statistics are fit by maximizing the marginal likelihood of observed data. In the PhI-GPR method, we propose to compute the prior statistics offline by solving stochastic differential equations (SDEs) governing the power grid dynamics. The short-term forecast of a power grid system dominated by wind generation is complicated by the stochastic nature of the wind and the resulting uncertainty in wind mechanical power. Here, we assume that the power grid dynamics are governed by swing equations, with the wind mechanical power fluctuating randomly in time. We solve these equations for the mean and covariances of the power grid states using the Monte Carlo simulation method. We demonstrate that the proposed PhI-GPR method can accurately forecast and estimate observed and unobserved states. For the considered problem, PhI-GPR has computational advantages over the ensemble Kalman filter (EnKF) method: In PhI-GPR, ensembles are computed offline and independently of the data acquisition process, whereas for EnFK, ensembles are computed online with data acquisition, rendering real-time forecast more challenging. We also demonstrate that the PhI-GPR forecast is more accurate than the EnKF forecast when the random mechanical wind power is non-Markovian. In contrast, the two methods produce similar forecasts for the Markovian mechanical wind power. For observed states, we show that PhI-GPR provides a forecast comparable to the standard data-driven GPR; both forecasts are significantly more accurate than the autoregressive integrated moving average (ARIMA) forecast. We also show that the ARIMA forecast is more sensitive to observation frequency and measurement errors than the PhI-GPR forecast.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Joint Chance Constraints in AC Optimal Power Flow: Improving Bounds through Learning

This paper considers distribution systems with a high penetration of distributed, renewable generation and addresses the problem of incorporating the associated uncertainty into the optimal operation of these networks. Joint chance constraints, which satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints, leading to a chance-constrained optimal power flow problem. Departing from the computationally-heavy scenario-based approaches or approximations that transform the joint constraint into conservative deterministic constraints, this paper develops a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and accurately and efficiently approximates bounds on the joint chance constraint iteratively. In particular, the proposed framework improves upon the classic methods based on the union bound (or Boole's inequality) by generating a much less conservative set of single chance constraints that also guarantees the satisfaction of the original joint constraint. The proposed framework is evaluated numerically using the IEEE 37-node test feeder, focusing on the problem of voltage regulation in distribution grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Formal analysis of device authentication applications in ubiquitous computing.

Authentication between mobile devices in ad-hoc computing environments is a challenging problem. Without pre-shared knowledge, existing applications rely on additional communication methods, such as out-of-band or location-limited channels for device authentication. However, no formal analysis has been conducted to determine whether out-of-band channels are actually necessary. We answer this question through formal analysis, and use BAN logic to show that device authentication using a single channel is not possible.

99 GENERAL AND MISCELLANEOUS↗

Calibration of the Diffusivity Predictions of Centipede Using Approximate Bayesian Computation and Applications in Nyx (Engineering Scale) and Xolotl-MARMOT (Meso-Scale) Simulations

Fission gas evolution and release in UO 2 nuclear fuel are important fuel performance metrics and occur in several distinct stages: 1) nucleation, growth and resolution of intra-granular bubbles, 2) diffusion to grain boundaries and 3) nucleation and growth of bubbles at grain boundaries, which eventually form a connected network (percolation) enabling release of gas from grain boundaries through connections to triple junctions, grain edges or free surfaces. The NE-SciDAC project is developing several computational tools to model this problem, which are connected in a hierarchical multi-scale framework. The information transfer in the multi-scale framework is a critical step that, in addition to best-estimates, should include uncertainty quantification. Despite taking a first-principles multi-scale approach, there is a need to perform parameter calibration to ensure consistency with available experimental data. In the present study, uncertainty quantification (UQ) and parameter calibration is demonstrated for one of the lower length scale codes in the multi-scale framework (Centipede) and then the results, including instances of the propagated uncertainties, are used in other codes within the framework, specifically Nyx and Xolotl-MARMOT. We calibrated the model parameters in Centipede, a computer code used to predict diffusivities of uranium (U) and xenon (Xe) in the context of the simulation of fission gas in uranium oxide (UO 2 ) nuclear fuel. The Centipede code depends on 183 parameters, all of which are subject to uncertainty. The three data sets used in our calibration effort are taken from the literature. This data is available as a set of measurements, including measurement errors. Our goal is to calibrate a statistical model that predicts both the value of the measurement and the uncertainty associated with the measurement. We perform a Bayesian calibration of the model parameters using a dedicated approximate Bayesian computation (ABC) likelihood function. To avoid excessive computational costs, we replace the expensive Centipede simulation code by a higher-order surrogate model, constructed using only the 9 most important parameters. These important parameters are identified by a preliminary global sensitivity analysis (GSA) study. Among the important parameters are T0 (the temperature at which UO 2 is perfectly stoichiometric) and Hf_pO2 (the temperature dependence of the oxygen (O) partial pressure) that should be considered as operating conditions to be estimated along with the other parameters. We consider two different cases: one where we define one set of these operating conditions for all data sets, and one where we define distinct operating condition parameters for each data set. The Xe diffusivities predicted by the latter case show distinct features that could not be observed in the former. Next, we use the diffusivity predictions by Centipede as input to Nyx, a reduced order fuel performance code focused on gas behavior alone, in order to estimate quantities associated with inter-granular bubble formation at conditions specified by the experiments. Finally, the diffusivities obtained from the calibrated Centipede runs were used in coupled Xolotl-MARMOT simulations of intra- and inter-granular gas evolution. The results are compared to simulations using the baseline diffusivities from Turnbull et al.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Solution of Boundary Value Problems in Cylinders with Two-Layer Film Inclusions

We consider the class of boundary value problems for elliptic, parabolic, and hyperbolic equations in cylinders separated by a two-layer film into two half-cylinders. We prove the existence and uniqueness theorem and express the solutions in terms of solutions to analogous classical problems in cylinders without films.

97 MATHEMATICS AND COMPUTING↗

Autonomous Noether Boundary-Value Problems not Solved with Respect to the Derivative

In monographs of N. V. Azbelev, A. M. Samoilenko, and A. A. Boichuk, constructive methods of study of Noether boundary-value problems have been developed. These methods continue the investigation of periodic problems stated by H. Poincaré, A. M. Lyapunov, N. M. Krylov, N. N. Bogolyubov, I. G. Malkin, and O. Veivoda by the methods of small parameter. We propose an improved scheme of study of autonomous Noether boundary-value problems for nonlinear systems in critical cases. In the case of multiple roots of the equation for generating constants, we obtain sufficient conditions of existence of solutions to an autonomous boundary-value problem not solved with respect to the derivative. The effectiveness of the scheme proposed is illustrated by an example of the periodic problem for the Liénard equation.

97 MATHEMATICS AND COMPUTING↗

Parallel Algorithms and Patterns

This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.

97 MATHEMATICS AND COMPUTING↗

Verification Validation and Uncertainty Quantification for CGS

The overall conduct of verification, validation and uncertainty quantification (VVUQ) is discussed through the construction of a workflow relevant to computational modeling including the turbulence problem in the coarse grained simulation (CGS) approach. The workflow contained herein is defined at a high level and constitutes an overview of the activity. Nonetheless, the workflow represents an essential activity in predictive simulation and modeling. VVUQ is complex and necessarily hierarchical in nature. The particular characteristics of VVUQ elements depend upon where the VVUQ activity takes place in the overall hierarchy of physics and models. In this chapter, we focus on the differences between and interplay among validation, calibration and UQ, as well as the difference between UQ and sensitivity analysis. The discussion in this chapter is at a relatively high level and attempts to explain the key issues associated with the overall conduct of VVUQ. The intention is that computational physicists can refer to this chapter for guidance regarding how VVUQ analyses fit into their efforts toward conducting predictive calculations.

Rider, William J.↗

Natural equilibria in steady-state neutron diffusion with temperature feedback

The critical diffusion equation with feedback is investigated within the context of steady-state multiphysics. It is proposed that for critical configurations there is no need to include the multiplication factor k in the formulation of the diffusion equation. This is notable because exclusion of k from the coupled system of equations precludes the mathematically tenuous notion of a nonlinear eigenvalue problem. On the other hand, it is shown that if the factor k is retained in the diffusion equation, as is currently common practice, then the resulting problem is equivalent to the constrained minimization of a functional representing the critical equilibrium of neutron and temperature distributions. The unconstrained solution corresponding to k = 1 represents the natural equilibrium of a critical system at steady-state. Computational methods for solving the constrained problem (with k) are briefly reviewed from the literature and a method for the unconstrained problem (without k) is outlined. A numerical example is studied to examine the effects of the constraint in the nonlinear system. (authors)

97 MATHEMATICS AND COMPUTING↗

LDRD HPC4Energy Wrapup Report - LDRD 12-ERD-074

High-performance computing and simulation has the potential to optimize production, distribution, and conversion of energy. Although a number of concepts have been discussed, a comprehensive research project to establish and quantify the effectiveness of computing and simulation at scale to core energy problems has not been conducted. We propose to perform the basic research to adapt existing high-performance computing tools and simulation approaches to two selected classes of problems common across the energy sector. The first, applying uncertainty quantification and contingency analysis techniques to energy optimization, allows us to assess the effectiveness of LLNL core competencies to problems such as grid optimization and building-system efficiency. The second, applying adaptive meshing and numerical analysis techniques to physical problems at fine scale, could allow immediate impacts in key areas such as efficient combustion and fracture and spallation. By creating an integrated project team with the necessary expertise, we can efficiently address these issues, delivering both near-term results as well as quantifying developments needed to address future energy challenges.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗