Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “solving”

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 307 records · Page 17

PySP : modeling and solving stochastic mixed-integer programs in Python.

Although stochastic programming is a powerful tool for modeling decision-making under uncertainty, various impediments have historically prevented its widespread use. One key factor involves the ability of non-specialists to easily express stochastic programming problems as extensions of deterministic models, which are often formulated first. A second key factor relates to the difficulty of solving stochastic programming models, particularly the general mixed-integer, multi-stage case. Intricate, configurable, and parallel decomposition strategies are frequently required to achieve tractable run-times. We simultaneously address both of these factors in our PySP software package, which is part of the COIN-OR Coopr open-source Python project for optimization. To formulate a stochastic program in PySP, the user specifies both the deterministic base model and the scenario tree with associated uncertain parameters in the Pyomo open-source algebraic modeling language. Given these two models, PySP provides two paths for solution of the corresponding stochastic program. The first alternative involves writing the extensive form and invoking a standard deterministic (mixed-integer) solver. For more complex stochastic programs, we provide an implementation of Rockafellar and Wets Progressive Hedging algorithm. Our particular focus is on the use of Progressive Hedging as an effective heuristic for approximating general multi-stage, mixed-integer stochastic programs. By leveraging the combination of a high-level programming language (Python) and the embedding of the base deterministic model in that language (Pyomo), we are able to provide completely generic and highly configurable solver implementations. PySP has been used by a number of research groups, including our own, to rapidly prototype and solve difficult stochastic programming problems.

99 GENERAL AND MISCELLANEOUS↗

Parallelization of the Red-Black Algorithm on Solving the Second-Order PN Transport Equation with the Hybrid Finite Element Method

The Red-Black algorithm has been successfully applied on solving the second-order parity transport equation with the PN approximation in angle and the Hybrid Finite Element Method (HFEM) in space, i.e., the Variational Nodal Method (VNM) [1,2,3,4,5]. Any transport solving techniques, including the Red-Black algorithm, need to be parallelized in order to take the advantage of the development of supercomputers with multiple processors for the advanced modeling and simulation. To our knowledge, an attempt [6] was done to parallelize it, but it was devoted only to the z axis plans in three-dimensional calculations. General parallelization of the Red-Black algorithm with the spatial domain decomposition has not been reported in the literature. In this summary, we present our implementation of the parallelization of the Red-Black algorithm and its efficiency results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Of FFT-based convolutions and correlations, with application to solving Poisson's equation in an open rectangular pipe

A new method is presented for solving Poisson's equation inside an open-ended rectangular pipe. The method uses Fast Fourier Transforms (FFTs)to perform mixed convolutions and correlations of the charge density with the Green function. Descriptions are provided for algorithms based on theordinary Green function and for an integrated Green function (IGF). Due to its similarity to the widely used Hockney algorithm for solving Poisson'sequation in free space, this capability can be easily implemented in many existing particle-in-cell beam dynamics codes.

43 PARTICLE ACCELERATORS↗

A projection preconditioner for solving the implicit immersed boundary equations

This study presents a method for solving the linear semi-implicit immersed boundary equations which avoids the severe time step restriction presented by explicit-time methods. The Lagrangian variables are eliminated via a Schur complement to form a purely Eulerian saddle point system, which is preconditioned by a projection operator and then solved by a Krylov subspace method. From the viewpoint of projection methods, we derive an ideal preconditioner for the saddle point problem and compare the efficiency of a number of simpler preconditioners that approximate this perfect one. For low Reynolds number and high stiffness, one particular projection preconditioner yields an efficiency improvement of the explicit IB method by a factor around thirty. Substantial speed-ups over explicit-time method are achieved for Reynolds number below 100. In conclusion, this speedup increases as the Eulerian grid size and/or the Reynolds number are further reduced.

42 ENGINEERING↗

Implementation of the LAX-Wendroff Method in Cobra-TF for Solving Two-Phase Flow Transport Equations

COBRA-TF (Coolant Boiling in Rod Arrays Two Fluid), or CTF, is a subchannel code used to conduct the reactor core thermal hydraulic (T/H) solution in both standalone and coupled multi-physics applications. CTF applies the first-order upwind spatial discretization scheme for solving two-phase flow conservation equations. In this work, the second-order Lax-Wendroff (L-W) scheme has been implemented in CTF to solve the two-phase flow transport equations to improve numerical accuracy in both temporal and spatial discretization. To avoid the oscillation issue, a non-linear flux limiter VA (Van Albada) is employed for the convective terms in the transport equations. Assessments have been carried out to evaluate the performance and stability of the implemented second-order L-W scheme. It has been found that the L-W scheme performs better than the upwind scheme for the single-phase and two-phase flow problems in terms of numerical accuracy and computational efficiency.

CTF↗

SOLVING CONJUGATE HEAT TRANSFER PROBLEM IN TWO-PHASE FLOW USING NEWTON-KRYLOV METHOD

In this paper, we successfully demonstrated an application of the Jacobian-free Newton Krylov (JFNK) method in solving the conjugated two-phase channel flow and heat conduction problem, in a fully coupled and fully implicit manner. Such a problem represents the most fundamental piece of safety analysis codes, for example the heat transfer between fuel rods and reactor coolant during postulated accidental scenarios. The two-phase flow is modeled with the widely accepted one-dimensional two-fluid two-phase flow model, and the heat conduction is modeled with two-dimensional heat conduction model. The coupling between these two physics is realized through the wall heat transfer term in fluid equations and heat flux boundary conditions of heat conduction model. For spatial discretization, both the first-order and second- order upwind schemes are considered for flow equations, while the standard central differencing method is used for the heat conduction model. For time integration, both the first-order backward Euler (BDF1) and second-order BDF2 schemes are considered. Several treatments were also introduced to enhance the robustness of the JFNK method in solving such a problem that is discontinuous in nature because of the discrete closure correlations. These treatments include the re-introduction of a transition region between the slug and annular mist flow regimes, and a simplification in the interfacial drag term. Numerical results have been extensively validated with experimental data in both vertical pipe and rod bundle geometries with a wide range of thermal-hydraulics conditions, including pressure, inlet subcooling, wall heat flux, outlet void fraction, and etc. Further benchmark with the RELAP5-3D code confirms the correct implementation of wall heat transfer models.

42 ENGINEERING↗

Newton-Krylov Method in Applications of Solving Two-phase Problems using Drift Flux Model

In this paper, Jacobian-free Newton-Krylov (JFNK) method is investigated in an application to implicitly solve two-phase flow problems using four-equation drift flux model. The closure models include the EPRI drift flux correlations and additional constitutive models to determine flow regimes, wall boiling and interfacial heat/mass transfer, two-phase flow wall friction, etc. Different from many traditional computer codes, fully implicit methods are used for the time integration. The resulted nonlinear discretized equation system is solved using the JFNK method. Expensive and error prone derivation and implementation of the analytical Jacobian matrix are avoided. Numerical results are successfully validated using existing experimental data on flow boiling under forced convection conditions in both pipe and rod bundle geometries.

42 ENGINEERING↗

Battery models, systems, and methods using robust fail-safe iteration free approach for solving differential algebraic equations

Battery models using robust fail-safe iteration free approach for solving Differential Algebraic Equations, and associated systems and methods are disclosed. In one embodiment, a method includes generating a model of the rechargeable battery; determining one or more initial conditions for one or more algebraic variables of the model using a solver; holding differential variables of the model static by a switch function while determining the one or more initial conditions; applying the initial conditions to the model by the switch function; and determining one or more parameters for the rechargeable battery by solving the algebraic and differential equations.

25 ENERGY STORAGE↗

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

Solving Complex Radioactive Decay Chains for Future Assessment and Cleanup Decisions - 17046

In support of U.S. Environmental Protection Agency's on-line calculators for risk and dose assessment, a decay chain tool was developed to address the need to understand how radionuclide activity changes with time as the activity measured in the past will be different from current and future levels. When a radionuclide decays, its activity decreases exponentially as a function of time transforming into a different atom - a decay product. The atoms keep transforming to new decay products until they reach a stable state and are no longer radioactive. The series of decay products created to reach this balance is called the decay chain. For radionuclide chains, the daughter products can have significant implications in dosimetry and remediation. Thus, risk assessors evaluating sites with radioactive contamination need to plan for future progeny ingrowth, in addition to sampled radionuclides. These are important considerations for risk quantification during the characterization and cleanup plans, particularly when sampling may have occurred years before the remediation cleanup work begins. If a radionuclide half-life and current activity are known, then hand-calculating the future activity is straightforward. However, calculating the ingrowth of progeny quickly becomes cumbersome for longer chains such as the Thorium-232 decay series. For the more complex chains where many daughters are formed, possibly with multiple branches, this calculation involves solving a complex set of simultaneous differential equations known as the Bateman Equation. The Decay Chain Activity Projection Tool calculates the activity of radionuclides and their progeny as a function of time. This tool currently uses a combination of Perl, JavaScript, Plot.ly, and jQuery to automatically construct the radionuclide decay chains, solve the resulting Bateman Equation, and provide the user with tabular solution output and plots. Additional software may be used as development advances. The risk assessor can then use the data for exposure assessment and cleanup decisions without further costly sampling. The benefits of providing this calculator are to prevent overestimation of risk due to decay of the parent isotope and to avoid underestimation of risk due to ingrowth of progeny more toxic than the parent. Graphs are provided to show the simultaneous decay rates and ingrowth, as well as tabular output at time-point T and all the decay half-life intervals. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Solving Drift-flux Model Using High-Resolution Spatial Discretization Scheme

Accurate modeling and simulation of the two-phase flow phenomena are critical to the system and safety analysis of light water reactors. Compared to the more complex two-fluid model, the drift-flux model treats the two phases as a mixture, and thus the models are formulated to consider the conservation laws of the mixture. The relative motion between the two phases is realized by constitutive correlations. Although the drift flux models have limitations in certain applications, they are widely used in many applications due to their simplicity and applicability to a wide range of two-phase flow problems. First-order numerical schemes are widely used in existing codes, which introduces excessive numerical diffusions. The objective of this work is to investigate a high-resolution spatial scheme in the application to solve drift-flux two-phase flow problems. In this study, a high-resolution spatial discretization scheme has been investigated in the application of solving drift-flux two-phase flow problem. The scheme is validated using existing experimental results. Compared to the first order scheme, it demonstrated excellent capability in reducing numerical error. Extended work will focus on the comparison of numerical errors from discretization schemes and model uncertainties. (authors)

42 ENGINEERING↗

Solving Inverse Transport Problems with Neutron Multiplication Measurements and Improved Differential Evolution

In the problem of inverse radiation transport, measurements of particle leakages from radioactive source/shield systems are used to infer unknown parameters within the systems. This reconstruction can be accomplished by finding the physical parameters of the unknown system that minimize the difference between calculated detector responses and measured detector responses. Recently, the differential evolution (DE) method was shown to be highly adept at solving inverse transport problems in which the measured quantities were leakages of unscattered gamma-ray lines. In this work, we present an extension of the DE method to problems in which both gamma-ray lines and neutron multiplication are measured. The neutron multiplication measurement is demonstrated to be an important addition when few gamma-ray lines are available. We also discuss the implementation of a variant of DE that significantly reduces the number of forward transport computations required to solve the inverse problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Parareal Method for Solving Space-Dependent Neutron Kinetics Equations in Hexagonal-z Geometry

Neutron kinetics plays an important role in reactor safety and analysis. The backward Euler method is the most widely used time integration method in the calculation of space-dependent nuclear reactor kinetics. Xia (2006) used this method to discretize the derivative of flux, and adopted the analytic integration to discretize the delayed neutron precursor concentrations. Diagonally Implicit Runge-Kutta (DIRK) method owns high accuracy and excellent stability, and it was applied in the rectangle core for calculating core the nuclear reactor kinetics by Wenbo Zhao (2013). Recently, DIRK was applied to the neutron kinetics for hexagonal-z geometry application (CAI, 2016). As solving the neutron kinetics equations is very time-consuming and the number of available cores continues to increase with parallel architectures evolving, parallel algorithms need to be designed in order to effectively utilize the available resources. However, it is difficult to parallel in time axis because the later moment is strongly dependent on the previous moment. Some methods have been proposed to parallel in time algorithm over the last decades. One of the famous methods to realize time parallelism is the Parareal algorithm (Lions, 2001), which offers a promising approach to increase the degree of concurrency. More than one decade from this method first proposed, this method has been studied and applied in the many fields of applied mathematics, physics, chemistry, parallel computing, etc. Fischer (2014 applied the Parareal method in the field of the Navier-Stokes Equations. Baudron (2014) combined the Parareal method with finite element method to solve the neutron kinetics equations, where the Parareal method was implemented based on the implicit Euler method or method. In this paper, the Parareal method is studied in the hexagonal-z geometry with the help of DIRK developed for neutron kinetics equations (CAI, 2016)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

HybridSystemsSimulations.jl - Solving the Merchant Collocated Facilities with JuMP

The development of new clean-generation technologies also leads to new plant-level architectures that combine several generation and storage assets behind the point of connection. These co-located generation resources (Hybrid Systems) primarily operate as merchant assets that employ automated market bidding models and internal Energy Management Systems (EMS) to comply with the operator's signals. Formulating an optimal bidding model requires embedding the EMS control model into the bidding algorithm, resulting in a bi-level optimization problem. In this presentation, we first showcase using JuMP to formulate and solve this problem effectively for multiple merchant systems and the bidding outcomes considering different model formulations. Second, the bidding outcomes are later integrated into a PowerSimulations.jl (also built with JuMP) simulation to study the system-level effects of the various merchant bidding and the interactions between market-clearing models and the embedded EMS model. We will showcase simulations conducted in the RTS system considering different levels of merchant hybrid systems participation. The presentation provides the following specific insights on JuMP usage: 1) the Formulation of specialized bi-level problems with custom cuts to solve the merchant hybrid system bidding problem; 2) the integration of a modular model within a complex simulation workflow supported by JuMP in PowerSimulations.jl; 3) Accelerating the solution of power systems operations simulation that employ agent optimization problems using JuMP.

energy markets↗

A Cartesian grid embedded boundary method for solving the Poisson and heat equations with discontinuous coefficients in three dimensions

We present a method for solving Poisson and heat equations with discon- tinuous coefficients in two- and three-dimensions. It uses a Cartesian cut-cell/embedded boundary method to represent the interface between materi- als, as described in Johansen& Colella (1998). Matching conditions across the interface are enforced using an approximation to fluxes at the boundary. Overall second order accuracy is achieved, as indicated by an array of tests using non-trivial interface geometries. Both the elliptic and heat solvers are shown to remain stable and efficient for material coefficient contrasts up to 106, thanks in part to the use of geometric multigrid. A test of accuracy when adaptive mesh refinement capabilities are utilized is also performed. An example problem relevant to nuclear reactor core simulation is presented, demonstrating the ability of the method to solve problems with realistic physical parameters.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Can I solve my structure by SAD phasing? Anomalous signal in SAD phasing

A key challenge in the SAD phasing method is solving a structure when the anomalous signal-to-noise ratio is low. We present a simple theoretical framework for describing measurements of anomalous differences and the resulting useful anomalous correlation and anomalous signal in a SAD experiment. Here, the useful anomalous correlation is defined as the correlation of anomalous differences with ideal anomalous differences from the anomalous substructure. The useful anomalous correlation reflects the accuracy of the data and the absence of minor sites. The useful anomalous correlation also reflects the information available for estimating crystallographic phases once the substructure has been determined. In contrast, the anomalous signal (the peak height in a model-phased anomalous difference Fourier at the coordinates of atoms in the anomalous substructure) reflects the information available about each site in the substructure and is related to the ability to find the substructure. A theoretical analysis shows that the expected value of the anomalous signal is the product of the useful anomalous correlation, the square root of the ratio of the number of unique reflections in the data set to the number of sites in the substructure, and a function that decreases with increasing values of the atomic displacement factor for the atoms in the substructure. In conclusion, this means that the ability to find the substructure in a SAD experiment is increased by high data quality and by a high ratio of reflections to sites in the substructure, and is decreased by high atomic displacement factors for the substructure.

59 BASIC BIOLOGICAL SCIENCES↗