Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete optimization”

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 721 records · Page 40

Parallel time integration software

This package implements an optimal-scaling multigrid solver for the (non) linear systems that arise from the discretization of problems with evolutionary behavior. Typically, solution algorithms for evolution equations are based on a time-marching approach, solving sequentially for one time step after the other. Parallelism in these traditional time-integrarion techniques is limited to spatial parallelism. However, current trends in computer architectures are leading twards system with more, but not faster. processors. Therefore, faster compute speeds must come from greater parallelism. One approach to achieve parallelism in time is with multigrid, but extending classical multigrid methods for elliptic poerators to this setting is a significant achievement. In this software, we implement a non-intrusive, optimal-scaling time-parallel method based on multigrid reduction techniques. The examples in the package demonstrate optimality of our multigrid-reduction-in-time algorithm (MGRIT) for solving a variety of parabolic equations in two and three sparial dimensions. These examples can also be used to show that MGRIT can achieve significant speedup in comparison to sequential time marching on modern architectures.

Source record↗

Discretized versus continuous models of p-wave interacting fermions in one dimension

We present a general mapping between continuous and lattice models of Bose and Fermi gases in one dimension, interacting via local two-body interactions. For s-wave interacting bosons we arrive at the Bose-Hubbard model in the weakly interacting, low-density regime. The dual problem of p-wave interacting fermions is mapped to the spin-1/2 XXZ model close to the critical point in the highly polarized regime. The mappings are shown to be optimal in the sense that they produce the least error possible for a given discretization length. As an application we examine the ground state of an interacting Fermi gas in a harmonic trap, calculating numerically real-space and momentum-space distributions as well as two-particle correlations. In the analytically known limits the convergence of the results of the lattice model with the continuous one is shown.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Large Scale Shape Optimization for Accelerator Cavities

We present a shape optimization method for designing accelerator cavities with large scale computations. The objective is to find the best accelerator cavity shape with the desired spectral response, such as with the specified frequencies of resonant modes, field profiles, and external Q values. The forward problem is the large scale Maxwell equation in the frequency domain. The design parameters are the CAD parameters defining the cavity shape. We develop scalable algorithms with a discrete adjoint approach and use the quasi-Newton method to solve the nonlinear optimization problem. Two realistic accelerator cavity design examples are presented.

43 PARTICLE ACCELERATORS↗

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance x,ary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are (1) determining, what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major U.S. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimility with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider un-modelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗

Decision-Aiding and Optimization for Vertical Navigation of Long-Haul Aircraft

Most decisions made in the cockpit are related to safety, and have therefore been proceduralized in order to reduce risk. There are very few which are made on the basis of a value metric such as economic cost. One which can be shown to be value based, however, is the selection of a flight profile. Fuel consumption and flight time both have a substantial effect on aircraft operating cost, but they cannot be minimized simultaneously. In addition, winds, turbulence, and performance vary widely with altitude and time. These factors make it important and difficult for pilots to (a) evaluate the outcomes associated with a particular trajectory before it is flown and (b) decide among possible trajectories. The two elements of this problem considered here are: (1) determining what constitutes optimality, and (2) finding optimal trajectories. Pilots and dispatchers from major u.s. airlines were surveyed to determine which attributes of the outcome of a flight they considered the most important. Avoiding turbulence-for passenger comfort-topped the list of items which were not safety related. Pilots' decision making about the selection of flight profile on the basis of flight time, fuel burn, and exposure to turbulence was then observed. Of the several behavioral and prescriptive decision models invoked to explain the pilots' choices, utility maximization is shown to best reproduce the pilots' decisions. After considering more traditional methods for optimizing trajectories, a novel method is developed using a genetic algorithm (GA) operating on a discrete representation of the trajectory search space. The representation is a sequence of command altitudes, and was chosen to be compatible with the constraints imposed by Air Traffic Control, and with the training given to pilots. Since trajectory evaluation for the GA is performed holistically, a wide class of objective functions can be optimized easily. Also, using the GA it is possible to compare the costs associated with different airspace design and air traffic management policies. A decision aid is proposed which would combine the pilot's notion of optimality with the GA-based optimization, provide the pilot with a number of alternative pareto-optimal trajectories, and allow him to consider unmodelled attributes and constraints in choosing among them. A solution to the problem of displaying alternatives in a multi-attribute decision space is also presented.

Patrick, Nicholas J. M.↗

Optimization of wind plant layouts using an adjoint approach

Abstract. Using adjoint optimization and three-dimensional steady-state Reynolds-averaged Navier–Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flow physics within a wind plant. The steady-state RANS flow model is implemented in the Python finite-element package FEniCS and the derivation and solution of the discrete adjoint equations are automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated for idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 wind speed bins.

17 WIND ENERGY↗

Simulation-driven optimization of high-order meshes in ALE hydrodynamics

Here we propose tools for high-order mesh optimization and demonstrate their benefits in the context of multi-material Arbitrary Lagrangian-Eulerian (ALE) compressible shock hydrodynamic applications. The mesh optimization process is driven by information provided by the simulation which uses the optimized mesh, such as shock positions, material regions, known error estimates, etc. These simulation features are usually represented discretely, for instance, as finite element functions on the Lagrangian mesh. The discrete nature of the input is critical for the practical applicability of the algorithms we propose and distinguishes this work from approaches that strictly require analytical information. Our methods are based on node movement through a high-order extension of the Target-Matrix Optimization Paradigm (TMOP). The proposed formulation is fully algebraic and relies only on local Jacobian matrices, so it is applicable to all types of mesh elements, in 2D and 3D, and any order of the mesh. We discuss the notions of constructing adaptive target matrices and obtaining their derivatives, reconstructing discrete data in intermediate meshes, node limiting that enables improvement of global mesh quality while preserving space-dependent local mesh features, and appropriate normalization of the objective function. The adaptivity methods are combined with automatic ALE triggers that can provide robustness of the mesh evolution and avoid excessive remap procedures. The benefits of the new high-order TMOP technology are illustrated on several simulations performed in the high-order ALE application BLAST.

97 MATHEMATICS AND COMPUTING↗

Decomposition and Algorithmic Approaches for Solving Large-Scale Process Family Design Problems

Our most recent work expands the water desalination case study from 76 variants to 10,897 variants using the equation-oriented model built in Pyomo as part of the PARETO project. Using the discretization formulation presented in Stinchfield (2024a), rather than solving for all 10,897 variants simultaneously, we decompose the formulation into subproblems containing subsets of variants from the process family. We solve the overall problem with Progressive Hedging (PH) deployed in parallel on a distributed HPC cluster using the open-source Python package mpi-sppy (Knueven et al., 2023). This approach allowed us to solve this process family design problem to ~1.5% relative optimality gap in about 5 hours; in comparison, Gurobi reached ~50% relative optimality gap in about 6 hours (Stinchfield et al., 2024b). However, this approach still requires discretization of the common unit module design ranges; additionally, PH acts as a heuristic for MILP’s with gap-closing capabilities. Ideally, we would not have to use ML surrogates or discretization to solve this problem, instead solving the process family design problem with the equation-oriented model directly to achieve the most accurate results. However, recall that we did not consider solving the MINLP directly due to complexity and size. In this work, we aim to decompose and solve this large-scale MINLP using a Structured Nonlinear Global Optimization algorithm presented by Cao and Zavala (2019).

Stinchfield, Georgia↗

Adjoint-Based Mesh Adaptation for the Sonic Boom Signature Loudness

The mesh adaptation functionality of FUN3D is utilized to obtain a mesh optimized to calculate sonic boom ground signature loudness. During this process, the coupling between the discrete-adjoints of the computational fluid dynamics tool FUN3D and the atmospheric propagation tool sBOOM is exploited to form the error estimate. This new mesh adaptation methodology will allow generation of suitable meshes adapted to reduce the estimated errors in the ground loudness, which is an optimization metric employed in supersonic aircraft design. This new output-based adaptation could allow new insights into meshing for sonic boom analysis and design, and complements existing output-based adaptation techniques such as adaptation to reduce estimated errors in off-body pressure functional. This effort could also have implications for other coupled multidisciplinary adjoint capabilities (e.g., aeroelasticity) as well as inclusion of propagation specific parameters such as prevailing winds or non-standard atmospheric conditions. Results are discussed in the context of existing methods and appropriate conclusions are drawn as to the efficacy and efficiency of the developed capability.

Rallabhandi, Sriram K.↗

A Discontinuous Galerkin Discretization of the Eikonal Equation on Curved Piecewise Isoparametric Triangulated Manifolds

This viewgraph presentation provides information on optimizing the travel distance between two points on a curved surface. The presentation addresses the single source shortest path problem, fast algorithms for estimating the eikonal equation, fast schemes and barrier theorems, and the discontinuous Galerkin method, including hyperbolic causality, finite element method, scalars, and marching the discontinuous Galerkin Eikonal approximation.

Barth, TIm↗

A methodology to determine the elastic moduli of crystals by matching experimental and simulated lattice strain pole figures using discrete harmonics

Determining reliable single crystal material parameters for complex polycrystalline materials is a significant challenge for the materials community. In this work, a novel methodology for determining those parameters is outlined and successfully applied to the titanium alloy, Ti-6Al-4V. Utilizing the results from a lattice strain pole figure experiment conducted at the Cornell High Energy Synchrotron Source, an iterative approach is used to optimize the single crystal elastic moduli by comparing experimental and simulated lattice strain pole figures at discrete load steps during a uniaxial tensile test. Due to the large number of unique measurements taken during the experiments, comparisons were made by using the discrete spherical harmonic modes of both the experimental and simulated lattice strain pole figures, allowing the complete pole figures to be used to determine the single crystal elastic moduli. (C) 2016 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Wielewski, Euan↗

An inexact semismooth Newton method with application to adaptive randomized sketching for dynamic optimization

In many applications, one can only access the inexact gradients and inexact hessian times vector products. Thus it is essential to consider algorithms that can handle such inexact quantities with a guaranteed convergence to solution. An inexact adaptive and provably convergent semismooth Newton method is considered to solve constrained optimization problems. In particular, dynamic optimization problems, which are known to be highly expensive, are the focus. A memory efficient semismooth Newton algorithm is introduced for these problems. The source of efficiency and inexactness is the randomized matrix sketching. Further, applications to optimization problems constrained by partial differential equations are also considered.

97 MATHEMATICS AND COMPUTING↗

Large-eddy simulations of Richtmyer Meshkov instability in a converging geometry

The Richtmyer-Meshkov instability (RMI) refers to the baroclinic generation of vorticity at a perturbed density interface when impacted by a shock wave. It is often thought of as the impulsive limit of the Rayleigh-Taylor instability. While the RMI has been widely covered in planar geometries, the present simulations investigate the mixing of materials resulting from the interaction of an imploding cylindrical shock wave with a concentric interface, perturbed in both axial and azimuthal directions, which separates outside air from SF{sub 6} (initially 5 times denser) confined in a 90{sup o} wedge. Two incident shocks of Mach numbers M{sub i} = 1.3 and 2.0 at initial impact are tested. These canonical simulations support recent work on understanding the compressible turbulent mixing in converging geometries relevant to both inertial confinement fusion and core-collapse supernova dynamics. Initial irregularities in the density interface form the misalignment between density and pressure gradients required to initiate a first RMI. A second RMI occurs after the initial shock has converged down the wedge, reflected off the axis and reshocks the distorted interface. Reshock interactions of decreasing intensity follow successively. Due to the converging geometry, the accelerated or decelerated motion of the interface also generates Rayleigh-Taylor instabilities. Secondary Kelvin-Helmholtz instabilities develop along the sides of the interpenetrating fingering structures. The energetic reshock produces a large dynamical range of turbulent scales, requiring the utilization of large-eddy simulation (LES). We employed the stretched-vortex subgrid-scale model of turbulent and scalar transport based on an explicit structural modeling of small-scale dynamics. The imploding nature of the flow is particularly suitable for the use of adaptive mesh refinement (AMR) provided by the parallel block-structured AMR framework AMROC. The Favre-filtered Navier-Stokes equations are solved on each Cartesian uniform subgrid of the mesh hierarchy. A weighted, essentially nonoscillatory scheme is used to capture discontinuities but reverts to a low-numerical dissipation, explicit, tuned center-difference stencil in the smooth or turbulent flow regions, optimal for the functioning of our explicit LES. The computational domain is discretized with 95 x 95 x 64 cubic cells on the base grid (64 points in the periodic axial direction), with three additional levels of refinement based on the local density gradient, reducing the computational expenses compared to the equivalent finest unigrid 760 x 760 x 512 problem. The interpenetration of the two fluids after the reshock is clearly discernible in Fig. 1. The mixing is visualized by using isosurfaces of the heavy-fluid mass fraction {psi}. The mixture is colored red as {psi} = 0.90, yellow as {psi} = 0.5, and green as {psi} = 0.1. To illustrate the multiscale nature of the turbulent mixing, we observe that the initial perturbation wavelength is 100 times larger than the finest grid size, which is itself about 100 times larger than the estimated smallest physical scale in the flow - the Kolmogorov scale - where the viscous dissipation of energy occurs. Incident shocks of higher Mach number (e.g., M{sub i} = 2.0) focus the flow further towards the axis, leading to a stronger turbulent mixing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Real-space quadrature: A convenient, efficient representation for multipole expansions

Multipoles are central to the theory and modeling of polarizable and nonpolarizable molecular electrostatics. This has made a representation in terms of point charges a highly sought after goal, since rotation of multipoles is a bottleneck in molecular dynamics implementations. All known point charge representations are orders of magnitude less efficient than spherical harmonics due to either using too many fixed charge locations or due to nonlinear fitting of fewer charge locations. We present the first complete solution to this problem—completely replacing spherical harmonic basis functions by a dramatically simpler set of weights associated to fixed, discrete points on a sphere. This representation is shown to be space optimal. It reduces the spherical harmonic decomposition of Poisson’s operator to pairwise summations over the point set. As a corollary, we also shows exact quadrature-based formulas for contraction over trace-free supersymmetric 3D tensors. Moreover, multiplication of spherical harmonic basis functions translates to a direct product in this representation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Single-ancilla ground state preparation via Lindbladians

We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this Lindbladian is algorithmic and should not be seen as a specific approximation to some weakly coupled system-bath dynamics in nature. Our algorithm can be implemented using just one ancilla qubit and efficiently simulated on a quantum computer. It can prepare the ground state even when the initial state has zero overlap with the ground state, bypassing the most significant limitation of methods like quantum phase estimation. As a variant, we also propose a discrete-time algorithm, demonstrating even better efficiency and providing a near-optimal simulation cost depending on the desired evolution time and precision. Numerical simulations using Ising and Hubbard models demonstrate the efficacy and applicability of our method. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

Microgrid Assisted Design for Remote Areas

In this work, we present a three-stage multiobjective mixed-integer linear programming (MILP) for the optimal expansion planning and operation of isolated multienergy microgrids in remote areas. By selecting the optimal distributed generators (DGs) and energy storage systems (ESSs) mix selection, siting, sizing, and scheduling in the remote microgrid, the proposed model is targeted to minimize the annualized total cost of microgrids while enhancing the performance of the system, i.e., minimizing the voltage deviations and line power loss. To represent the electricity and heat flow between generation resources and various electrical, heating, and cooling loads in the isolated microgrid, linearized power flow, and heat flow constraints are employed in the proposed optimization model. The available capacity of DGs and ESSs are modeled as discrete constants instead of continuous variables for practical purpose. Numerical simulation results on a remote microgrid consisting of DGs, ESSs, and various loads validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗