Search NASA⌕ Search

SEARCH · Search NASA

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 721 records · Page 40

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↗

Minimum fuel spacecraft reorientation

Fuel optimal solutions for the reorientation of an inertially symmetric rigid spacecraft with independent 3-axes controls are investigated. All possible optimal control strategies are identified. These include bangbang solutions, finite order singular arcs and infinite order singular arcs. Higher order necessary conditions for optimality of finite order singular arcs are presented. Numerical examples of fuel optimal solutions with fixed maneuver time are presented involving all of the theoretically possible control logics.

Seywald, H.↗

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↗

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗

Global optimality of extremals: An example

The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.

Kreindler, E.↗

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↗

Optimization and analysis of large chemical kinetic mechanisms using the solution mapping method - Combustion of methane

A method of systematic optimization, solution mapping, as applied to a large-scale dynamic model is presented. The basis of the technique is parameterization of model responses in terms of model parameters by simple algebraic expressions. These expressions are obtained by computer experiments arranged in a factorial design. The developed parameterized responses are then used in a joint multiparameter multidata-set optimization. A brief review of the mathematical background of the technique is given. The concept of active parameters is discussed. The technique is applied to determine an optimum set of parameters for a methane combustion mechanism. Five independent responses - comprising ignition delay times, pre-ignition methyl radical concentration profiles, and laminar premixed flame velocities - were optimized with respect to thirteen reaction rate parameters. The numerical predictions of the optimized model are compared to those computed with several recent literature mechanisms. The utility of the solution mapping technique in situations where the optimum is not unique is also demonstrated.

Frenklach, Michael↗

Optimization of the heating surface shape in the contact melting problem

The theoretical analysis of contact melting by the migrating heat source with an arbitrary shaped isothermal heating surface is presented. After the substantiated simplification, the governing equations are transformed to the convenient equations for engineering calculations relationships. Analytical solutions are used for numerical prediction of optimal shape of the heating surface. The problem is investigated for the constant and for temperature dependent physical properties of the melt.

Fomin, Sergei A.↗

Fuselage Boundary Layer Ingestion Propulsion Applied to a Thin Haul Commuter Aircraft for Optimal Efficiency

Theoretical and numerical aspects of aerodynamic efficiency of propulsion systems are studied. Focus is on types of propulsion that closely couples to the aerodynamics of the complete vehicle. We discuss the effects of local flow fields, which are affected both by conservative flow acceleration as well as total pressure losses, on the efficiency of boundary layer immersed propulsion devices. We introduce the concept of a boundary layer retardation turbine that helps reduce skin friction over the fuselage. We numerically investigate efficiency gains offered by boundary layer and wake interacting devices. We discuss the results in terms of a total energy consumption framework and show that efficiency gains offered depend on all the elements of the propulsion system.

Mikic, Gregor Veble↗

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↗