Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical 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 361 records · Page 20

Experimental and numerical investigation on air-side performance of fin-and-tube heat exchangers with various fin patterns

Air-side heat transfer and friction characteristics of five kinds of fin-and-tube heat exchangers, with the number of tube rows (N = 12) and the diameter of tubes (D{sub o} = 18 mm), have been experimentally investigated. The test samples consist of five types of fin configurations: crimped spiral fin, plain fin, slit fin, fin with delta-wing longitudinal vortex generators (VGs) and mixed fin with front 6-row vortex-generator fin and rear 6-row slit fin. The heat transfer and friction factor correlations for different types of heat exchangers were obtained with the Reynolds numbers ranging from 4000 to 10000. It was found that crimped spiral fin provides higher heat transfer and pressure drop than the other four fins. The air-side performance of heat exchangers with the above five fins has been evaluated under three sets of criteria and it was shown that the heat exchanger with mixed fin (front vortex-generator fin and rear slit fin) has better performance than that with fin with delta-wing vortex generators, and the slit fin offers best heat transfer performance at high Reynolds numbers. Based on the correlations of numerical data, Genetic Algorithm optimization was carried out, and the optimization results indicated that the increase of VG attack angle or length, or decrease of VG height may enhance the performance of vortex-generator fin. The heat transfer performances for optimized vortex-generator fin and slit fin at hand have been compared with numerical method. (author)

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Direct stellarator coil optimization for nested magnetic surfaces with precise quasi-symmetry

We present a robust optimization algorithm for the design of electromagnetic coils that generate vacuum magnetic fields with nested flux surfaces and precise quasi-symmetry. The method is based on a bilevel optimization problem, where the outer coil optimization is constrained by a set of inner least squares optimization problems whose solutions describe magnetic surfaces. The outer optimization objective targets coils that generate a field with nested magnetic surfaces and good quasi-symmetry. The inner optimization problems identify magnetic surfaces when they exist, and approximate surfaces in the presence of magnetic islands or chaos. We show that this formulation can be used to heal islands and chaos, thus producing coils that result in magnetic fields with precise quasi-symmetry. We show that the method can be initialized with coils from the traditional two-stage coil design process, as well as coils from a near-axis expansion optimization. We present a numerical example where island chains are healed and quasi-symmetry is optimized up to surfaces with aspect ratio 6. Another numerical example illustrates that the aspect ratio of nested flux surfaces with optimized quasi-symmetry can be decreased from 6 to approximately 4. In conclusion, the last example shows that our approach is robust and a cold-start using coils from a near-axis expansion optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗

Beams of gravitationally bound ultracold neutrons in rough waveguides

We investigate the propagation of ultracold neutrons through a rough waveguide in conjunction with recent experiments in which the ultracold neutrons were beamed between a perfect mirror and a rough scatterer and absorber. The main goal is to find a way to resolve the lowest gravitationally quantized discrete states in the peV range. We compare the neutron count for various types of mirrors with Gaussian, power-law, and exponential correlation functions of surface inhomogeneities. The main conclusion is that all the information about inhomogeneities, including their amplitude, correlation radius, and the rate of decay of the correlation function, enter the exit neutron count via just a single constant {Phi}, which effectively renormalizes the amplitude of roughness. To observe well-defined quantum steps, one should have an experimental setup with {Phi}>40. For a wide variety of correlation functions, the constant {Phi} is proportional to the square of the amplitude of the surface roughness and is inversely proportional to the square root of the correlation radius. The strong dependence of {Phi} on roughness parameters and the shape of the correlation function opens a novel way for improving the resolution of gravitationally bound states by optimizing the roughness pattern without reverting to an undesirable strong roughness. We discuss how to optimize the scatterer and absorber by first generating numerically the desired roughness profile and then transferring it to the mirror. We also study the effect of beam preparation on the initial occupancies of gravitational states before the beam enters the waveguide. It turns out that there are simple ways to manipulate the beam in front of the waveguide that can help to resolve the gravitationally bound quantum states. Our results are in good agreement with available experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

EXTENDED SCALING LAWS IN NUMERICAL SIMULATIONS OF MAGNETOHYDRODYNAMIC TURBULENCE

Magnetized turbulence is ubiquitous in astrophysical systems, where it notoriously spans a broad range of spatial scales. Phenomenological theories of MHD turbulence describe the self-similar dynamics of turbulent fluctuations in the inertial range of scales. Numerical simulations serve to guide and test these theories. However, the computational power that is currently available restricts the simulations to Reynolds numbers that are significantly smaller than those in astrophysical settings. In order to increase computational efficiency and, therefore, probe a larger range of scales, one often takes into account the fundamental anisotropy of field-guided MHD turbulence, with gradients being much slower in the field-parallel direction. The simulations are then optimized by employing the reduced MHD equations and relaxing the field-parallel numerical resolution. In this work we explore a different possibility. We propose that there exist certain quantities that are remarkably stable with respect to the Reynolds number. As an illustration, we study the alignment angle between the magnetic and velocity fluctuations in MHD turbulence, measured as the ratio of two specially constructed structure functions. We find that the scaling of this ratio can be extended surprisingly well into the regime of relatively low Reynolds number. However, the extended scaling easily becomes spoiled when the dissipation range in the simulations is underresolved. Thus, taking the numerical optimization methods too far can lead to spurious numerical effects and erroneous representation of the physics of MHD turbulence, which in turn can affect our ability to identify correctly the physical mechanisms that are operating in astrophysical systems.

79 ASTRONOMY AND ASTROPHYSICS↗

The 3d stress-tensor bootstrap

Here, we study the conformal bootstrap for 4-point functions of stress tensors in parity-preserving 3d CFTs. To set up the bootstrap equations, we analyze the constraints of conformal symmetry, permutation symmetry, and conservation on the stress-tensor 4-point function and identify a non-redundant set of crossing equations. Studying these equations numerically using semidefinite optimization, we compute bounds on the central charge as a function of the independent coefficient in the stress-tensor 3-point function. With no additional assumptions, these bounds numerically reproduce the conformal collider bounds and give a general lower bound on the central charge. We also study the effect of gaps in the scalar, spin-2, and spin-4 spectra on the central charge bound. We find general upper bounds on these gaps as well as tighter restrictions on the stress-tensor 3-point function coefficients for theories with moderate gaps. When the gap for the leading scalar or spin-2 operator is sufficiently large to exclude large N theories, we also obtain upper bounds on the central charge, thus finding compact allowed regions. Finally, assuming the known low-lying spectrum and central charge of the critical 3d Ising model, we determine its stress-tensor 3-point function and derive a bound on its leading parity-odd scalar.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Modelling of the effect of process parameters on tensile strength of friction stir welded aluminium alloy joints

Friction stir welding (FSW) process is a promising solid-state joining process with the potential to join low-melting point material, particularly, aluminium alloy. The most attractive reason for joining aluminium alloy with this process is the avoidance of the solidification defects formed by conventional fusion welding processes. In this article, an attempt has been made to develop an empirical relationship between FSW variables and tensile strength. Central composite rotatable design was used by considering four factor and five levels, which enables to quantify the direct and interactive effect of four numeric factors, that is, tool rotational speed, welding speed, axial force, and tapered pin diameter on the tensile strength. The developed relationship is useful for prediction of tensile strength in friction stir welded AA6082 aluminium alloy joints at 95% confidence level. It will also be helpful for selection of process variable to obtain desired strength of the joint. Furthermore, the optimized capabilities in design-expert software were used to numerically optimize the input parameters. At the optimal parameters, three experiments were conducted to compare the predicted value of tensile strength with the experimental value.

36 MATERIALS SCIENCE↗

High-order entropy-based closures for linear transport in slab geometry II: A computational study of the optimization problem

We present a numerical algorithm to implement entropy-based (M{sub N}) moment models in the context of a simple, linear kinetic equation for particles moving through a material slab. The closure for these models - as is the case for all entropy-based models - is derived through the solution of constrained, convex optimization problem. The algorithm has two components. The first component is a discretization of the moment equations which preserves the set of realizable moments, thereby ensuring that the optimization problem has a solution (in exact arithmetic). The discretization is a second-order kinetic scheme which uses MUSCL-type limiting in space and a strong-stability-preserving, Runge-Kutta time integrator. The second component of the algorithm is a Newton-based solver for the dual optimization problem, which uses an adaptive quadrature to evaluate integrals in the dual objective and its derivatives. The accuracy of the numerical solution to the dual problem plays a key role in the time step restriction for the kinetic scheme. We study in detail the difficulties in the dual problem that arise near the boundary of realizable moments, where quadrature formulas are less reliable and the Hessian of the dual objection function is highly ill-conditioned. Extensive numerical experiments are performed to illustrate these difficulties. In cases where the dual problem becomes 'too difficult' to solve numerically, we propose a regularization technique to artificially move moments away from the realizable boundary in a way that still preserves local particle concentrations. We present results of numerical simulations for two challenging test problems in order to quantify the characteristics of the optimization solver and to investigate when and how frequently the regularization is needed.

99 GENERAL AND MISCELLANEOUS↗

Design optimization of lightweight automotive seatback through additive manufacturing compression overmolding of metal polymer composites

With the growing demand for enhanced automotive fuel efficiency and environmental sustainability, there is a need for lightweighting automotive components through innovative design and manufacturing processes. Here, this study leverages a combination of numerical iterative design optimization and hybrid additive manufacturing–compression molding (AM-CM) technique for metal polymer composites to lightweight an automotive seatback. The AM-CM process enables robust mechanical interlocking between metals and composites, boasting high stiffness and strength with low overall density. Replacing metallic components with such metal polymer composites allows for comparable mechanical performance while significantly reducing the overall weight. First, the automotive seatback design space is reduced to critical load carrying regions using topology optimization and high stress concentration areas are identified using finite element analysis. Next, a lightweight metal polymer subcomponent is designed for a high stress concentration region. The full seatback frame with spatially heterogeneous material-specific design is then iteratively optimized to enable enhanced stiffness with minimal weight. Overall, the automotive seatback frame designed with location-specific metal, polymer, and metal polymer composite materials weighs 20% less than the metal-only design while exhibiting similar stiffness.

36 MATERIALS SCIENCE↗

A relaxed two-step splitting iteration method for computing PageRank

In this paper, we extend the two-step matrix splitting iteration approach by introducing a new relaxation parameter. The main idea is based on the inner–outer iteration for solving the PageRank problems proposed by Gleich et al. (J Sci Comput 32(1): 349–371, 2010) and Bai (Numer Algebra Cont Optim 2(4): 855–862, 2012) and the two-step splitting iteration presented by Gu et al. (Appl Math Comput 271: 337–343, 2015). The theoretical analysis results show that the proposed method is efficient. Numerical experiments demonstrate that the convergence performances of the method are better than the existing methods.

97 MATHEMATICS AND COMPUTING↗

DPM: A deep learning PDE augmentation method with application to large-eddy simulation

A framework is introduced that leverages known physics to reduce overfitting in machine learning for scientific applications. The partial differential equation (PDE) that expresses the physics is augmented with a neural network that uses available data to learn a description of the corresponding unknown or unrepresented physics. Training within this combined system corrects for missing, unknown, or erroneously represented physics, including discretization errors associated with the PDE's numerical solution. For optimization of the network within the PDE, an adjoint PDE is solved to provide high-dimensional gradients, and a stochastic adjoint method (SAM) further accelerates training. Additionally, the approach is demonstrated for large-eddy simulation (LES) of turbulence. High-fidelity direct numerical simulations (DNS) of decaying isotropic turbulence provide the training data used to learn sub-filter-scale closures for the filtered Navier–Stokes equations. Out-of-sample comparisons show that the deep learning PDE method outperforms widely-used models, even for filter sizes so large that they become qualitatively incorrect. It also significantly outperforms the same neural network when a priori trained based on simple data mismatch, not accounting for the full PDE. Measures of discretization errors, which are well-known to be consequential in LES, point to the importance of the unified training formulation's design, which without modification corrects for them. For comparable accuracy, simulation runtime is significantly reduced. A relaxation of the typical discrete enforcement of the divergence-free constraint in the solver is also successful, instead allowing the DPM to approximately enforce incompressibility physics. Since the training loss function is not restricted to correspond directly to the closure to be learned, training can incorporate diverse data, including experimental data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed Rules-Based Deconfliction of ADMS Applications: Part 1: Requirements & Decomposition

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. This first document introduces the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem is decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. Selection of the optimal number of decompositions of the deconfliction problem should be made based on a tradeoff analysis between computational speed and global optimality. This second document will define an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

Observer-based H{sub ∞} control for nonlinear Markovian jump systems with time-delay and input saturation

This paper focus on the problem of observer-based H{sub ∞} control for uncertain nonlinear Markovian jump systems with time-delay and actuator saturation. A delay-dependent sufficient condition is proposed which guarantees that the uncertain nonlinear Markovian jump system with time-delay and input saturation is stochastically stable via Lyapunov theory and linear matrix inequality (LMI) approach. Then, with this condition, the estimation of stability region and the design method of observer-based H{sub ∞} controller are given by solving LMIs and convex optimization problems. Finally, numerical examples are exploited to illustrate the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Optimal control of anthropogenic carbon dioxide emissions through technological options: a modeling study

The anthropogenic emission of carbon dioxide (CO{sub 2}) is the prime culprit for the menace of global warming. To achieve the goal of mitigation of global warming, it is crucial to curb the anthropogenic carbon dioxide emissions. The prime anthropogenic source of CO{sub 2} is fossil fuel burning. In this paper, we propose a nonlinear mathematical model to study the impact of technological options, used for the reduction of CO{sub 2} emissions from fossil fuel burning and industrial processes, on the control of atmospheric CO{sub 2}. In the modeling process, it is assumed that the technological options are implemented to curb the CO{sub 2} emissions from the source at a rate proportional to the anthropogenic CO{sub 2} emissions. Model analysis reveals that the atmospheric level of CO{sub 2} can be effectively reduced by increasing the implementation rate of technological options and their efficiency. The strategies which optimally reduce atmospheric CO{sub 2} levels while minimizing the cost associated with the implementation of technological options are identified using optimal control theory. Numerical simulation has been carried out to illustrate theoretical results.

54 ENVIRONMENTAL SCIENCES↗

End-to-end protocol for high-quality quantum approximate optimization algorithm parameters with few shots

The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA performance depends crucially on the choice of the parameters. While average-case optimal parameters are available in many cases, meaningful performance gains can be obtained by fine-tuning these parameters for a given instance. This task is especially challenging, however, when the number of circuit executions (shots) is limited. In this work, we develop an end-to-end protocol that combines multiple parameter settings and fine-tuning techniques. We use large-scale numerical experiments to optimize the protocol for the shot-limited setting and observe that optimizers with the simplest internal model (linear) perform best. We implement the optimized pipeline on a trapped-ion processor using up to 32 qubits and 5 QAOA layers, and we demonstrate that the pipeline is robust to small amounts of hardware noise. To the best of our knowledge, these are the largest demonstrations of QAOA parameter fine-tuning on a trapped-ion processor in terms of two-qubit gate count.

quantum algorithms & computation↗