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 541 records · Page 30

Active learning of a crystal plasticity flow rule from discrete dislocation dynamics simulations

Continuum-scale material deformation models, such as crystal plasticity (CP), can significantly enhance their predictive accuracy by incorporating input from lower-scale (i.e. mesoscale) models. The procedure to generate and extract the relevant information is however typically complex and ad hoc, involving decision and intervention by domain experts, leading to long development times. In this study, we develop a principled approach for calibration of continuum-scale models using lower scale information by representing a CP flow rule as a Gaussian process model. This representation allows for efficient parameter space exploration, guided by the uncertainty embedded in the model through a process known as Bayesian optimization (BO). We demonstrate a semi-autonomous BO loop which instantiates discrete dislocation dynamics simulations whose initial conditions are automatically chosen to optimize the uncertainty of a model CP flow rule. Our self-guided computational pipeline efficiently generated a dataset and corresponding model whose error, uncertainty, and physical feature sensitivities were validated with comparison to an independent dataset four times larger, demonstrating a valuable and efficient active learning implementation readily transferable to similar material systems.

36 MATERIALS SCIENCE↗

On optimal soft-decision demodulation

A necessary condition is derived for optimal J-ary coherent demodulation of M-ary (M greater than 2) signals. Optimality is defined as maximality of the symmetric cutoff rate of the resulting discrete memoryless channel. Using a counterexample, it is shown that the condition derived is generally not sufficient for optimality. This condition is employed as the basis for an iterative optimization method to find the optimal demodulator decision regions from an initial 'good guess'. In general, these regions are found to be bounded by hyperplanes in likelihood space; the corresponding regions in signal space are found to have hyperplane asymptotes for the important case of additive white Gaussian noise. Some examples are presented, showing that the regions in signal space bounded by these asymptotic hyperplanes define demodulator decision regions that are virtually optimal.

Lee, L.-N.↗

Divergence preserving reconstruction of the nodal components of a vector field from its normal components to edges

We have developed a new divergence preserving method for the reconstruction of the Cartesian components of a vector field from the orthogonal projection of a vector field to the normals to edges in two dimensional. In this method, discrete divergences computed from the nodal components and from the normal ones are exactly the same. Our new method consists of two stages. At the first stage, we use an extended version of the local procedure described in [J. Comput. Phys., 139:406–409, 1998] to obtain a ‘reference’ nodal vector. This local procedure is exact for linear vector fields; however, the discrete divergence is not preserved. Then, we formulate a constrained optimization problem, in which this reference vector plays the role of a target, and the divergence constraints are enforced by using Lagrange multipliers. It leads to the solution of ‘elliptic’ like discrete equations for the cell-centered Lagrange multipliers. The new global divergence preserving method is exact for linear vector fields. Here in this paper, we describe all details of our new method and present numerical results, which confirm our theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multirate digital control system design

Methods for multirate digital control system design are discussed. A simple method for sampling rate selection based on control bandwidths is proposed. Methods for generating a discrete-time state model of a sampled-data plant and a discrete-time equivalent to an analog cost function for a sampled-data plant are described. The succesive loop closures and linear quadratic Gaussian synthesis methods are reviewed, and a constrained optimization synthesis method is introduced. The proposed sampling rate selection, discretization, and synthesis methods are applied to two example design problems. Multirate and single-rate compensators synthesized by the different methods are compared, based on closed-loop responses, with compensators having the same real-time computation load.

Berg, Martin C.↗

Quadratic Optimization in the Problems of Active Control of Sound

We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulations of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources. These optimal solutions happen to be particular layers of monopoles on the perimeter of the protected region. Mathematically, minimization of acoustic source strength is equivalent to minimization in the sense of L(sub 1). By contrast. in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L(sub 2) norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L(sub 2) minimization is certainly the easiest problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we call compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L(sub 2) differ drastically from those obtained in the sense of L(sub 1).

Loncaric, J.↗

Sonic Boom Mitigation Through Aircraft Design and Adjoint Methodology

This paper presents a novel approach to design of the supersonic aircraft outer mold line (OML) by optimizing the A-weighted loudness of sonic boom signature predicted on the ground. The optimization process uses the sensitivity information obtained by coupling the discrete adjoint formulations for the augmented Burgers Equation and Computational Fluid Dynamics (CFD) equations. This coupled formulation links the loudness of the ground boom signature to the aircraft geometry thus allowing efficient shape optimization for the purpose of minimizing the impact of loudness. The accuracy of the adjoint-based sensitivities is verified against sensitivities obtained using an independent complex-variable approach. The adjoint based optimization methodology is applied to a configuration previously optimized using alternative state of the art optimization methods and produces additional loudness reduction. The results of the optimizations are reported and discussed.

Rallabhandi, Siriam K.↗

SU-E-I-23: A General KV Constrained Optimization of CNR for CT Abdominal Imaging

Purpose: While Tube current modulation has been well accepted for CT dose reduction, kV adjusting in clinical settings is still at its early stage. This is mainly due to the limited kV options of most current CT scanners. kV adjusting can potentially reduce radiation dose and optimize image quality. This study is to optimize CT abdomen imaging acquisition based on the assumption of a continuous kV, with the goal to provide the best contrast to noise ratio (CNR). Methods: For a given dose (CTDIvol) level, the CNRs at different kV and pitches were measured with an ACR GAMMEX phantom. The phantom was scanned in a Siemens Sensation 64 scanner and a GE VCT 64 scanner. A constrained mathematical optimization was used to find the kV which led to the highest CNR for the anatomy and pitch setting. Parametric equations were obtained from polynomial fitting of plots of kVs vs CNRs. A suitable constraint region for optimization was chosen. Subsequent optimization yielded a peak CNR at a particular kV for different collimations and pitch setting. Results: The constrained mathematical optimization approach yields kV of 114.83 and 113.46, with CNRs of 1.27 and 1.11 at the pitch of 1.2 and 1.4, respectively, for the Siemens Sensation 64 scanner with the collimation of 32 x 0.625mm. An optimized kV of 134.25 and 1.51 CNR is obtained for a GE VCT 64 slice scanner with a collimation of 32 x 0.625mm and a pitch of 0.969. At 0.516 pitch and 32 x 0.625 mm an optimized kV of 133.75 and a CNR of 1.14 was found for the GE VCT 64 slice scanner. Conclusion: CNR in CT image acquisition can be further optimized with a continuous kV option instead of current discrete or fixed kV settings. A continuous kV option is a key for individualized CT protocols.

60 APPLIED LIFE SCIENCES↗

Perceptual Optimization of DCT Color Quantization Matrices

Many image compression schemes employ a block Discrete Cosine Transform (DCT) and uniform quantization. Acceptable rate/distortion performance depends upon proper design of the quantization matrix. In previous work, we showed how to use a model of the visibility of DCT basis functions to design quantization matrices for arbitrary display resolutions and color spaces. Subsequently, we showed how to optimize greyscale quantization matrices for individual images, for optimal rate/perceptual distortion performance. Here we describe extensions of this optimization algorithm to color images.

Watson, Andrew B.↗

Multigrid solution of a distributed optimal control problem constrained by the Stokes equations

We construct multigrid preconditioners to accelerate the solution process of a linear-quadratic optimal control problem constrained by the Stokes system. The first order optimality conditions of the control problem form a linear system (the KKT system) connecting the state, adjoint, and control variables. Our approach is to eliminate the state and adjoint variables by essentially solving two Stokes systems, and to construct efficient multigrid preconditioners for the Schur-complement of the block associated with the state and adjoint variables. These multigrid preconditioners are shown to be of optimal order with respect to the convergence properties of the discrete methods used to solve the Stokes system. In particular, the number of conjugate gradient iterations is shown to decrease as the resolution increases, a feature shared by similar multigrid preconditioners for elliptic constrained optimal control problems.

97 MATHEMATICS AND COMPUTING↗

Application of a Momentum Source Model to the RAH-66 Comanche FANTAIL

A Momentum Source Model has been revised and implemented in the flow solver OVERFLOW-D. In this approach, the fan forces are evaluated from two-dimensional airfoil tables as a function of local Mach number and angle-of-attack and applied as source terms in the discretized Navier-Stokes equations. The model revisions include a new model for forces in the tip region and axial distribution of the source terms. The model revisions improve the results significantly. The Momentum Source Model agrees well with a discrete blade model for all computed collective pitch angles. The two models agree well with experimental data for thrust vs. torque. The Momentum Source Model is a good complement to Discrete Blade Models for ducted fan computations. The lower computational and labor costs make parametric studies, optimization studies and interactional aerodynamics studies feasible for cases beyond what is practical with a Discrete Blade Model today.

Nygaard, Tor A.↗

Hybrid parallel code acceleration methods in full-core reactor physics calculations

When dealing with nuclear reactor calculation schemes, the need for three dimensional (3D) transport-based reference solutions is essential for both validation and optimization purposes. Considering a benchmark problem, this work investigates the potential of discrete ordinates (Sn) transport methods applied to 3D pressurized water reactor (PWR) full-core calculations. First, the benchmark problem is described. It involves a pin-by-pin description of a 3D PWR first core, and uses a 8-group cross-section library prepared with the DRAGON cell code. Then, a convergence analysis is performed using the PENTRAN parallel Sn Cartesian code. It discusses the spatial refinement and the associated angular quadrature required to properly describe the problem physics. It also shows that initializing the Sn solution with the EDF SPN solver COCAGNE reduces the number of iterations required to converge by nearly a factor of 6. Using a best estimate model, PENTRAN results are then compared to multigroup Monte Carlo results obtained with the MCNP5 code. Good consistency is observed between the two methods (Sn and Monte Carlo), with discrepancies that are less than 25 pcm for the k{sub eff}, and less than 2.1% and 1.6% for the flux at the pin-cell level and for the pin-power distribution, respectively. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A mesh gradient technique for numerical optimization

A class of successive-improvement optimization methods in which directions of descent are defined in the state space along each trial trajectory are considered. The given problem is first decomposed into two discrete levels by imposing mesh points. Level 1 consists of running optimal subarcs between each successive pair of mesh points. For normal systems, these optimal two-point boundary value problems can be solved by following a routine prescription if the mesh spacing is sufficiently close. A spacing criterion is given. Under appropriate conditions, the criterion value depends only on the coordinates of the mesh points, and its gradient with respect to those coordinates may be defined by interpreting the adjoint variables as partial derivatives of the criterion value function. In level 2, the gradient data is used to generate improvement steps or search directions in the state space which satisfy the boundary values and constraints of the given problem.

Willis, E. A., Jr.↗

Generalized fictitious methods for fluid–structure interactions: Analysis and simulations

We present a new fictitious pressure method for fluid–structure interaction (FSI) problems in incompressible flow by generalizing the fictitious mass and damping methods we published previously in [1]. The fictitious pressure method involves modification of the fluid solver whereas the fictitious mass and damping methods modify the structure solver. We analyze all fictitious methods for simplified problems and obtain explicit expressions for the optimal reduction factor (convergence rate index) at the FSI interface [2]. This analysis also demonstrates an apparent similarity of fictitious methods to the FSI approach based on Robin boundary conditions, which have been found to be very effective in FSI problems. We implement all methods, including the semi-implicit Robin based coupling method, in the context of spectral element discretization, which is more sensitive to temporal instabilities than low-order methods. However, the methods we present here are simple and general, and hence applicable to FSI based on any other spatial discretization. In numerical tests, we verify the selection of optimal values for the fictitious parameters for simplified problems and for vortex-induced vibrations (VIV) even at zero mass ratio (“for-ever-resonance”). We also develop an empirical a posteriori analysis for complex geometries and apply it to 3D patient-specific flexible brain arteries with aneurysms for very large deformations. We demonstrate that the fictitious pressure method enhances stability and convergence, and is comparable or better in most cases to the Robin approach or the other fictitious methods.

Computer Science↗

Real-Time Control of an Ensemble of Heterogeneous Resources

This paper focuses on the problem of controlling an ensemble of heterogeneous resources connected to an electrical grid at the same point of common coupling (PCC). The controller receives an aggregate power setpoint for the ensemble in real time and tracks this setpoint by issuing individual optimal setpoints to the resources. The resources can have continuous or discrete nature (e.g., heating systems consisting of a finite number of heaters that each can be either switched on or off) and/or can be highly uncertain (e.g., photovoltaic (PV) systems or residential loads). A naive approach would lead to a stochastic mixed-integer optimization problem to be solved at the controller at each time step, which might be infeasible in real time. Instead, we allow the controller to solve a continuous convex optimization problem and compensate for the errors at the resource level by using a variant of the well-known error diffusion algorithm. We give conditions guaranteeing that our algorithm tracks the power setpoint at the PCC on average while issuing optimal setpoints to individual resources. We illustrate the approach numerically by controlling a collection of batteries, PV systems, and discrete loads.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Single step optimization of manipulator maneuvers with variable structure control

One step ahead optimization has been recently proposed for spacecraft attitude maneuvers as well as for robot manipulator maneuvers. Such a technique yields a discrete time control algorithm implementable as a sequence of state-dependent, quadratic programming problems for acceleration optimization. Its sensitivity to model accuracy, for the required inversion of the system dynamics, is shown in this paper to be alleviated by a fast variable structure control correction, acting between the sampling intervals of the slow one step ahead discrete time acceleration command generation algorithm. The slow and fast looping concept chosen follows that recently proposed for optimal aiming strategies with variable structure control. Accelerations required by the VSC correction are reserved during the slow one step ahead command generation so that the ability to overshoot the sliding surface is guaranteed.

Chen, N.↗

On the Fidelity of Computational Models for the Flow of Milled Loblolly Pine: A Benchmark Study on Continuum-Mechanics Models and Discrete-Particle Models

The upstream of bioenergy industry has suffered from unreliable operations of granular biomass feedstocks in handling equipment. Computational modeling, including continuum-mechanics models and discrete-particle models, offers insightful understandings and predictive capabilities on the flow of milled biomass and can assist equipment design and optimization. This paper presents a benchmark study on the fidelity of the continuum and discrete modeling approaches for predicting granular biomass flow. We first introduce the constitutive law of the continuum-mechanics model and the contact law of the coarse-grained discrete-particle model, with model parameters calibrated against laboratory characterization tests of the milled loblolly pine. Three classical granular material flow systems (i.e., a lab-scale rotating drum, a pilot-scale hopper, and a full-scale inclined plane) are then simulated using the two models with the same initial and boundary conditions as the physical experiments. The close agreement of the numerical predictions with the experimental measurements on the hopper mass flow rate, the hopper critical outlet width, the material stopping thickness on the inclined plane, and the dynamic angle of repose, clearly indicates that the two methods can capture the critical flow behavior of granular biomass. The qualitative comparison shows that the continuum-mechanics model outperforms in parameterization of materials and wall friction, and large-scale systems, while the discrete-particle model is more preferred for discontinuous flow systems at smaller scales. Industry stakeholders can use these findings as guidance for choosing appropriate numerical tools to model biomass material flow in part of the optimization of material handling equipment in biorefineries.

Jin, Wencheng↗

Open-loop-feedback-optimal adaptive stochastic control of linear systems

This paper considers the suboptimal stochastic control of linear discrete-time dynamical systems with unknown or stochastically varying parameters. The suboptimal scheme is based upon the use of the open-loop-feedback-optimal method. The state and parameter estimates are generated by an extended Kalman filter algorithm. Numerical results for first-order systems are presented.

Ku, R.↗