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 1,207 records · Page 67

Success of digital adiabatic simulation with large Trotter step

The simulation of adiabatic evolution has deep connections with adiabatic quantum computation, the quantum approximate optimization algorithm, and adiabatic state preparation. Here we address the error analysis problem in quantum simulation of adiabatic process using Trotter formulas. Here we show that with additional conditions, the circuit depth can be linear in simulation time T. The improvement comes from the observation that the fidelity error here can't be estimated by the norm distance between evolution operators. This phenomenon is termed the robustness of discretization in digital adiabatic simulation. It can be explained in three steps, from analytical and numerical evidence: (1) The fidelity error should be estimated by applying adiabatic theorem on the effective Hamiltonian instead. (2) Because of the specialty of Riemann-Lebesgue lemma, most adiabatic process is naturally robust against discretization. (3) As the Trotter step gets larger, the spectral gap of effective Hamiltonian tends to close, which results in the failure of digital adiabatic simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗

Digital controller design: Continuous and discrete describing function analysis of the IPS system

The digital IPS with wire cable and flex pivot nonlinearity is simulated on the digital computer to determine the effects of varying the sampling period T on the system stability, and to determine a range of optimal values of the parameters of the digital controller. The listing of the computer program is shown as well as the Dahl model for the flex pivot nonlinearity. For the wire cable nonlinearity, two ranges of values were used and the nominal values of the digital controller parameters are included.

Source record↗

PyRAT (Python Radiography Analysis Tool): Overview [Slides]

PyRAT was developed as a quantitative tool for robustly characterizing objects from radiographs to solve problems such as the hybrid nonlinear inverse problem. The optimization software library that was used is the nonsmooth optimization by MADS algorithm (NOMAD). Some of PyRAT's features are: (1) hybrid nonlinear inverse problem with calculated x-ray spectrum and detector response; (2) optimization based inversion approach with goal of identifying unknown object configurations - MVO problem; (3) using functionalities of Python libraries for radiographic image processing and analysis; (4) using the Tikhonov regularization method of linear inverse problem to recover partial information of object configurations; (5) using a priori knowledge of problem solutions to define feasible region and discrete neighbor for the MVO problem - initial data analysis + material library $\Rightarrow$ a priori knowledge; and (6) using the NOMAD (C++ version) software in the object.

99 GENERAL AND MISCELLANEOUS↗

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development of an E. coli strain for one-pot biofuel production from ionic liquid pretreated cellulose and switchgrass

Biological production of chemicals and fuels using microbial transformation of sustainable carbon sources, such as pretreated and saccharified plant biomass, is a multi-step process. Typically, each segment of the workflow is optimized separately, often generating conditions that may not be suitable for integration or consolidation with the upstream or downstream steps. While significant effort has gone into developing solutions to incompatibilities at discrete steps, very few studies report the consolidation of the multi-step workflow into a single pot reactor system. Here we demonstrate a one-pot biofuel production process that uses the ionic liquid 1-ethyl-3-methylimidazolium acetate (C 2 C 1 Im][OAc] ) for pretreatment of switchgrass biomass. [C 2 C 1 Im][OAc] is highly effective in deconstructing lignocellulose, but nonetheless leaves behind residual reagents that are toxic to standard saccharification enzymes and the microbial production host. We report the discovery of an [C 2 C 1 Im]-tolerant E. coli strain, where [C 2 C 1 Im] tolerance is bestowed by a P7Q mutation in the transcriptional regulator encoded by rcdA. We establish that the causal impact of this mutation is the derepression of a hitherto uncharacterized major facilitator family transporter, YbjJ. To develop the strain for a one-pot process we engineered this [C 2 C 1 Im]-tolerant strain to express a recently reported d-limonene production pathway. We also screened previously reported [C 2 C 1 Im]-tolerant cellulases to select one that would function with the range of E. coli cultivation conditions and expressed it in the [C 2 C 1 Im]-tolerant E. coli strain so as to secrete this [C 2 C 1 Im]-tolerant cellulase. The final strain digests pretreated biomass, and uses the liberated sugars to produce the bio-jet fuel candidate precursor d-limonene in a one-pot process.

09 BIOMASS FUELS↗

Role of the potential landscape on the single-file diffusion through channels

Transport of colloid particles through narrow channels is ubiquitous in cell biology as well as becoming increasingly important for microfluidic applications or targeted drug delivery. Membrane channels in cells are useful models for artificial designs because of their high efficiency, selectivity, and robustness to external fluctuations. Here, we model the passive channels that let cargo simply diffuse through them, affected by a potential profile along the way. Passive transporters achieve high levels of efficiency and specificity from binding interactions with the cargo inside the channel. This however leads to a paradox: why should channels which are so narrow that they are blocked by their cargo evolve to have binding regions for their cargo if that will effectively block them? Using Brownian dynamics simulations, we show that different potentials, notably symmetric, increase the flux through narrow passive channels – and investigate how shape and depth of potentials influence the flux. We find that there exist optimal depths for certain potential shapes and that it is most efficient to apply a small force over an extended region of the channel. On the other hand, having several spatially discrete binding pockets will not alter the flux significantly. We also explore the role of many-particle effects arising from pairwise particle interactions with their neighbours and demonstrate that the relative changes in flux can be accounted for by the kinetics of the absorption reaction at the end of the channel.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Basic coaxial mass driver reference design

The reference design for a basic coaxial mass driver is developed to illustrate the principles and optimization procedures on the basis of numerical integration by programmable pocket calculators. The four inch caliber system uses a single-coil bucket and a single-phase propulsion track with discrete coils, separately energized by capacitors. An actual driver would use multiple-coil buckets and an oscillatory multi-phase drive system. Even the basic, table-top demonstration system should in principle be able to achieve accelerations in the 1,000 m/sq sec range. Current densities of the order of 25 ka/sq cm, continuously achievable only in superconductors, are carried by an ordinary aluminum bucket coil for a short period in order to demonstrate the calculated acceleration. Ultimately the system can be lengthened and provided with a magnetically levitated, superconducting bucket to study levitation dynamics under quasi-steady-state conditions, and to approach lunar escape velocity in an evacuated tube.

Kolm, H. H.↗

State and model error estimation for distributed parameter systems

In-flight estimation of large structure model errors in order to detect inevitable deficiencies in large structure controller/estimator models is discussed. Such an estimation process is particularly applicable in the area of shape control system design required to maintain a prescribed static structural shape and, in addition, suppress dynamic disturbances due to the vehicle vibrational modes. The paper outlines a solution to the problem of static shape estimation where the vehicle shape must be reconstructed from a set of measurements discretely located throughout the structure. The estimation process is based on the principle of least-squares that inherently contains the definition and explicit computation of model error estimates that are optimal in some sense. Consequently, a solution is provided for the problem of estimation of static model errors (e.g., external loads). A generalized formulation applicable to distributed parameters systems is first worked out and then applied to a one-dimensional beam-like structural configuration.

Rodriguez, G.↗

Comparison of Acoustic Models and Trajectory Generation Methods for an Acoustically-Aware Aircraft

Motivation - Noise management is one of the major barriers to Urban Air Mobility - Approaches to noise mitigation (non-exhaustive) - Vehicle configuration - Directivity control via propeller phase synchronization - Trajectory optimization Objective - Create framework for trajectory generation integrating location-based acoustic metrics and vehicle performance limitations - Multiple trajectory optimization methods and acoustic noise models - Mission-relevant constraints - Mission duration, airspace restrictions, ... - Vehicle dynamic constraints - Aircraft structural limitations, min/max airspeed, ... - Vehicle separation/obstacle avoidance - Acoustic constraints at a number of discrete observer locations

Kasey A. Ackerman↗

Comparison of Acoustic Models and Trajectory Generation Methods for an Acoustically-Aware Aircraft

Motivation - Noise management is one of the major barriers to Urban Air Mobility - Approaches to noise mitigation (non-exhaustive) - Vehicle configuration - Directivity control via propeller phase synchronization - Trajectory optimization Objective - Create framework for trajectory generation integrating location-based acoustic metrics and vehicle performance limitations - Multiple trajectory optimization methods and acoustic noise models - Mission-relevant constraints - Mission duration, airspace restrictions, ... - Vehicle dynamic constraints - Aircraft structural limitations, min/max airspeed, ... - Vehicle separation/obstacle avoidance - Acoustic constraints at a number of discrete observer locations

Kasey A Ackerman↗

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

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

King, Ethan↗

Efficient reconstruction of contaminant release history

We present a generalized hybrid Monte Carlo (GHMC) method for fast, statistically optimal reconstruction of release histories of reactive contaminants. The approach is applicable to large-scale, strongly nonlinear systems with parametric uncertainties and data corrupted by measurement errors. The use of discrete adjoint equations facilitates numerical implementation of GHMC, without putting any restrictions on the degree of nonlinearity of advection-dispersion-reaction equations that are used to described contaminant transport in the subsurface. To demonstrate the salient features of the proposed algorithm, we identify the spatial extent of a distributed source of contamination from concentration measurements of a reactive solute.

97 MATHEMATICS AND COMPUTING↗

Utilization of Historic Information in an Optimisation Task

One of the basic components of a discrete model of motor behavior and decision making, which describes tracking and supervisory control in unitary terms, is assumed to be a filtering mechanism which is tied to the representational principles of human memory for time-series information. In a series of experiments subjects used the time-series information with certain significant limitations: there is a range-effect; asymmetric distributions seem to be recognized, but it does not seem to be possible to optimize performance based on skewed distributions. Thus there is a transformation of the displayed data between the perceptual system and representation in memory involving a loss of information. This rules out a number of representational principles for time-series information in memory and fits very well into the framework of a comprehensive discrete model for control of complex systems, modelling continuous control (tracking), discrete responses, supervisory behavior and learning.

Boesser, T.↗

Nonlocal Flocking Dynamics: Learning the Fractional Order of PDEs from Particle Simulations

Flocking refers to collective behavior of a large number of interacting entities, where the interactions between discrete individuals produce collective motion on the large scale. We employ an agent-based model to describe the microscopic dynamics of each individual in a flock, and use a fractional partial differential equation (fPDE) to model the evolution of macroscopic quantities of interest. The macroscopic models with phenomenological interaction functions are derived by applying the continuum hypothesis to the microscopic model. Instead of specifying the fPDEs with an ad hoc fractional order for nonlocal flocking dynamics, we learn the effective nonlocal influence function in fPDEs directly from particle trajectories generated by the agent-based simulations. We demonstrate how the learning framework is used to connect the discrete agent-based model to the continuum fPDEs in one- and two-dimensional nonlocal flocking dynamics. In particular, a Cucker–Smale particle model is employed to describe the microscale dynamics of each individual, while Euler equations with nonlocal interaction terms are used to compute the evolution of macroscale quantities. The trajectories generated by the particle simulations mimic the field data of tracking logs that can be obtained experimentally. They can be used to learn the fractional order of the influence function using a Gaussian process regression model implemented with the Bayesian optimization. We show in one- and two-dimensional benchmarks that the numerical solution of the learned Euler equations solved by the finite volume scheme can yield correct density distributions consistent with the collective behavior of the agent-based system solved by the particle method. Furthermore, the proposed method offers new insights into how to scale the discrete agent-based models to the continuum-based PDE models, and could serve as a paradigm on extracting effective governing equations for nonlocal flocking dynamics directly from particle trajectories.

97 MATHEMATICS AND COMPUTING↗

Development of the Adaptive Collision Source (ACS) method for discrete ordinates

We have developed a new collision source method to solve the Linear Boltzmann Equation (LBE) more efficiently by adaptation of the angular quadrature order. The angular adaptation method is unique in that the flux from each scattering source iteration is obtained, with potentially a different quadrature order. Traditionally, the flux from every iteration is combined, with the same quadrature applied to the combined flux. Since the scattering process tends to distribute the radiation more evenly over angles (i.e., make it more isotropic), the quadrature requirements generally decrease with each iteration. This allows for an optimal use of processing power, by using a high order quadrature for the first few iterations that need it, before shifting to lower order quadratures for the remaining iterations. This is essentially an extension of the first collision source method, and we call it the adaptive collision source method (ACS). The ACS methodology has been implemented in the TITAN discrete ordinates code, and has shown a relative speedup of 1.5-2.5 on a test problem, for the same desired level of accuracy. (authors)

97 MATHEMATICS AND COMPUTING↗

Optimizing a Multiple Right-Hand Side Dslash Kernel for Intel Knights Corner

Lattice Quantum Chromo-dynamics (LQCD) stands unique as the only computationally tractable, non-perturbative, and model-independent quantum field theory of the strong nuclear force. LQCD achieves tractability by discretizing our familiar 4-dimensional space-time onto a hypercubic lattice. The core component of the linear solver used in LQCD is the Wilson-Dirac operator whose finite difference component is called the Dslash operator. Dslash is a nearest neighbor stencil operator summing matrix-vector multiplications over lattice points. The arithmetic intensity of a regular Dslash operator acting on a single vector in single precision is between 0.88-2.29 (depending on the tricks employed) making it memory bandwidth bound on most current architectures, including Xeon Phi. Maximizing the performance of Dslash on Xeon Phi requires deliberate exploitation of its architectural features. One key feature of Xeon Phi is its powerful vector processing unit with lengthy vector registers. There is a class of LQCD computations which aims to solve the Dirac equation for the same lattice gauge fields multiple times. In this case one can gain additional reuse of the gauge field, and potentially simplified vectorization, through applying Dslash to several vectors at the same time; often referred to as Multiple Right Hand Side (MRHS) Dslash. Previous work in this area focused on applying this approach to the Highly Improved Staggered operator, and in cases to the multi-Grid algorithm for Wilson clover fermions. Here, we present two approaches to MRHS Dslash: a vector register blocking approach and one using the software package QPhiX with a custom Code Generator for low-level intrinsics. We explore the Knights Corner instruction set, memory hierarchy, and threading capabilities. For standard lattice sizes used in testing, we observed significant speedups, with sustained performance of over 700 GFLOPS (single precision) in one instance. We achieved up to 27% of theoretical peak performance compared to a maximum of 12% obtained by the previous single RHS method in QPhiX.

Joó, Bálint↗

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗