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 919 records · Page 51

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↗

Time-parallel solutions to differential equations via functional optimization

We describe an approach to solving a generic time-dependent differential equation (DE) that recasts the problem as a functional optimization one. The techniques employed to solve for the functional minimum, which we relate to the Sobolev Gradient method, allow for large-scale parallelization in time, and therefore potential faster “wall-clock” time computing on machines with significant parallel computing capacity. We are able to come up with numerous different discretizations and approximations for our optimization-derived equations, each of which either puts an existing approach, the Parareal method, in an optimization context, or provides a new time-parallel (TP) scheme with potentially faster convergence to the DE solution. We describe how the approach is particularly effective for solving multiscale DEs and present TP schemes that incorporate two different solution scales. Sample results are provided for three differential equations, solved with TP schemes, and we discuss how the choice of TP scheme can have an orders of magnitude effect on the accuracy or convergence rate.

97 MATHEMATICS AND COMPUTING↗

A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPs

This paper considers the linear weighted complementarity problem (denoted by LWCP) introduced by Potra (SIAM J Optim 22:1634–1654, 2012). Based on two weighted smoothing functions, we propose a new nonmonotone smoothing algorithm for solving the LWCP and establish its global and local quadratic convergence without the strict complementarity assumption. Compared to existing nonmonotone smoothing algorithms, the proposed algorithm solves the linear system only approximately which can save the computation work when one solves large-scale LWCPs. Moreover, the nonmonotone line search technique adopted in this paper includes the usual monotone line search and some existing nonmonotone line searches as special cases. Numerical results show that our algorithm is considerably efficient for solving large-scale LWCPs.

97 MATHEMATICS AND COMPUTING↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

Rapid, wide-scale deployment of green process systems, such as carbon capture or water desalination systems, is essential for combatting climate change. Methods relying on traditional design or modularity fail to capture the benefits of both economies of numbers and economies of scale. We have proposed process family design, which designs a family of processes simultaneously exploiting opportunities for common elements. In previous work, we explored different optimization formulations to solve this problem. In this work, we develop a decomposition approach to tackle larger problems efficiently. We solve a water desalination case study, which is too large to solve within a reasonable timeframe with the discretization formulation. We exploit the block angular structure of the discretization problem to decompose and solve using Progressive Hedging (PH). We use the open-source Python package mpi-sppy to execute PH which allows us to leverage parallelization and a HPC cluster to further improve solution time.

Stinchfield, Georgia↗

DRACS thermal performance evaluation for FHR

Direct Reactor Auxiliary Cooling System (DRACS) is a passive decay heat removal system proposed for the Fluoride-salt-cooled High-temperature Reactor (FHR) that combines coated particle fuel and a graphite moderator with a liquid fluoride salt as the coolant. The DRACS features three coupled natural circulation/convection loops, relying completely on buoyancy as the driving force. These loops are coupled through two heat exchangers, namely, the DRACS Heat Exchanger and the Natural Draft Heat Exchanger. In addition, a fluidic diode is employed to minimize the parasitic flow into the DRACS primary loop and correspondingly the heat loss to the DRACS during normal operation of the reactor, and to keep the DRACS ready for activation, if needed, during accidents. To help with the design and thermal performance evaluation of the DRACS, a computer code using MATLAB has been developed. This code is based on a one-dimensional formulation and its principle is to solve the energy balance and integral momentum equations. By discretizing the DRACS system in the axial direction, a bulk mean temperature is assumed for each mesh cell. The temperatures of all the cells, as well as the mass flow rates in the DRACS loops, are predicted by solving the governing equations that are obtained by integrating the energy conservation equation over each cell and integrating the momentum conservation equation over each of the DRACS loops. In addition, an intermediate heat transfer loop equipped with a pump has also been modeled in the code. This enables the study of flow reversal phenomenon in the DRACS primary loop, associated with the pump trip process. Experimental data from a High-Temperature DRACS Test Facility (HTDF) are not available yet to benchmark the code. A preliminary code validation is performed by using natural circulation experimental data available in the literature, which are as closely relevant as possible. The code is subsequently applied to the HTDF that is under construction at the Ohio State University.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Optimal guidance law in quantum mechanics

Following de Broglie’s idea of a pilot wave, this paper treats quantum mechanics as a problem of stochastic optimal guidance law design. The guidance scenario considered in the quantum world is that an electron is the flight vehicle to be guided and its accompanying pilot wave is the guidance law to be designed so as to guide the electron to a random target driven by the Wiener process, while minimizing a cost-to-go function. After solving the stochastic optimal guidance problem by differential dynamic programming, we point out that the optimal pilot wave guiding the particle’s motion is just the wavefunction Ψ(t,x), a solution to the Schrödinger equation; meanwhile, the closed-loop guidance system forms a complex state–space dynamics for Ψ(t,x), from which quantum operators emerge naturally. Quantum trajectories under the action of the optimal guidance law are solved and their statistical distribution is shown to coincide with the prediction of the probability density function Ψ{sup ∗}Ψ. -- Highlights: •Treating quantum mechanics as a pursuit-evasion game. •Reveal an interesting analogy between guided flight motion and guided quantum motion. •Solve optimal quantum guidance problem by dynamic programming. •Gives a formal proof of de Broglie–Bohm’s idea of a pilot wave. •The optimal pilot wave is shown to be a wavefunction solved from Schrödinger equation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalar field in Reissner–Nordström spacetime: Bound state and scattering state (with appendix on eliminating oscillation in partial sum approximation of periodic function)

Highlights: • Bound-state and scattering-state solutions of massive scalar fields in R-N spacetime. • Bound-state wave functions and eigenvalues of massive scalar fields in R-N spacetime. • Solving explicit expressions of scattering phase shifts by integral equation methods. • Introducing tortoise coordinates for R-N spacetime. • Eliminating oscillations in the partial sum approximation of periodic functions. In this paper, we solve the massive scalar field in the Reissner–Nordström spacetime. The scalar field in the Reissner–Nordström spacetime has both bound states and scattering states. For bound states, we solve the bound-state wave function and the eigenvalue spectrum. For scattering states, we solve the scattering wave function and give an explicit expression for scattering phase shift by the integral equation method. Especially, we introduce the tortoise coordinate for the Reissner–Nordström spacetime. Moreover, in the calculation of scattering cross sections, we encounter a difficulty in partial sum approximation. If the sum of partial waves cannot be performed exactly, one has to turn to the partial sum approximation which approximates a function by the first several terms of the series. However, in the partial sum approximation there exists an incorrect oscillation which cannot be eliminated by keeping more terms. In the appendix we suggest an approach for eliminating such oscillations in the partial sum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhanced Data Efficiency Using Deep Neural Networks and Gaussian Processes for Aerodynamic Design Optimization

Adjoint-based optimization methods are attractive for aerodynamic shape design primarily due to their computational costs being independent of the dimensionality of the input space and their ability to generate high-fidelity gradients that can then be used in a gradient-based optimizer. This makes them very well suited for high-fidelity simulation based aerodynamic shape optimization of highly parametrized geometries such as aircraft wings. However, the development of adjoint-based solvers involve careful mathematical treatment and their implementation require detailed software development. Furthermore, they can become prohibitively expensive when multiple optimization problems are being solved, each requiring multiple restarts to circumvent local optima. In this work, we propose a machine learning enabled, surrogate-based framework that replaces the expensive adjoint solver, without compromising on predicting predictive accuracy. Specifically, we first train a deep neural network (DNN) from training data generated from evaluating the high-fidelity simulation model on a model-agnostic design of experiments on the geometry shape parameters. The optimum shape may then be computed by using a gradient-based optimizer coupled with the trained DNN. Subsequently, we also perform a gradient-free Bayesian optimization, where the trained DNN is used as the prior mean. We observe that the latter framework (DNN-BO) improves upon the DNN-only based optimization strategy for the same computational cost. Overall, this framework predicts the true optimum with very high accuracy, while requiring far fewer high-fidelity function calls compared to the adjoint-based method. Furthermore, we show that multiple optimization problems can be solved with the same machine learning model with high accuracy, to amortize the offline costs associated with constructing our models. Our methodology finds applications in the early stages of aerospace design. (C) 2021 Published by Elsevier Masson SAS.

Renganathan, S. Ashwin↗

Formulation and numerical analysis of a fully-coupled dynamically deforming electromagnetic wire

Here, an electromagnetic beam model is developed for the simulation of actuated electronic textiles. The beam is solved using a nonlinear director-based kinematic description with additional temperature and electric potential fields along its length. The three fields are fully coupled by mutual dependences on the deformation, Lorenz force, back electromotive force, temperature dependent constitutive responses, and the Seebeck effect. Instead of solving Maxwell's equations in full detail, a quasistatic approximation is used to solve the electric potential in the presence of a moving material medium. The current-carrying beam approximation is used to further simplify the solution space for the potential. While this formulation alleviates the spatial and temporal discretization restrictions, the coupled problem is an index-1 semi-explicit Differential Algebraic Equation requiring special treatment. The time dependent problem is solved using different Runge-Kutta methods. Diagonally implicit Runge-Kutta methods and explicit Runge-Kutta methods using implicit solution of the electric potential problem are explored. The finite element model is implemented using the open source package FEniCS, which is able to automatically generate the linearizations of the multiphysics equations required for the implicit solutions. A model problem is constructed with which to test and analyze the physical formulation and numerical solution techniques. The time stepping methods are verified using the convergence orders of the higher-order Runge-Kutta methods. Runtime comparisons show that the explicit methods are generally more computationally efficient than the implicit schemes used for this problem. For the implicit schemes, a staggered solution is significantly faster than a monolithic solution at most time step sizes. However, at very large time steps, such as those that would be used for dynamic relaxation, the monolithic solution can be more efficient than the staggered solution.

36 MATERIALS SCIENCE↗

A multiscale flux basis for mortar mixed discretizations of Stokes–Darcy flows

A multiscale flux basis algorithm is developed for the Stokes–Darcy flow problem. The method is based on a non-overlapping domain decomposition algorithm, where the global problem is reduced to a coarse scale mortar interface problem that is solved by an iterative solver. Subdomain solves are required at each interface iteration, so the cost for the method without a multiscale basis can be high when the number of subdomains or the condition number of the interface problem is large. Here the proposed algorithm involves precomputing a multiscale flux basis, which consists of the flux (or velocity trace) response from each mortar degree of freedom. It is computed by each subdomain independently before the interface iteration begins. The subdomain solves required at each iteration are substituted by a linear combination of the multiscale basis. This may lead to a significant reduction in computational cost since the number of subdomain solves is fixed, depending only on the number of mortar degrees of freedom associated with a subdomain. Several numerical examples are carried out to demonstrate the efficiency of the multiscale flux basis implementation for large-scale Stokes–Darcy problems.

97 MATHEMATICS AND COMPUTING↗