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,099 records · Page 61

Asymptotically Compatible Reproducing Kernel Collocation and Meshfree Integration for Nonlocal Diffusion

Reproducing kernel (RK) approximations are meshfree methods that construct shape functions from sets of scattered data. We present an asymptotically compatible (AC) RK collocation method for nonlocal diffusion models with Dirichlet boundary condition. The numerical scheme is shown to be convergent to both nonlocal diffusion and its corresponding local limit as nonlocal interaction vanishes. The analysis is carried out on a special family of rectilinear Cartesian grids for a linear RK method with designed kernel support. The key idea for the stability of the RK collocation scheme is to compare the collocation scheme with the standard Galerkin scheme, which is stable. In addition, assembling the stiffness matrix of the nonlocal problem requires costly computational resources because high-order Gaussian quadrature is necessary to evaluate the integral. We thus provide a remedy to the problem by introducing a quasi-discrete nonlocal diffusion operator for which no numerical quadrature is further needed after applying the RK collocation scheme. The quasi-discrete nonlocal diffusion operator combined with RK collocation is shown to be convergent to the correct local diffusion problem by taking the limits of nonlocal interaction and spatial resolution simultaneously. The theoretical results are then validated with numerical experiments. We additionally illustrate a connection between the proposed technique and an existing optimization based approach based on generalized moving least squares.

97 MATHEMATICS AND COMPUTING↗

Optimal Design of Intensified Towers for CO2 Capture with Internal, Printed Heat Exchangers

Solvent-based carbon capture processes typically suffer from the temperature rise of the solvent due to the heat of absorption of CO2. This increased temperature is not thermodynamically favor-able and results in a significant reduction in performance in the absorber column. As opposed to interstage coolers, which only remove, cool, and return the solvent at discrete locations in the column, internal coolers that are integrated with the packing can cool the process inline, which can result in improved efficiency. This work presents the modeling of these internal coolers within an existing generic, equation-oriented absorber column model that can cool the process while allowing for simultaneous mass transfer. Optimization of this model is also performed, which is capable of optimally choosing the best locations to place these devices, such that heat removal and mass transfer area are balanced. Results of the optimization have shown that optimally placed cooling elements result in a significant increase in the capture efficiency of the process, compared to a similar column with no internal cooling, with a common trend being the cooling of the column in the temperature bulge region. It is observed that by optimally placing an internal cooler, the solvent flow rate can be decreased, and the CO2 lean loading can be increased while still maintaining the same efficiency. These process changes can lead to a substantial reduction in costs due to lower reboiler duty.

Summits, Stephen↗

Discrete Approximations of Dynamical Quantum Zeno Effect

In this paper, we discuss approximations of the dynamical quantum Zeno effect by a fixed number of nonselective quantum measurements. A wide class of measurements whose efficiency is close to optimal in the case of two-level systems is found.

97 MATHEMATICS AND COMPUTING↗

Optimal Design and Techno-Economic Analysis of 3D-Printed, Intensified Packings for Absorbers and Strippers in Solvent-Based CO 2 Capture

A potential technology for the CO 2 absorption process is utilizing intensified structured packing with embedded cooling/heating channels for continuous heat exchange, which can overcome limitations of discrete methods, such as discrete intercooling and centralized reboilers, to aid in reducing energy consumption and decreasing costs. This work investigates the modeling of intensified packing (IP) for the stripper tower, extending on previous work for the absorber, which distributes heat internally within the column, improving the thermodynamics for the solvent regeneration process. The model includes submodels for steam turbine extraction to produce steam at various qualities as well as a surrogate model for calculating steam enthalpy. A cost model for a plant-scale absorption capture process was developed, allowing for the design of the plant to be optimized, subject to minimizing capture cost using two different power plant flue gas sources. In this optimization, the placement of IP in both towers is optimized to balance the trade-off between enhanced heat transfer and reduced mass transfer volume. For natural gas combined cycle flue gas, the standard process configuration had a minimum cost of $\$$65.40/tonne CO 2 , and considering IP, the minimum capture cost is reduced to $\$$62.73/tonne, with utilization in the stripper column, which reduces yearly costs by up to $\$$2.67 MM/yr. Cooling the absorber through IP, or intercoolers, was only found to be beneficial at higher capture rates, with IP in both towers having a cost of capture of $\$$68.08/tonne at 99.9% capture, a reduction of $\$$12.64/tonne when using only intercoolers at the same capture rate. When capturing from pulverized-coal power plants, the minimum cost of capture when using IP in both towers is $\$$44.18/tonne (at 97% capture), while the standard configuration with and without intercoolers was $\$$45.69 and $\$$47.22 per tonne, respectively. This results in a reduction in yearly costs of $\$$16.98 MM/yr from the base-case configuration. At this higher CO 2 concentration, cooling in the absorber from the IP becomes extremely beneficial, reducing energy consumption by up to 6%.

20 FOSSIL-FUELED POWER PLANTS↗

Surrogate-Based Robust Design for a Non-Smooth Radiation Source Detection Problem

In this paper, we develop and numerically illustrate a robust sensor network design to optimally detect a radiation source in an urban environment. This problem exhibits several challenges: penalty functionals are non-smooth due to the presence of buildings, radiation transport models are often computationally expensive, sensor locations are not limited to a discrete number of points, and source intensity and location responses, based on a fixed number of sensors, are not unique. We consider a radiation source located in a prototypical 250 m × 180 m urban setting. To address the non-smooth properties of the model and computationally expensive simulation codes, we employ a verified surrogate model based on radial basis functions. Using this surrogate, we formulate and solve a robust design problem that is optimal in an average sense for detecting source location and intensity with minimized uncertainty.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation

A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.

97 MATHEMATICS AND COMPUTING↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

A convex complementarity approach for simulating large granular flows.

Aiming at the simulation of dense granular flows, we propose and test a numerical method based on successive convex complementarity problems. This approach originates from a multibody description of the granular flow: all the particles are simulated as rigid bodies with arbitrary shapes and frictional contacts. Unlike the discrete element method (DEM), the proposed approach does not require small integration time steps typical of stiff particle interaction; this fact, together with the development of optimized algorithms that can run also on parallel computing architectures, allows an efficient application of the proposed methodology to granular flows with a large number of particles. We present an application to the analysis of the refueling flow in pebble-bed nuclear reactors. Extensive validation of our method against both DEM and physical experiments results indicates that essential collective characteristics of dense granular flow are accurately predicted.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Economic and Physical Modeling of Land Use in GCAM 3.0 and an Application to Agricultural Productivity, Land, and Terrestrial Carbon

We explore the impact of changes in agricultural productivity on global land use and terrestrial carbon using the new agriculture and land use modeling approach developed for Global Change Assessment Model (GCAM) version 3.0. This approach models economic land use decisions with regional, physical, and technological specificity while maintaining economic and physical integration with the rest of the GCAM model. Physical land characteristics and quantities are tracked explicitly, and crop production practices are modeled discretely to facilitate coupling with physical models. Economic land allocation is modeled with non-linear functions in a market equilibrium rather than through a constrained optimization. In this paper, we explore three scenarios of future agriculture productivity in all regions of the globe over this century, ranging from a high growth to a zero growth level. The higher productivity growth scenario leads to lower crop prices, increased production of crops in developing nations, preservation of global forested lands and lower terrestrial carbon emissions. The scenario with no productivity improvement results in higher crop prices, an expansion of crop production in the developed world, loss of forested lands globally, and higher terrestrial carbon emissions.

Wise, Marshall A.↗

Epi-Regularization of Risk Measures

Uncertainty pervades virtually every branch of science and engineering, and in many disciplines, the underlying phenomena can be modeled by partial differential equations (PDEs) with uncertain or random inputs. This work is motivated by risk-averse stochastic programming problems constrained by PDEs. These problems are posed in infinite dimensions, which leads to a significant increase in the scale of the (discretized) problem. In order to handle the inherent nonsmoothness of, for example, coherent risk measures and to exploit existing solution techniques for smooth, PDE-constrained optimization problems, we propose a variational smoothing technique called epigraphical (epi-)regularization. Here, we investigate the effects of epi-regularization on the axioms of coherency and prove differentiability of the smoothed risk measures. In addition, we demonstrate variational convergence of the epi-regularized risk measures and prove the consistency of minimizers and first-order stationary points for the approximate risk-averse optimization problem. We conclude with numerical experiments confirming our theoretical results.

97 MATHEMATICS AND COMPUTING↗

Dynamic Mesh Adaptation for Front Evolution Using Discontinuous Galerkin Based Weighted Condition Number Mesh Relaxation

A new mesh smoothing method designed to cluster mesh cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function being computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered elds, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well for the weight function as the actual level set. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Dynamic cases for moving interfaces are presented to demonstrate the method's potential usefulness to arbitrary Lagrangian Eulerian (ALE) methods.

97 MATHEMATICS AND COMPUTING↗

Deep Conservation: A latent dynamics model for exact satisfaction of physical conservation laws [Report]

This work proposes an approach for latent dynamics learning that exactly enforces physical conservation laws. The method comprises two steps. First, we compute a low-dimensional embedding of the high-dimensional dynamical-system state using deep convolutional autoencoders. This defines a low-dimensional nonlinear manifold on which the state is subsequently enforced to evolve. Second, we define a latent dynamics model that associates with a constrained optimization problem. Specifically, the objective function is defined as the sum of squares of conservation-law violations over control volumes in a finite-volume discretization of the problem; nonlinear equality constraints explicitly enforce conservation over prescribed subdomains of the problem. The resulting dynamics model—which can be considered as a projection-based reduced-order model—ensures that the time-evolution of the latent state exactly satisfies conservation laws over the prescribed subdomains. In contrast to existing methods for latent dynamics learning, this is the only method that both employs a nonlinear embedding and computes dynamics for the latent state that guarantee the satisfaction of prescribed physical properties. Numerical experiments on a benchmark advection problem illustrate the method's ability to significantly reduce the dimensionality while enforcing physical conservation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MAGNETO-FRICTIONAL MODELING OF CORONAL NONLINEAR FORCE-FREE FIELDS. I. TESTING WITH ANALYTIC SOLUTIONS

We report our implementation of the magneto-frictional method in the Message Passing Interface Adaptive Mesh Refinement Versatile Advection Code (MPI-AMRVAC). The method aims at applications where local adaptive mesh refinement (AMR) is essential to make follow-up dynamical modeling affordable. We quantify its performance in both domain-decomposed uniform grids and block-adaptive AMR computations, using all frequently employed force-free, divergence-free, and other vector comparison metrics. As test cases, we revisit the semi-analytic solution of Low and Lou in both Cartesian and spherical geometries, along with the topologically challenging Titov–Démoulin model. We compare different combinations of spatial and temporal discretizations, and find that the fourth-order central difference with a local Lax–Friedrichs dissipation term in a single-step marching scheme is an optimal combination. The initial condition is provided by the potential field, which is the potential field source surface model in spherical geometry. Various boundary conditions are adopted, ranging from fully prescribed cases where all boundaries are assigned with the semi-analytic models, to solar-like cases where only the magnetic field at the bottom is known. Our results demonstrate that all the metrics compare favorably to previous works in both Cartesian and spherical coordinates. Cases with several AMR levels perform in accordance with their effective resolutions. The magneto-frictional method in MPI-AMRVAC allows us to model a region of interest with high spatial resolution and large field of view simultaneously, as required by observation-constrained extrapolations using vector data provided with modern instruments. The applications of the magneto-frictional method to observations are shown in an accompanying paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Integrated control-system design via generalized LQG (GLQG) theory

Thirty years of control systems research has produced an enormous body of theoretical results in feedback synthesis. Yet such results see relatively little practical application, and there remains an unsettling gap between classical single-loop techniques (Nyquist, Bode, root locus, pole placement) and modern multivariable approaches (LQG and H infinity theory). Large scale, complex systems, such as high performance aircraft and flexible space structures, now demand efficient, reliable design of multivariable feedback controllers which optimally tradeoff performance against modeling accuracy, bandwidth, sensor noise, actuator power, and control law complexity. A methodology is described which encompasses numerous practical design constraints within a single unified formulation. The approach, which is based upon coupled systems or modified Riccati and Lyapunov equations, encompasses time-domain linear-quadratic-Gaussian theory and frequency-domain H theory, as well as classical objectives such as gain and phase margin via the Nyquist circle criterion. In addition, this approach encompasses the optimal projection approach to reduced-order controller design. The current status of the overall theory will be reviewed including both continuous-time and discrete-time (sampled-data) formulations.

Bernstein, Dennis S.↗

A multigrid nonoscillatory method for computing high speed flows

A multigrid method using different smoothers has been developed to solve the Euler equations discretized by a nonoscillatory scheme up to fourth order accuracy. The best smoothing property is provided by a five-stage Runge-Kutta technique with optimized coefficients, yet the most efficient smoother is a backward Euler technique in factored and diagonalized form. The singlegrid solution for a hypersonic, viscous conic flow is in excellent agreement with the solution obtained by the third order MUSCL and Roe's method. Mach 8 inviscid flow computations for a complete entry probe have shown that the accuracy is at least as good as the symmetric TVD scheme of Yee and Harten. The implicit multigrid method is four times more efficient than the explicit multigrid technique and 3.5 times faster than the single-grid implicit technique. For a Mach 8.7 inviscid flow over a blunt delta wing at 30 deg incidence, the CPU reduction factor from the three-level multigrid computation is 2.2 on a grid of 37 x 41 x 73 nodes.

Li, C. P.↗

Three-dimensional aerodynamic shape optimization of supersonic delta wings

A recently developed three-dimensional aerodynamic shape optimization procedure AeSOP(sub 3D) is described. This procedure incorporates some of the most promising concepts from the area of computational aerodynamic analysis and design, specifically, discrete sensitivity analysis, a fully implicit 3D Computational Fluid Dynamics (CFD) methodology, and 3D Bezier-Bernstein surface parameterizations. The new procedure is demonstrated in the preliminary design of supersonic delta wings. Starting from a symmetric clipped delta wing geometry, a Mach 1.62 asymmetric delta wing and two Mach 1. 5 cranked delta wings were designed subject to various aerodynamic and geometric constraints.

Burgreen, Greg W.↗

A Discontinuous Galerkin Method for Parabolic Problems with Modified hp-Finite Element Approximation Technique

A recent paper is generalized to a case where the spatial region is taken in R(sup 3). The region is assumed to be a thin body, such as a panel on the wing or fuselage of an aerospace vehicle. The traditional h- as well as hp-finite element methods are applied to the surface defined in the x - y variables, while, through the thickness, the technique of the p-element is employed. Time and spatial discretization scheme based upon an assumption of certain weak singularity of double vertical line u(sub t) double vertical line 2, is used to derive an optimal a priori error estimate for the current method.

Kaneko, Hideaki↗