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 1,513 records · Page 84

A Moving Discontinuous Galerkin Method with Interface Condition Enforcement for Reacting Hypersonic Flows

The necessity of enforcing conservation in computational elements or cells (element conservation) for discontinuous solutions is well understood and respected for solving conservation laws in computational fluid dynamics (CFD). In contrast, interface conservation, where the conservation across cell interfaces is enforced, is long ignored, and yet is also ruled and required by the underlying physics just like element conservation. Violation of the interface conservation across discontinuities is the root cause why an exact discontinuous solution can never be achieved in shock capturing methods. The interface conservation is examined and explored in this talk. Moving discontinuous Galerkin (MDG) finite element method with interface conservation enforcement (MDG-ICE) [1],[2] are then presented for solving compressible flow problems with discontinuities based on the observation that the interface conservation can only be satisfied, only when mesh interfaces are aligned with discontinuities. In the MDG-ICE formulation, both conservative quantities and grid geometry are considered as independent variables. A space-time DG formulation is used to solve the multi-material compressible Euler equations in the standard discontinuous solution space and the discrete grid geometry is solved using a variational formulation in a continuous space. A self-adaptive Levenberg-Marquardt method is utilized to solve the resulting over-determined system of nonlinear equations arising from the MDG-ICE formulation. A number of numerical experiments for a variety of flow problems are conducted to assess the accuracy and performance of the MDG-ICE method. Numerical results obtained indicate that the MDG-ICE method is able to deliver the designed order of both h- and p-convergence even for discontinuous solutions, and detect all types of interfaces, via interface condition enforcement and satisfy, via grid movement, the compressible Euler equations and the associated interface condition.

Discontinuous Galekin↗

Implementation, Realization and an Effective Solver of Two-Equation Turbulence Models

Currently, when the Reynolds-Averaged Navier-Stokes (RANS) equations are solved using turbulence modeling, most often the one-equation model of Spalart and Allmaras is used. Then, it is only necessary to solve the RANS equations in conjunction with a single transport equation for modeling turbulence. For this model, considerable assessment and analysis has been performed, allowing the possibility of a reliable solution method for an eddy viscosity required to compute the Reynolds stresses in the RANS equations. Such evaluation along with analysis has not been achieved to realize similar performance with two-equation models of the k-w type. The primary objective of this paper is to present and discuss the components of an effective numerical algorithm for solving the RANS equations and the two transport equations of k-w type turbulence models. All the important details of the turbulence model as actually implemented are given, which is sometimes not done in various papers considering such modeling. The viability and effectiveness of this solution algorithm are demonstrated by solving both two-dimensional and three-dimensional aerodynamic flows. In all applications, a linear rate of convergence without oscillations or other evidence of unstable behavior is observed. This behavior is also particularly true when the proposed algorithm is applied to systematically renewed mesh sequences, which is generally not observed with algorithms solving more than one transport equation. Thus, numerical integration errors are systematically reduced, allowing for a significantly more reliable assessment of the effectiveness of the turbulence model. Additionally, in this paper, analysis of the solution algorithm, including linear stability, is also performed for a particular flow problem.

Turbulence↗

Integrated Bosch Process System Models for In-Situ Oxygen and Carbon Production

In-Situ Resource Utilization (ISRU) technology is a vital component to NASA’s mission of a sustainable presence on the Moon and Mars. Local resources can be leveraged to reduce resupply frequency and mass. Elements of the Bosch process, combined with the carbothermal reduction process, can produce oxygen on the lunar surface with minimal consumables. The Bosch process can also produce oxygen on the Martian surface by using the CO 2 -rich environment. Between both systems, adsorption pump, solar thermal energy, carbon formation reactor, and water recovery subsystems are modeled and integrated to create a functional model in MATLAB software. The model is used to simulate performance of the system and reduce mass, power, and volume requirements. This integrated system model provides a tool to scale ISRU technologies for oxygen and carbon production. The MATLAB model is created by developing a system of independent subsystem models that are solved for their quasi-steady state values which can be integrated with respect to time to determine the change in current states. A flexible time stepping method is used to ensure a high level of accuracy during periods of rapid change while still making use of a simple explicit integration method. The flexible time step is calculated for each independent subsystem and the minimum value from those is used as the overall time step. A flexible time step is calculated by dividing a resolution value, or the maximum change per time step, by the variables current rate of change. The maximum value from all points in space is used for subsystem models that contain multiple values. The process is done for every variable that is being monitored in each subsystem and the global minimum is used as that iteration’s timestep. Several assumptions used in the MATLAB model for fluid flow dynamics, such as 1-D gas flow through the sorption pump, are supported by modeling in Ansys Fluent software. The Lunar oxygen production system is outlined in Fig. 1. The carbothermal reduction subsystem uses solar energy to heat a mixture of lunar regolith and carbon powder to produce carbon monoxide. To begin, the carbon monoxide feeds to the modified Bosch subsystem along with hydrogen gas. The reactants then enter the carbon formation reactor where water and carbon powder are produced. Solar thermal energy is used to add energy to the reactor, but waste heat from the carbothermal process is another potential heat source. The water is collected and electrolyzed to produce hydrogen which reenters the Bosch subsystem, and the oxygen is stored for downstream use. The carbon powder is collected and feeds back into the carbothermal subsystem. The Martian oxygen production system uses the full Bosch process and is outlined in Fig 2. A CO 2 adsorption pump thermally cycles to scrub and pressurize CO 2 from the environment. Along with an initial supply of hydrogen, the reactants enter the Reverse Water Gas Shift Reactor (RWGSR) which produces carbon monoxide and water. Carbon monoxide and unreacted hydrogen enter the carbon formation reactor to produce water and carbon powder. The water is collected from both reactors and electrolyzed to reintroduce hydrogen and store oxygen for propellant production or life support. Carbon is removed from the carbon formation reactor and stored. The adsorption pump utilizes rapid cycle temperature swings within a stack of zeolite coated surfaces. The subsystem model solves 1-D quasi-steady conservation laws of the quasi-steady form, shown in Eq. 1, for the gas stream and heat exchange liquid to predict performance parameters such as breakthrough capacity and optimum cycle time. The source term S is used to capture interactions between the fluid flows and the sorbent. A quasi-steady-state scheme is used where no time derivatives appear in the governing equations, except for those in the source terms. This results in an autonomous system, where ∂F/∂x = ƒ(F). The fluxes F are provided at the inlet, and an explicit method is used to solve for the spatial distribution of F. The heat and mass flows to the sorbent are then extracted from the source terms. These flows are numerically integrated to produce a 1-D solution for the system’s state as a function of both time and space. The body of the adsorption pump is separated into two semi-independent models: the heat exchanger fluid flow and gas flow through the zeolite coated surfaces. Both models are solved using the above-described method to find a 1-D solution as a function of space and interact only once a timestep is taken. The interaction point is the sorbent through which all heat transfer between the two models must occur. Sorbent mass adsorption is calculated using the Lagergren model, shown in Eq. 2, where the transfer coefficient, λ D , is found by solving a system of nondimensionalized equations derived by using the heat and mass transfer analogy for transport phenomena. Using Grade 544 Type 13X zeolite as the sorbent material, the equilibrium concentration, θ eq , is calculated using the k-site Langmuir isotherm and fit parameters. Additionally, the enthalpy of adsorption used in the model is computed by interpolation of available data [1]. The subsystem model was validated using the Rapid Cycle Temperature Swing Adsorption (RC-TSA) pump. The solar thermal energy subsystem focuses on a solar concentrator concept with a heat exchanger to heat the reactants before entering the carbon formation reactor. The subsystem model assumes a fixed solar flux and reflector efficiency to calculate the reactant temperature given the incoming temperature, pressure, and exchanger geometry. The receiver is a custom manufactured series of copper blocks with serpentine channels to increase its surface area and the residence time of the reactants to heat up to 550 °C. The subsystem model was validated using a heat exchanger developed at NASA Glenn Research Center (GRC). The solar thermal energy subsystem focuses on a solar concentrator concept with a heat exchanger to heat the reactants before entering the carbon formation reactor. The subsystem model assumes a fixed solar flux and reflector efficiency to calculate the reactant temperature given the incoming temperature, pressure, and exchanger geometry. The receiver is a custom manufactured series of copper blocks with serpentine channels to increase its surface area and the residence time of the reactants to heat up to 550 °C. The subsystem model was validated using a heat exchanger developed at NASA Glenn Research Center (GRC).

In situ Resource Utilization↗

Coupling lattice Boltzmann and continuum equations for flow and reactive transport in porous media.

In spatially and temporally localized instances, capturing sub-reservoir scale information is necessary. Capturing sub-reservoir scale information everywhere is neither necessary, nor computationally possible. The lattice Boltzmann Method for solving pore-scale systems. At the pore-scale, LBM provides an extremely scalable, efficient way of solving Navier-Stokes equations on complex geometries. Coupling pore-scale and continuum scale systems via domain decomposition. By leveraging the interpolations implied by pore-scale and continuum scale discretizations, overlapping Schwartz domain decomposition is used to ensure continuity of pressure and flux. This approach is demonstrated on a fractured medium, in which Navier-Stokes equations are solved within the fracture while Darcy's equation is solved away from the fracture Coupling reactive transport to pore-scale flow simulators allows hybrid approaches to be extended to solve multi-scale reactive transport.

97 MATHEMATICS AND COMPUTING↗

Three Dimensional Simulations of Multiphase Flows Using a Lattice Boltzmann Method Suitable for High Density Ratios - 12126

Multiphase flows involving gas and liquid phases can be observed in engineering operations at various Department of Energy sites, such as mixing of slurries using pulsed-air mixers and hydrogen gas generation in liquid waste tanks etc. The dynamics of the gas phase in the liquid domain play an important role in the mixing effectiveness of the pulsed-air mixers or in the level of gas pressure build-up in waste tanks. To understand such effects, computational fluid dynamics methods (CFD) can be utilized by developing a three-dimensional computerized multiphase flow model that can predict accurately the behavior of gas motion inside liquid-filled tanks by solving the governing mathematical equations that represent the physics of the phenomena. In this paper, such a CFD method, lattice Boltzmann method (LBM), is presented that can model multiphase flows accurately and efficiently. LBM is favored over traditional Navier-Stokes based computational models since interfacial forces are handled more effectively in LBM. The LBM is easier to program, more efficient to solve on parallel computers, and has the ability to capture the interface between different fluid phases intrinsically. The LBM used in this paper can solve for the incompressible and viscous flow field in three dimensions, while at the same time, solve the Cahn-Hillard equation to track the position of the gas-liquid interface specifically when the density and viscosity ratios between the two fluids are high. This feature is of primary importance since the previous LBM models proposed for multiphase flows become unstable when the density ratio is larger than 10. The ability to provide stable and accurate simulations at large density ratios becomes important when the simulation case involves fluids such as air and water with a density ratio around 1000 that are common to many engineering problems. In order to demonstrate the capability of the 3D LBM method at high density ratios, a static bubble simulation is conducted to solve for the pressure difference between the inside and outside of a gas bubble in a liquid domain. Once the results show that the method is in agreement with the Laplace law, buoyant bubble simulations are conducted. The initial results obtained for bubble shape during the rising process was found to be in agreement with the theoretical expectations. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

FLORA Equilibrium and Stability Code Archive

FLORA solves, in a 2-D domain (radial and axial dimensions) with a specified azimuthal Fourier mode, for the linearized stability of a long, thin, axisymmetric plasma equilibrium in an applied magnetic field. Before the stability equation is solved, FLORA solves a set of simple equations for pressure balance that specify the equilibrium magnetic field and plasma pressure in the long-thin limit given a simplified description of the magnetic coils. It uses an initial-value method for the linear stability problem in which an equilibrium is given an initial perturbation to its magnetic field, and the temporal behavior of the perturbation is followed. The perturbation has been Fourier expanded in the azimuthal coordinate; each azimuthal mode must be examined separately. The complex partial differential equation of motion for the perturbed radial displacement of the field lines is solved as a coupled system of two real p.d.e.'s and the solution consists of two parts, the real part and the imaginary part. The system is solved by bringing the coupling terms in each equation to the right side and using an iterative technique.

Cohen, Bruce [Lawrence Livermore National Laborato↗

A Hybrid Monte Carlo-Deterministic Method for Global Binary Stochastic Medium Transport Problems

Global deep-penetration transport problems are difficult to solve using traditional Monte Carlo techniques. In these problems, the scalar flux distribution is desired at all points in the spatial domain (global nature), and the scalar flux typically drops by several orders of magnitude across the problem (deep-penetration nature). As a result, few particle histories may reach certain regions of the domain, producing a relatively large variance in tallies in those regions. Implicit capture (also known as survival biasing or absorption suppression) can be used to increase the efficiency of the Monte Carlo transport algorithm to some degree. A hybrid Monte Carlo-deterministic technique has previously been developed by Cooper and Larsen to reduce variance in global problems by distributing particles more evenly throughout the spatial domain. This hybrid method uses an approximate deterministic estimate of the forward scalar flux distribution to automatically generate weight windows for the Monte Carlo transport simulation, avoiding the necessity for the code user to specify the weight window parameters. In a binary stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media is to use the atomic mix (AM) approximation in which the transport problem is solved using ensemble-averaged material properties. The most ubiquitous deterministic model developed specifically for solving binary stochastic media transport problems is the Levermore-Pomraning (L-P) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the Levermore-Pomraning equations and another Monte Carlo algorithm (Algorithm B) that is more accurate as a result of improved local material realization modeling. Recent benchmark studies have shown that Algorithm B is often significantly more accurate than Algorithm A (and therefore the L-P model) for deep penetration problems such as examined in this paper. In this research, we investigate the application of a variant of the hybrid Monte Carlo-deterministic method proposed by Cooper and Larsen to global deep penetration problems involving binary stochastic media. To our knowledge, hybrid Monte Carlo-deterministic methods have not previously been applied to problems involving a stochastic medium. We investigate two approaches for computing the approximate deterministic estimate of the forward scalar flux distribution used to automatically generate the weight windows. The first approach uses the atomic mix approximation to the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. The second approach uses the Levermore-Pomraning model for the binary stochastic medium transport problem and a low-order discrete ordinates angular approximation. In both cases, we use Monte Carlo Algorithm B with weight windows automatically generated from the approximate forward scalar flux distribution to obtain the solution of the transport problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗

Deterministic direct aperture optimization using multiphase piecewise constant segmentation

Purpose Direct aperture optimization (DAO) attempts to incorporate machine constraints in the inverse optimization to eliminate the post‐processing steps in fluence map optimization (FMO) that degrade plan quality. Current commercial DAO methods utilize a stochastic or greedy approach to search a small aperture solution space. In this study, we propose a novel deterministic direct aperture optimization that integrates the segmentation of fluence map in the optimization problem using the multiphase piecewise constant Mumford‐Shah formulation. Methods The Mumford‐Shah based direct aperture optimization problem was formulated to include an L2‐norm dose fidelity term to penalize differences between the projected dose and the prescribed dose, an anisotropic total variation term to promote piecewise continuity in the fluence maps, and the multiphase piecewise constant Mumford‐Shah function to partition the fluence into pairwise discrete segments. A proximal‐class, first‐order primal‐dual solver was implemented to solve the large scale optimization problem, and an alternating module strategy was implemented to update fluence and delivery segments. Three patients of varying complexity—one glioblastoma multiforme (GBM) patient, one lung (LNG) patient, and one bilateral head and neck (H&N) patient with 3 PTVs—were selected to test the new DAO method. For each patient, 20 non‐coplanar beams were first selected using column generation, followed by the Mumford‐Shah based DAO (DAO MS ). For comparison, a popular and successful approach to DAO known as simulated annealing—a stochastic approach—was replicated. The simulated annealing DAO (DAO SA ) plans were then created using the same beam angles and maximum number of segments per beam. PTV coverage, PTV homogeneity , and OAR sparing were assessed for each plan. In addition, high dose spillage, defined as the 50% isodose volume divided by the tumor volume, as well as conformity, defined as the van't Riet conformation number, were evaluated. Results DAO MS achieved essentially the same OAR doses compared with the DAO SA plans for the GBM case. The average difference of OAR D max and D mean between the two plans were within 0.05% of the plan prescription dose. The lung case showed slightly improved critical structure sparing using the DAO MS approach, where the average OAR D max and D mean were reduced by 3.67% and 1.08%, respectively, of the prescription dose. The DAO MS plan substantially improved OAR dose sparing for the H&N patient, where the average OAR D max and D mean were reduced by over 10% of the prescription dose. The DAO MS and DAO SA plans were comparable for the GBM and LNG PTV coverage, while the DAO MS plan substantially improved the H&N PTV coverage, increasing D99 by 6.98% of the prescription dose. For the GBM and LNG patients, the DAO MS and DAO SA plans had comparable high dose spillage but slightly worse conformity with the DAO MS approach. For the H&N plan, DAO MS was considerably superior in high dose spillage and conformity to the DAO SA . The deterministic approach is able to solve the DAO problem substantially faster than the simulated annealing approach, with a 9.5‐ to 40‐fold decrease in total solve time, depending on the patient case. Conclusions A novel deterministic direct aperture optimization formulation was developed and evaluated. It combines fluence map optimization and the multiphase piecewise constant Mumford‐Shah segmentation into a unified framework, and the resulting optimization problem can be solved efficiently. Compared to the widely and commercially used simulated annealing DAO approach, it showed comparable dosimetry behavior for simple plans, and substantially improved OAR sparing, PTV coverage, PTV homogeneity, high dose spillage, and conformity for the more complex head and neck plan.

Nguyen, Dan↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Massively parallel solvers for elliptic partial differential equations in numerical weather and climate prediction

The demand for substantial increases in the spatial resolution of global weather and climate prediction models makes it essential to use numerically efficient and highly scalable algorithms to solve the equations of large-scale atmospheric fluid dynamics. For stability and efficiency reasons, several of the operational forecasting centres, in particular the Met Office and the European Centre for Medium-Range Weather Forecasts (ECMWF) in the UK, use semi-implicit semi-Lagrangian time-stepping in the dynamical core of the model. The additional burden with this method is that a three-dimensional elliptic partial differential equation (PDE) for the pressure correction has to be solved at every model time step and this often constitutes a significant proportion of the time spent in the dynamical core. In global models, this PDE must be solved in a thin spherical shell. To run within tight operational time-scales, the solver has to be parallelized and there seems to be a (perceived) misconception that elliptic solvers do not scale to large processor counts and hence implicit time-stepping cannot be used in very high-resolution global models. After reviewing several methods for solving the elliptic PDE for the pressure correction and their application in atmospheric models, we demonstrate the performance and very good scalability of Krylov subspace solvers and multigrid algorithms for a representative model equation with more than 1010 unknowns on 65 536 cores on the High-End Computing Terascale Resource (HECToR), the UK's national supercomputer. Here, we tested and optimized solvers from two existing numerical libraries (the Distributed and Unified Numerics Environment (DUNE) and Parallel High Performance Preconditioners (hypre)) and implemented both a conjugate gradient solver and a geometric multigrid algorithm based on a tensor-product approach, which exploits the strong vertical anisotropy of the discretized equation. We study both weak and strong scalability and compare the absolute solution times for all methods; in contrast to one-level methods, the multigrid solver is robust with respect to parameter variations.

58 GEOSCIENCES↗

Quantum Annealing with Inequality Constraints: The Set Cover Problem

Abstract Quantum annealing is a promising method for solving hard optimization problems by transforming them into quadratic unconstrained binary optimization (QUBO) problems. However, when constraints are involved, particularly multiple inequality constraints, incorporating them into the objective function poses challenges. In this paper, the authors present two novel approaches for solving problems with multiple inequality constraints on a quantum annealer and apply them to the set cover problem (SCP). The first approach uses the augmented Lagrangian method to represent the constraints, while the second approach employs a higher‐order binary optimization (HUBO) formulation. The experiments show that both approaches outperform the standard approach for solving the SCP on the D‐Wave Advantage quantum annealer. The HUBO formulation performs slightly better than the augmented Lagrangian method in solving the SCP, but its scalability in terms of embeddability in the quantum chip is worse. The results demonstrate that the proposed augmented Lagrangian and HUBO methods can successfully implement a large number of inequality constraints, making them applicable to a broad range of constrained problems beyond the SCP.

Djidjev, Hristo N.↗

The quality/cosmology tension for a post-inflation QCD axion

Abstract It is difficult to construct a post-inflation QCD axion model that solves the axion quality problem (and hence the Strong CP problem) without introducing a cosmological disaster. In a post-inflation axion model, the axion field value is randomized during the Peccei-Quinn phase transition, and axion domain walls form at the QCD phase transition. We emphasize that the gauge equivalence of all minima of the axion potential (i.e., domain wall number equals one) is insufficient to solve the cosmological domain wall problem. The axion string on which a domain wall ends must exist as an individual object (as opposed to a multi-string state), and it must be produced in the early universe. These conditions are often not satisfied in concrete models. Post-inflation axion models also face a potential problem from fractionally charged relics; solving this problem often leads to low-energy Landau poles for Standard Model gauge couplings, reintroducing the quality problem. We study several examples, finding that models that solve the quality problem face cosmological problems, and vice versa. This is not a no-go theorem; nonetheless, we argue that it is much more difficult than generally appreciated to find a viable post-inflation QCD axion model. Successful examples may have a nonstandard cosmological history (e.g., multiple types of cosmic axion strings of different tensions), undermining the widespread expectation that the post-inflation QCD axion scenario predicts a unique mass for axion dark matter.

Physics↗

A primal–dual algorithm for risk minimization

In this paper, we develop an algorithm to efficiently solve risk-averse optimization problems posed in reflexive Banach space. Such problems often arise in many practical applications as, e.g., optimization problems constrained by partial differential equations with uncertain inputs. Unfortunately, for many popular risk models including the coherent risk measures, the resulting risk-averse objective function is nonsmooth. Here, this lack of differentiability complicates the numerical approximation of the objective function as well as the numerical solution of the optimization problem. To address these challenges, we propose a primal–dual algorithm for solving large-scale nonsmooth risk-averse optimization problems. This algorithm is motivated by the classical method of multipliers and by epigraphical regularization of risk measures. As a result, the algorithm solves a sequence of smooth optimization problems using derivative-based methods. We prove convergence of the algorithm even when the subproblems are solved inexactly and conclude with numerical examples demonstrating the efficiency of our method.

97 MATHEMATICS AND COMPUTING↗

Nonequilibrium Dynamical Mean-Field Theory for the Charge-Density-Wave Phase of the Falicov-Kimball Model

Nonequilibrium dynamical mean-field theory (DMFT) is developed for the case of the charge-density-wave ordered phase. We consider the spinless Falicov-Kimball model which can be solved exactly. This strongly correlated system is then placed in an uniform external dc electric field. We present a complete derivation for nonequilibrium dynamical mean-field theory Green’s functions defined on the Keldysh-Schwinger time contour. Here, we also discuss numerical issues involved in solving the coupled equations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment

This paper discusses a consensus-based alternating direction method of multipliers (ADMM) approach to solve the multi-area coordinated network-constrained unit commitment (NCUC) problem in a distributed manner. Due to political and technical difficulties, it is neither practical nor feasible to solve the multi-area coordination problem in a centralized fashion, which requires full access to all data of individual areas. In comparison, in the proposed fully-distributed approach, local NCUC problems of individual areas can be solved independently, and only limited information is exchanged among adjacent areas for facilitating multi-area coordination. Furthermore, as traditional ADMM can only guarantee convergence for convex problems, this paper discusses several strategies to mitigate oscillations, enhance convergence performance, and derive good-enough feasible solutions, including: (i) A tie-line power flow based area coordination strategy is designed to reduce the number of global consensus variables; (ii) Different penalty parameters \r{ho} are assigned to individual consensus variables and are updated via certain rules during the iterative procedure, which would reduce the impact of initial values of \r{ho} on convergence performance; (iii) Heuristic rules are adopted to fix certain unit commitment variables for avoiding oscillations during the iterative procedure; and (iv) An asynchronous distributed strategy is studied, which solves NCUC subproblems of small areas multiple times and exchanges information with adjacent areas more frequently within one complete run of slower NCUC subproblems of large areas. Numerical cases illustrate effectiveness of the proposed asynchronous fully-distributed NCUC approach, and investigate key factors that would affect its convergence performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Efficiently embedding QUBO problems on adiabatic quantum computers

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

97 MATHEMATICS AND COMPUTING↗

Spin transition characteristics of molecular solvates of Cu{sup II} complexes with nitroxides: sensitivity to the packing type

A method for the synthesis of solvates of dinuclear heterospin complexes of bis(hexafluoroacetylacetonato)copper(II) with 2-(4-methylpyridin-3-yl)-4,4,5,5-tetramethyl-4,5-dihydro-1H-imidazole-3-oxide-1-oxyl (L{sup Me}) and 2-(4-ethylpyridin-3-yl)-4,4,5,5-tetramethyl-4,5-dihydro-1H-imidazole-3-oxide-1-oxyl (L{sup Et}) of the composition [Cu(hfac){sub 2}L{sup R}]{sub 2} · Solv (Solv = benzene, bromobenzene, toluene, o-xylene, p-xylene) was developed. It was found that a decrease in temperature induces structural transformations of the solid phases of the complexes followed by significant changes in the distances between the paramagnetic centers in the intramolecular exchange clusters {Cu"2"+-O"·-} from 2.321 to 1.974 Å. As a result, the temperature dependences of the effective magnetic moment μ{sub eff}(T) exhibit magnetic features similar to spin transitions. An analysis of the shape of the μ{sub eff}(T) curves suggested that the magnetic properties of the compounds under study depend primarily on the molecular packing. A comparison of the magneto-structural correlations typical of the [Cu(hfac){sub 2}L{sup R}]{sub 2} · Solv complexes studied in this work with the data obtained earlier for analogous solvates of heterospin polymer chain complexes showed that the spin transition characteristics of the [Cu(hfac){sub 2}L{sup R}]{sub 2} · Solv systems are much less sensitive to the change of the solvent than the corresponding characteristics of the heterospin polymers containing solvate molecules in the interchain space. The magnetic characteristics of the heterospin dimer molecules depend primarily on which cavity between the dimers is filled with solvate molecules. For solvates with monoclinic symmetry, changes in the solvent molecules occupying same-type cavities have almost no effect on the spin transition characteristics in the heterospin exchange cluster.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗