Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,045 records · Page 58

Packing and flow particle simulations

Granular material is present across natural and industrial processes on Earth and other planets. Granular particles show up in space exploration (lunar regolith), avalanches (boulders), food (coffee), construction (concrete powder) and manufacturing (additive manufacturing powder, battery slurries). Important phenomena emerge from large collections of granular particles. The size scales of the particles in granular material, 10 μm diameter or larger, makes particle-based simulations a tractable computational method. This seminar will present the packing and flow of granular matter using particle-based discrete element modeling simulations. Particles modeled with rotational friction only require as few as 2.6 contacts for mechanical stability, as opposed to 6 contacts for frictionless particles. Optimal parameters for in-space manufacturing particulate material are identified. Specifically, the maximum density and contacts occurs for a large-to-small particle volume ratio of 0.265. Stress and contact fabric fluctuations of flowing dry granular matter have power-law scaling with strain rate, and a kink. The pressure-dependent slope change kink could identify the transition between slower, quasistatic and faster, inertial flows.

granular↗

Level-set topology optimization with PDE generated conformal meshes

This paper presents a level-set topology optimization approach that uses conformal meshes for the analysis of the displacement field. The structure’s boundary is represented by the iso-contour of a level-set field discretized on a fixed background design mesh. The conformal mesh is updated for each design iteration via a PDE based mesh morphing process that identifies the set of facets in the background mesh that are homeomorphic to the boundary and relaxes the homeomorphic mesh to conform to the structure’s boundary and ensure high element quality. The conformal mesh allows for a more accurate computation of the response versus density and some level-set based methods which interpolate material properties using the volume fraction. Numerical examples illustrate the proposed approach by optimizing linear-elastic two- and three-dimensional structures, wherein insight into the performance of the mesh morphing process is provided. The examples also highlight the scalability of the approach.

42 ENGINEERING↗

Packing and flow particle simulations

Granular material is present across natural and industrial processes on Earth and other planets. Granular particles show up in space exploration (lunar regolith), avalanches (boulders), food (coffee), construction (concrete powder) and manufacturing (additive manufacturing powder, battery slurries). Important phenomena emerge from large collections of granular particles. The size scales of the particles in granular material, 10 μm diameter or larger, makes particle-based simulations a tractable computational method. This seminar will present the packing and flow of granular matter using particle-based discrete element modeling simulations. Particles modeled with rotational friction only require as few as 2.6 contacts for mechanical stability, as opposed to 6 contacts for frictionless particles. Optimal parameters for in-space manufacturing particulate material are identified. Specifically, the maximum density and contacts occurs for a large-to-small particle volume ratio of 0.265. Stress and contact fabric fluctuations of flowing dry granular matter have power-law scaling with strain rate, and a kink. The pressure-dependent slope change kink could identify the transition between slower, quasistatic and faster, inertial flows.

granular↗

Optimal maintenance center inventories for fault-tolerant repairable systems

A probabilistic approach is taken to determine the optimal repairable parts inventory for a maintenance center, servicing machines which contain several m-out-of-n systems of different parts, with a constraint on the total inventory investment. A model, based on the discrete Markov process, accounts for a typical ultrareliable avionics system, such as one presently being developed by NASA. The dynamic programming algorithm for minimizing the stockout and holding costs is applied to an exemplary maintenance center, and solutions for single-item and multi-item cases are given. The computational burden is noted to be reasonable and a computer program is used to generate optimal solutions.

Lawrence, S. H.↗

Foundations for high-order, conservative cut-cell methods: Stable discretizations on degenerate meshes

Cut-cell methods for unsteady flow problems can greatly simplify the grid generation process and allow for high-fidelity simulations on complex geometries. However, cut-cell methods have been limited to low orders of accuracy. This is driven, largely, by the variety of procedures typically introduced to evaluate derivatives in a stable manner near the highly irregular embedded geometry. Here, a completely new approach, termed TEMO (truncation error matching and optimization), is taken to solve this problem. The approach is based on two simple and intuitive design principles. These principles directly allow for the construction of stable 8th To the best of the authors' knowledge, these are the highest orders ever achieved for a cut-cell discretization by a significant margin. This is done for both explicit and compact finite differences and is accomplished without any geometric transformations or artificial stabilization procedures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coupling laser physics to radiation-hydrodynamics

In order to accurately model implosion hydrodynamics in a radiation-hydrodynamics code, it is essential to include accurate accounting for energy deposition physics. In inertial confinement fusion (ICF), where capsules are driven by lasers or laser-driven x-rays, energy deposition profiles and energy transport have a strong impact on the development and evolution of capsule dynamics and hydrodynamic instabilities. Nevertheless, accurately modeling laser beam propagation in radiation-hydrodynamics codes presents unique challenges associated with disparate resolution requirements, the potential to seed spurious noise in highly unstable systems, and computational expense. We discuss a new method for coupling laser ray-tracing physics to a radiation hydrodynamics code, developed in the process of implementing the Mazinisin laser ray-trace into the xRAGE radiation hydrodynamics code. In contrast to previous approaches, in which laser ray-tracing is performed on the radiation-hydrodynamics mesh, our method involves a mesh generation and evolution strategy that addresses the unique requirements of the laser ray-trace in a separate mesh, enabling performance enhancements and strategies to reduce noise seeded by the discretization of beams into computational rays. In addition, we have employed several methods to ensure that spurious mesh imprinting is minimized. These involved optimizing the laser and radiation-hydrodynamics meshes as well as interpolation between them and requires the use of an exact initialization method for the radiation-hydrodynamics mesh. Furthermore, these techniques have enabled efficient computation of laser-driven implosions and other experiments with minimal introduction of spurious noise.

47 OTHER INSTRUMENTATION↗

Vibrational coherence and energy transfer in two-dimensional spectra with the optimized mean-trajectory approximation

The optimized mean-trajectory (OMT) approximation is a semiclassical method for computing vibrational response functions from action-quantized classical trajectories connected by discrete transitions that represent radiation-matter interactions. Here, we extend the OMT to include additional vibrational coherence and energy transfer processes. This generalized approximation is applied to a pair of anharmonic chromophores coupled to a bath. The resulting 2D spectra are shown to reflect coherence transfer between normal modes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-meson systems in lattice QCD / Many-body QCD

Nuclear physics entails the study of the properties and interactions of hadrons, such as the proton and neutron, and atomic nuclei and it is central to our understanding of our world at the smallest scales. The underlying basis for nuclear physics is provided by the Standard Model of particle physics which describes how matter interacts through the strong, electromagnetic and weak (electroweak) forces. This theory was developed in the 1970s and provides an extremely successful description of our world at the most fundamental level to which it has been probed. The Standard Model has been, and continues to be, subject to stringent tests at particle accelerators around the world, so far passing without blemish. However, at the relatively low energies that are relevant for nuclear physics, calculations involving the strong interaction, governed by the equations of Quantum Chromodynamics (QCD), are enormously challenging, and to date, the only systematic way to perform them is numerically, using a framework known as lattice QCD (LQCD). In this approach, one discretizes space-time and numerically solves the equations of QCD on a space-time lattice; for realistic calculations, this requires highly optimized algorithms and cutting-edge high performance computing (HPC) resources. Progress over the project period is discussed in detail in the following subsections

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Opportunities and Challenges to Capturing Distributed Battery Value via Retail Utility Rates and Programs

Distributed battery deployment is increasing with advanced metering, control, and communication technologies, leaving electric utilities with an under-utilized, flexible grid resource in aggregate. Rates can reflect locational and temporal prices while utility incentive-based programs allow DERs to provide direct grid services. However, utilities must balance accurately reflecting dynamic grid conditions versus simple and feasible design that encourages customer participation. Currently, most rates and incentive-based programs are simple, but as penetration of DER and advanced controls increase, dynamic designs could become prevalent. Utilities could encourage providing multiple services to optimize distributed battery dispatch and value streams, however, challenges persist when stacking services across distribution and bulk systems. A DER committed to multiple discrete services concurrently necessitates coordination between operators and a clear hierarchy of commitments. One way to address this is to separate commitments by time or capacity. For services that follow cyclic, predictable patterns, or those that are peak driven with predictability, an operator could ensure sufficient state of charge for participation, leaving time where a distributed battery could otherwise provide different services by segmenting participation temporally. To provide continuous or unexpected services, a battery operator may use state of charge management to reserve some percentage of the battery and segment participation by capacity. Macroeconomic trends, load patterns, generation profiles, and grid configurations drive variation in value and the subsequent implications for utility offerings and how a customer might participate. As distributed battery adoption increases, both regulators and utilities will need to ensure no adverse grid impacts and encourage provision of societal value beyond the customer domain.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d-dimensional Schrödinger equation with η particles can be simulated with gate complexity O ~ (ηdFpoly(log(g'/ϵ))), where ϵ is the discretization error, g' controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g' from poly(g'/ϵ) to poly(log(g'/ϵ)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η 3 (d + η)Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates, and another using η 3 (4d) d/2 Tpoly(log(ηdTg'/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Human controller modeling in environments that include non-control tasks

In complex environments where the human operator is a supervisor, he must allocate his attention between different kinds of tasks for optimum overall performance. When a portion of the future reference trajectory for the control task is available for preview, scheduling various activities is possible. A model has been developed for this situation using dynamic programming to solve an optimal control problem. An experiment was conducted where subjects controlled an airplane symbol over a map, shown a fixed distance into the future. Discrete, non-control tasks were introduced as number entry tasks. Results from the model are compared with experimental results.

Govindaraj, T.↗

Galerkin/Runge-Kutta discretizations for semilinear parabolic equations

A new class of fully discrete Galerkin/Runge-Kutta methods is constructed and analyzed for semilinear parabolic initial boundary value problems. Unlike any classical counterpart, this class offers arbitrarily high, optimal order convergence. In support of this claim, error estimates are proved, and computational results are presented. Furthermore, it is noted that special Runge-Kutta methods allow computations to be performed in parallel so that the final execution time can be reduced to that of a low order method.

Keeling, Stephen L.↗

Technology development program for the Space Infrared Telescope Facility (SIRTF) science instruments

A coordinated technology program for the Space Infrared Telescope Facility (SIRTF) is described. The program encompasses detector technology, cryogenic mechanisms technology, and an adiabatic demagnetization refrigerator. Discrete detectors, detector arrays, detector readouts, and testing of engineering models under simulated flight environment conditions are considered. Several focal planes will be optimized at a particular wavelength range to make up over 247,000 detector pixels from about 1.8 to 1000 microns.

Ramos, Ruben↗

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗

Discrete observability and numerical quadrature

The authors consider the problem of approximate observability of a one-dimensional diffusion equation on a finite spatial domain with spatial point measurements. The problem of the optimal selection of the measurement points is considered under three conditions: (1) no preassigned measurement nodes; (2) one preassigned node and; (3) two preassigned nodes. The main observation is that the optimal choice is related to three classical procedures in numerical analysis: (1) Gaussian quadrature; (2) Radau quadrature and; (3) Lobatto quadrature. It is shown that the existence of the Radau and Lobatto quadrature is closely related to classical root locus theory.

Martin, Clyde F.↗

LENS: Learning Enabled Network Synthesis

RTRC and UMD have developed novel machine learning based methods under the ARPA-E DIFFERENTIATE program for rapid acceleration of hypothesis generation in complex architecture design spaces involving both discrete choices of component inclusion and interconnection and continuous parametric decisions. The project named Learning Enabled Network Synthesis (LENS) further demonstrated the developed methods on challenging electrical power converter design problems by identifying the most suitable circuit topologies and simultaneously selecting the most appropriate components to achieve optimized design of power converter with improved performances. We demonstrated that LENS could enable exploration of very large design space of circuit topologies and components by addressing the limitations of conventional design process in non-linear, high switching speed, multi-dimensional power converter design and optimization. The key innovation developed in LENS is the seamless integration of statistical learning and logical reasoning techniques and building on the individual strengths of these techniques for rapid hypothesis discovery. The main component of LENS comprises of: 1) Graph Reasoning Engine (GRE) to enforce composition rules that rapidly reject all discrete architectures that are composed incorrectly and generates an adaptive database of feasible designs which can be used by ML modules, 2) Graph Generative Learning module which is a deep neural network based generative model for graph architectures which can enable design space exploration beyond the dataset generated by the GRE, 3) Graph Reduced Order Model (ROM) for graph domains for accelerating computation of output metrics, and 4) Active learning and Rule Discovery module for sample efficient learning and extracting logical rules from the learned ML models which will be integrated in the GRE to enhance the filtering effectiveness. LENS approach can be applied to any design domains where designs can be represented as multi-attribute graphs. The LENS team integrated the various technical innovations listed above into an optimization pipeline and exercised the optimization pipeline on the converter design problem. The LENS project demonstrated that the developed AI/ML technologies can be used to generate novel converter circuits >45x faster than experts on chosen use-cases. This can enable faster design space exploration and identification of new designs which are not considered by experts due to the increasing design space complexity. This has significant potential impact on the public and energy needs of the country. It is currently estimated that 30% of all electrical powers generated passes through power converters. The future estimate is that 80% of all power generated would be passing through converters. LENS fills a critical gap in this space since by accelerating the design process the designers would be able to generate more efficient converters which can lead to significant energy savings for the country.

42 ENGINEERING↗

Shape design sensitivities using fully automatic 3-D mesh generation

Previous work in three dimensional shape optimization involved specifying design variables by associating parameters directly with mesh points. More recent work has shown the use of fully-automatic mesh generation based upon a parameterized geometric representation. Design variables have been associated with a mathematical model of the part rather than the discretized representation. The mesh generation procedure uses a nonuniform grid intersection technique to place nodal points directly on the surface geometry. Although there exists an associativity between the mesh and the geometrical/topological entities, there is no mathematical functional relationship. This poses a problem during certain steps in the optimization process in which geometry modification is required. For the large geometrical changes which occur at the beginning of each optimization step, a completely new mesh is created. However, for gradient calculations many small changes must be made and it would be too costly to regenerate the mesh for each design variable perturbation. For that reason, a local remeshing procedure has been implemented which operates only on the specific edges and faces associated with the design variable being perturbed. Two realistic design problems are presented which show the efficiency of this process and test the accuracy of the gradient computations.

Botkin, M. E.↗

A scalable geometric multigrid solver for nonsymmetric elliptic systems with application to variable-density flows

A geometric multigrid algorithm is introduced for solving nonsymmetric linear systems resulting from the discretization of the variable density Navier–Stokes equations on nonuniform structured rectilinear grids and high-Reynolds number flows. The restriction operation is defined such that the resulting system on the coarser grids is symmetric, thereby allowing for the use of efficient smoother algorithms. To achieve an optimal rate of convergence, the sequence of interpolation and restriction operations are determined through a dynamic procedure. A parallel partitioning strategy is introduced to minimize communication while maintaining the load balance between all processors. To test the proposed algorithm, we consider two cases: 1) homogeneous isotropic turbulence discretized on uniform grids and 2) turbulent duct flow discretized on stretched grids. Testing the algorithm on systems with up to a billion unknowns shows that the cost varies linearly with the number of unknowns. This O (N) behavior confirms the robustness of the proposed multigrid method regarding ill-conditioning of large systems characteristic of multiscale high-Reynolds number turbulent flows. The robustness of our method to density variations is established by considering cases where density varies sharply in space by a factor of up to 104, showing its applicability to two-phase flow problems. Strong and weak scalability studies are carried out, employing up to 30,000 processors, to examine the parallel performance of our implementation. Excellent scalability of our solver is shown for a granularity as low as 104 to 105 unknowns per processor. At its tested peak throughput, it solves approximately 4 billion unknowns per second employing over 16,000 processors with a parallel efficiency higher than 50%.

Computer Science↗