Energy transport between heat baths with oscillating temperatures
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Engineering Papers
Results for “algorithmic differentiation”
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.
A Two-Stage Decomposition Approach for AC Optimal Power Flow
The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023
Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?
97 MATHEMATICS AND COMPUTING↗
Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023
Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?
97 MATHEMATICS AND COMPUTING↗
FORCE Update 2024
The Framework for Optimization of Resources and Economics (FORCE) tool suite is the U.S. Department of Energy’s Nuclear Integrated Energy Systems (IES) Program flagship tool suite for technoeconomic IES analysis of IES. This tool suite is useful for analysis designed to evaluate and improve the technoeconomics of energy production systems, particularly for systems including nuclear technology. In this report, we document the development activity for the FORCE tool suite to extend its capabilities as performed during fiscal year 2024. In addition to reliability and accessibility, capability is one of the three standards guiding the development of the FORCE tool suite and the software codes that are its constituent parts. Extending the capabilities of the FORCE tool suite allows analysis both within the IES program as well as industry, university, and laboratory partners to perform analysis with more accuracy, insight, and impactful narrative. Four areas of capability development were the focus of activity this year: economic parameter uncertainty quantification, multiresolution analysis, components-to-optimization workflow automation, and statespace construction workflows for real-time optimal control. In economic parameter uncertainty quantification, the ability of HERON to capture risk due to scenarios (weather and energy demand uncertainty) was expanded to also include uncertainties in financial parameters such as capital cost or operation and maintenance costs. By including these sources of uncertainty, which are sometimes very large compared with scenario uncertainty, HERON is better able to capture the risk posed by investment in various IES technology. Because of this, analysts can also consider the reduction in risks that can be realized by choice of some technologies. In multiresolution analysis, development activity extended on work completed previously. In fiscal year 2023, methods for decomposing time series signals, such as demand, solar and wind availability, and price profiles, were analyzed and down-selected to those most effective at splitting signals into different resolutions. These resolutions allow considering the influence of different energy demand and supply behaviors across different time scales. For example, energy demand might be divided into seasonal, weekly, and hourly profiles. In fiscal year 2024, this preliminary work was extended and implemented within the Risk Analysis Virtual Environment (RAVEN) risk and uncertainty analysis platform, which is used throughout the FORCE framework. This development of the “multi-resolution time series analysis” (MR-TSA) module in RAVEN allows training synthetic history generators on complex time series. These synthetic history generators can then be used in HERON for generating scenarios that represent possible market and weather scenarios that can be analyzed on different time scales. We envision completing this work in the future, implementing multiresolution dispatch optimization strategies that can make the most beneficial use of these stratified time histories. In components-to-optimization workflow development, workflows for translating user inputs of components into algorithms for algebraic optimization were selected and implemented. Similar algorithms within the Holistic Energy Resource Optimization Network (HERON) were separated from the main code base of HERON and gathered with the components-to-optimization workflows in the new Dispatch Optimization Variable Engine (DOVE) software library. This modularization allows FORCE users to analyze dispatch optimization and energy system duty cycles independently of HERON, which previously was a burdensome task. Additionally, these dispatch optimization algorithms, set up in an independent library, can now be used across all software applications within FORCE, especially including the real-time optimal control software Optimization of Real-time Capacity Allocation (ORCA). Allowing FORCE software to share dispatch optimization algorithms within a single library allows for improved software maintenance and reliability. In statespace characterization workflow development, alternative workflows for optimizing dispatch with additional technical accuracy was the focus, particularly to improve the real-time optimization decision making in ORCA. Using algorithms and workflows initially developed for the Feasible Actuator Range Modifier (FARM), workflows for determining the statespace representation of IES were identified and demonstrated. The resulting dispatch optimization required a more robust optimization algorithm than that originally used in HERON (and moved to DOVE), which required adding an alternate workflow to DOVE that can more accurately match the behavior of physical systems using a partial differential equation representation. In conclusion, capability developments in the FORCE tool suite in fiscal year 2024 have improved the ability of the FORCE tool suite to perform
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Adaptively Learned Modeling for a Digital Twin of Hydropower Turbines with Application to a Pilot Testing System
In the development of a digital twin (DT) for hydropower turbines, dynamic modeling of the system (e.g., penstock, turbine, speed control) is crucial, along with all the necessary data interface, virtualization, and dashboard designs. Since the DT must mimic the actual dynamics of the hydropower turbine accurately, adaptive learning is required to train these dynamic models online so that the models in the DT can effectively follow the representation of the actual hydropower turbine dynamics accurately and reliably. This study presents an adaptive learning method for obtaining the hydropower turbine models for DT development of hydropower systems using the recursive least squares algorithm. To simplify the formulation, the hydropower turbine under consideration was assumed to operate near a fixed operating point, where the system dynamics can be well represented by a set of linear differential equations with constant parameters. In this context, the well-known six-coefficient model for the Francis turbine was formulated as the starting point to obtain input and output models for the turbine. Then, an adaptive learning mechanism was developed to learn model parameters using real-time data from a hydropower turbine testing system. This led to semi-physical modeling, in which first principles and data-driven modeling are integrated to produce dynamic models for DT development. Applications to a pilot system at the Norwegian University of Science and Technology (NTNU) were made, and the models learned adaptively using the data collected from the university’s pilot system. Desired modeling and validation results were obtained.
13 HYDRO ENERGY↗
COMOC: Three dimensional boundary region variant, programmer's manual
The three-dimensional boundary region variant of the COMOC computer program system solves the partial differential equation system governing certain three-dimensional flows of a viscous, heat conducting, multiple-species, compressible fluid including combustion. The solution is established in physical variables, using a finite element algorithm for the boundary value portion of the problem description in combination with an explicit marching technique for the initial value character. The computational lattice may be arbitrarily nonregular, and boundary condition constraints are readily applied. The theoretical foundation of the algorithm, a detailed description on the construction and operation of the program, and instructions on utilization of the many features of the code are presented.
Orzechowski, J. A.↗
Accuracy and convergence of a finite element algorithm for laminar boundary layer flow
The Galerkin-weighted residuals formulation is employed to derive an implicit finite element solution algorithm for a generally non-linear initial-boundary value problem. Solution accuracy and convergence with discretization refinement are quantized in several error norms, for the non-linear parabolic partial differential equation system governing laminar boundary layer flow, using linear, quadratic and cubic functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the non-linear equations characteristic of laminar boundary layer flow.
Soliman, M. O.↗
Mosaic organization of DNA nucleotides
Long-range power-law correlations have been reported recently for DNA sequences containing noncoding regions. We address the question of whether such correlations may be a trivial consequence of the known mosaic structure ("patchiness") of DNA. We analyze two classes of controls consisting of patchy nucleotide sequences generated by different algorithms--one without and one with long-range power-law correlations. Although both types of sequences are highly heterogenous, they are quantitatively distinguishable by an alternative fluctuation analysis method that differentiates local patchiness from long-range correlations. Application of this analysis to selected DNA sequences demonstrates that patchiness is not sufficient to account for long-range correlation properties.
NASA Discipline Number 14-10↗
Improvements to the OMI Near-uv Aerosol Algorithm Using A-train CALIOP and AIRS Observations
The height of desert dust and carbonaceous aerosols layers and, to a lesser extent, the difficulty in assessing the predominant size mode of these absorbing aerosol types, are sources of uncertainty in the retrieval of aerosol properties from near UV satellite observations. The availability of independent, near-simultaneous measurements of aerosol layer height, and aerosol-type related parameters derived from observations by other A-train sensors, makes possible the direct use of these parameters as input to the OMI (Ozone Monitoring Instrument) near UV retrieval algorithm. A monthly climatology of aerosol layer height derived from observations by the CALIOP (Cloud-Aerosol Lidar with Orthogonal Polarization) sensor, and real-time AIRS (Atmospheric Infrared Sounder) CO observations are used in an upgraded version of the OMI near UV aerosol algorithm. AIRS CO measurements are used as a reliable tracer of carbonaceous aerosols, which allows the identification of smoke layers in areas and times of the year where the dust-smoke differentiation is difficult in the near-UV. The use of CO measurements also enables the identification of elevated levels of boundary layer pollution undetectable by near UV observations alone. In this paper we discuss the combined use of OMI, CALIOP and AIRS observations for the characterization of aerosol properties, and show a significant improvement in OMI aerosol retrieval capabilities.
Improvements to OMI↗
Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes
In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.
97 MATHEMATICS AND COMPUTING↗
Bias-Variance Trade-Off in Physics-Informed Neural Networks with Randomized Smoothing for High-Dimensional PDEs
Physics-Informed Neural Networks (PINNs) have triggered a paradigm shift in scientific computing, leveraging mesh-free properties and robust approximation capabilities. While proving effective for low-dimensional partial differential equations (PDEs), the computational cost of PINNs remains a hurdle in high-dimensional scenarios. This is particularly pronounced when computing high-order and high-dimensional derivatives in the physics-informed loss. Randomized Smoothing PINN (RS-PINN) introduces Gaussian noise for stochastic smoothing of the original neural net model, enabling the use of Monte Carlo methods for derivative approximation, which eliminates the need for costly automatic differentiation. Despite its computational efficiency, especially in the approximation of high-dimensional derivatives, RS-PINN introduces biases in both loss and gradients, negatively impacting convergence, especially when coupled with stochastic gradient descent (SGD) algorithms. We present a comprehensive analysis of biases in RS-PINN, attributing them to the nonlinearity of the Mean Squared Error (MSE) loss as well as the intrinsic nonlinearity of the PDE itself. We propose tailored bias correction techniques, delineating their application based on the order of PDE nonlinearity. The derivation of an unbiased RS-PINN allows for a detailed examination of its advantages and disadvantages compared to the biased version. Specifically, the biased version has a lower variance and runs faster than the unbiased version, but it is less accurate due to the bias. To optimize the bias-variance trade-off, we combine the two approaches in a hybrid method that balances the rapid convergence of the biased version with the high accuracy of the unbiased version. In addition to methodological contributions, we present an enhanced implementation of RS-PINN. Extensive experiments on diverse high-dimensional PDEs, including Fokker-Planck, Hamilton-Jacobi-Bellman (HJB), viscous Burgers’, Allen-Cahn, and Sine-Gordon equations, illustrate the bias-variance trade-off and highlight the effectiveness of the hybrid RS-PINN. Empirical guidelines are provided for selecting biased, unbiased, or hybrid versions, depending on the dimensionality and nonlinearity of the specific PDE problem.
97 MATHEMATICS AND COMPUTING↗
Semi-Analytical Hierarchical Bayesian Inference of Nonlinear Model Structure in Stochastic Dynamics: Applied to Compartmental Models of Infectious Diseases
A Bayesian computational framework for parsimonious inference in stochastic nonlinear dynamical systems is presented. This framework enables the concurrent estimation of system states, time-varying parameters, time-invariant parameters, and the optimal sparsity structure of the model parameters. Because differential equation-based models are often simplified mechanistic or phenomenological representations, robust inference from noisy measurement data requires explicit treatment of model error and uncertainty. Model error and time-varying parameters can be represented as random processes, enabling inference while making minimal assumptions about the underlying sources of discrepancy and variability. Adopting stochastic differential equation representations affords the model significant flexibility, but can also render it susceptible to overfitting during statistical inversion, where the inferred model may track noise rather than the underlying signal. To alleviate the effects of overfitting and to enable the discovery of the optimal sparse representation of the time-invariant parameters, a Bayesian sparse learning algorithm is embedded within the framework. This sparse learning framework adopts an approximate hierarchical Bayesian setting defined by a series of semi-analytical expressions. The model structure inference framework is validated using a stochastic compartmental model for tracking and forecasting active cases of an infectious disease. Compartmental models describe population-level infectious disease dynamics through interactions among population fractions grouped by disease state. Mathematically, such models consist of a system of coupled ordinary differential equations. This example adopts an expressive compartmental model that includes multiple possible interactions between disease states, motivated by early uncertainty surrounding COVID-19 reinfection dynamics and their implications for long-term epidemic forecasting. The sparse learning exercise permits the inference of a priori unknown epidemiological dynamics from simulated public health data, discovering the nested compartmental model that optimizes the trade-off between average data-fit and model complexity. It is shown that inducing sparsity among the model parameters eliminates redundant interactions between compartments, equivalently revealing the optimal coupling structure between differential equations.
97 MATHEMATICS AND COMPUTING↗
The application of generalized, cyclic, and modified numerical integration algorithms to problems of satellite orbit computation
Generalized, cyclic, and modified multistep numerical integration methods are developed and evaluated for application to problems of satellite orbit computation. Generalized methods are compared with the presently utilized Cowell methods; new cyclic methods are developed for special second-order differential equations; and several modified methods are developed and applied to orbit computation problems. Special computer programs were written to generate coefficients for these methods, and subroutines were written which allow use of these methods with NASA's GEOSTAR computer program.
Chesler, L.↗
Bilevel Parameter Optimization for Nonlocal Image Denoising Models
We propose a bilevel optimization approach for the determination of parameters in nonlocal image denoising. We consider both spatial weights in front of the fidelity term, as well as weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order optimization algorithm in combination with a finite element discretization of the nonlocal denoising models and a computational strategy for the solution of the resulting dense linear systems. Several experiments are run in order to show the suitability of our approach.
97 MATHEMATICS AND COMPUTING↗
RELAP-7 Application and Enhancement for FLEX Strategies and ATF Behavior under Extended Loss of AC Power Conditions
This report summarizes the results of a three-year research project sponsored by the U.S. Department of Energy (DOE) Nuclear Energy University Program (NEUP) to enhance and apply the RELAP-7 code by adding and improving several important components (e.g., a mechanistic Reactor Core Isolation Cooling (RCIC) system model) for thermal hydraulic studies of LWRs under ELAP conditions and evaluating the time available for transition to portable FLEX equipment. The project team included University of Massachusetts–Lowell, The Ohio State University, Texas A&M University, Idaho National Laboratory and Oak Ridge National Laboratory. In the Fukushima accident, it was found that the RCIC system played a crucial role in delaying core meltdown by almost three days in Fukushima Daiichi Unit 2, because of self-regulated operation of the steam driven RCIC turbine-pump injection system. Steam flow in the convergent-divergent nozzles of the RCIC Terry turbine is two-phase non-equilibrium transonic flow with homogenous nucleation condensation. To more accurately predict the dynamic process and behavior of the transonic compressible steam flow, a one-dimensional transient two-phase analytical model is presented. A simplified four-fluid model was employed in the present work with the consideration of four separate fluid fields: vapor, liquid film, entrained droplets and condensed droplets. The mass, momentum and energy interactions between the fluids were considered and modeled. An extended seven-equation non-equilibrium critical flow model was developed to obtain the critical pressure and velocities of each phase at the nozzle throat. To predict the wetness in the divergent section, a mechanistic nucleation condensation model was integrated in the nozzle analysis model, considering the generation and consequent growth of droplets. The governing differential equations on a staggered grid were discretized using the second-order Lax-Wendroff scheme with a flux limiter, and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE) algorithm was employed to solve the discrete linear system. To demonstrate the predictability and reliability of the physical models and the numerical method proposed in the present work, three representative nozzles were modeled and simulated. The results show good agreement with the available experimental data, even for condensation shock. Then, the 1D nozzle model was employed to obtain nozzle flow tables of the Terry turbine nozzle for different working pressures which can cover the operation pressure range of the RCIC system. A mechanistic RCIC turbine-pump system model was developed and implemented in the system code TRACE to simulate dynamic responses of the RCIC system under Beyond Design Basis Accident (BDBA) conditions. The turbine-pump governing equations are based on the control volume approach of the angular momentum balance. The physics based mechanistic RCIC model was developed using the TRACE control system components (i.e., signal variables, control blocks, and tables), and incorporated into a TRACE boiling water reactor (BWR) model. The TRACE model in this report has a detailed nodalization of the reactor pressure vessel (RPV), and all of the major flow paths and system components, including the safety relief valves (SRVs) and the containment suppression pool and drywell. Based on the nozzle flow tables generated from the 1D nozzle model developed, the turbine drive torque can be calculated from table lookup. Since the detailed specifications of the RCIC pump are unavailable, the homologous curves for a Bingham pump were used in the current pump component. A station black-out (SBO) accident test problem was selected to demonstrate the TRACE RCIC model. The short-term SBO simulations were performed for two cladding materials: Zircaloy and FeCrAl, to demonstrate the effect of the accident tolerant fuel cladding on fuel heat-up under BDBA accident conditions. The wetwell plays a vital safety role in SBO and other BWR accident scenarios in that it can reduce containment pressure and supply additional core make-up water. The suppression pool temperature distribution has a very large impact on both RPV and containment pressure. Thus, another novel contribution of the project comes mainly from an improved, systems-level wetwell model which can capture buoyancy-induced thermal stratification effects due to steam injection and condensation. A two-zone stratified wetwell model has been implemented in RELAP-7 and some results from that model are presented. This wetwell model is capable of simulating thermal stratification due to a low steam mass injection rate. With a low mass flow rate, the model assumes that all the steam condenses within the pipe and the resulting plume can be approximated with a purely buoyant, heat-source driven model. The wetwell model developed with these assumptions is adequate to simulate slow transients such as extended SBO transients.
42 ENGINEERING↗
Algorithm for worst error in linear systems with bounded input and its rate of change.
Computational worst error algorithm for linear systems and quadratic error criteria, showing flowgraph and computer execution results
ERROR DETECTING CODE↗
Finite element computational fluid mechanics
Finite element analysis as applied to the broad spectrum of computational fluid mechanics is analyzed. The finite element solution methodology is derived, developed, and applied directly to the differential equation systems governing classes of problems in fluid mechanics. The heat conduction equation is used to reveal the essence and elegance of finite element theory, including higher order accuracy and convergence. The algorithm is extended to the pervasive nonlinearity of the Navier-Stokes equations. A specific fluid mechanics problem class is analyzed with an even mix of theory and applications, including turbulence closure and the solution of turbulent flows.
Baker, A. J.↗