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 361 records · Page 20

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↗

Origins and optimization of entanglement in plasmonically coupled quantum dots

In this paper, a system of two or more quantum dots interacting with a dissipative plasmonic nanostructure is investigated in detail by using a cavity quantum electrodynamics approach with a model Hamiltonian. We focus on determining and understanding system configurations that generate multiple bipartite quantum entanglements between the occupation states of the quantum dots. These configurations include allowing for the quantum dots to be asymmetrically coupled to the plasmonic system. Analytical solution of a simplified limit for an arbitrary number of quantum dots and numerical simulations and optimization for the two- and three-dot cases are used to develop guidelines for maximizing the bipartite entanglements. For any number of quantum dots, we show that through simple starting states and parameter guidelines, one quantum dot can be made to share a strong amount of bipartite entanglement with all other quantum dots in the system, while entangling all other pairs to a lesser degree.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-FG-207B-05: Iterative Reconstruction Via Prior Image Constrained Total Generalized Variation for Spectral CT

Purpose: To investigate iterative reconstruction via prior image constrained total generalized variation (PICTGV) for spectral computed tomography (CT) using fewer projections while achieving greater image quality. Methods: The proposed PICTGV method is formulated as an optimization problem, which balances the data fidelity and prior image constrained total generalized variation of reconstructed images in one framework. The PICTGV method is based on structure correlations among images in the energy domain and high-quality images to guide the reconstruction of energy-specific images. In PICTGV method, the high-quality image is reconstructed from all detector-collected X-ray signals and is referred as the broad-spectrum image. Distinct from the existing reconstruction methods applied on the images with first order derivative, the higher order derivative of the images is incorporated into the PICTGV method. An alternating optimization algorithm is used to minimize the PICTGV objective function. We evaluate the performance of PICTGV on noise and artifacts suppressing using phantom studies and compare the method with the conventional filtered back-projection method as well as TGV based method without prior image. Results: On the digital phantom, the proposed method outperforms the existing TGV method in terms of the noise reduction, artifacts suppression, and edge detail preservation. Compared to that obtained by the TGV based method without prior image, the relative root mean square error in the images reconstructed by the proposed method is reduced by over 20%. Conclusion: The authors propose an iterative reconstruction via prior image constrained total generalize variation for spectral CT. Also, we have developed an alternating optimization algorithm and numerically demonstrated the merits of our approach. Results show that the proposed PICTGV method outperforms the TGV method for spectral CT.

60 APPLIED LIFE SCIENCES↗

Overmoded subterahertz surface wave oscillator with pure TM{sub 01} mode output

Overmoded O-type Cerenkov generators using annular electron beams are facing the problem of multi-modes output due to the inevitable structural discontinuities. A simple but effective method to achieve the pure TM{sub 01} mode output is applied on the 0.14 THz overmoded surface wave oscillator (SWO) in this paper. In spite of still using an overmoded slow wave structure to ensure the easy fabrication, the followed smooth circular waveguide is shrinkingly tapered to the output waveguide with appropriate radius that it cuts off other higher modes except TM{sub 01} mode. Moreover, the modified device here has the same power capacity as the previous one according to the numerical analysis. By optimized lengths of the transition waveguide and tapered waveguide, particle-in-cell simulation results indicate that the subterahertz wave with output power increased 14.2% at the same frequency is obtained from the proposed SWO under the previous input conditions, and importantly, the output power is all carried by TM{sub 01} mode as expected. Further simulation results in the pulse regime confirm the feasibility of the optimized structure in the actual experiments. This simple and viable design is also applicable to overmoded devices in the lower frequency band of subterahertz wave.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Windowed least-squares model reduction for dynamical systems

Here we propose a windowed least-squares (WLS) approach for model reduction of dynamical systems. The proposed approach sequentially minimizes the time-continuous full-order-model residual within a low-dimensional space–time trial subspace over time windows. The approach comprises a generalization of existing model reduction approaches, as particular instances of the methodology recover Galerkin, least-squares Petrov–Galerkin (LSPG), and space–time LSPG projection. In addition, the approach addresses key deficiencies in existing model reduction techniques, e.g., the dependence of LSPG and space–time LSPG projection on the time discretization and the exponential growth in time exhibited by a posteriori error bounds for both Galerkin and LSPG projection. We consider two types of space–time trial subspaces within the proposed approach: one that reduces only the spatial dimension of the full-order model, and one that reduces both the spatial and temporal dimensions of the full-order model. For each type of trial subspace, we consider two different solution techniques: direct (i.e., discretize then optimize) and indirect (i.e., optimize then discretize). Numerical experiments conducted using trial subspaces characterized by spatial dimension reduction demonstrate that the WLS approach can yield more accurate solutions with lower space–time residuals than Galerkin and LSPG projection.

97 MATHEMATICS AND COMPUTING↗

Next-to-leading order Balitsky-Kovchegov equation with resummation

Here, we solve the Balitsky-Kovchegov evolution equation at next-to-leading order accuracy including a resummation of large single and double transverse momentum logarithms to all orders. We numerically determine an optimal value for the constant under the large transverse momentum logarithm that enables including a maximal amount of the full NLO result in the resummation. When this value is used, the contribution from the α 2 s terms without large logarithms is found to be small at large saturation scales and at small dipoles. Close to initial conditions relevant for phenomenological applications, these fixed-order corrections are shown to be numerically important.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Pseudo-spectral method to control three-degree-of-freedom wave energy converters

The invention provides optimal control of a three-degree-of-freedom wave energy converter using a pseudo-spectral control method. The three modes are the heave, pitch and surge. A dynamic model is characterized by a coupling between the pitch and surge modes, while the heave is decoupled. The heave, however, excites the pitch motion through nonlinear parametric excitation in the pitch mode. The invention can use a Fourier series as basis functions to approximate the states and the control. For the parametric excited case, a sequential quadratic programming approach can be implemented to numerically solve for the optimal control. The numerical results show that the harvested energy from three modes is greater than three times the harvested energy from the heave mode alone. Moreover, the harvested energy using a control that accounts for the parametric excitation is significantly higher than the energy harvested when neglecting this nonlinear parametric excitation term.

Abdelkhalik, Ossama↗