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 91 records · Page 5

Numerical Homogenization on Approach for Stokesian Suspensions

In this technical report we investigate efficient methods for numerical simulation of active suspensions. The prototypical system is a suspension of swimming bacteria in a Newtonian fluid. Rheological and other macroscopic properties of such suspensions can differ dramatically from the same properties of the suspending fluid alone or of suspensions of similar but inactive particles. Elongated bacteria, such as E. coli or B. subtilis, swim along their principal axis, propelling themselves with the help of flagella, attached at the anterior of the organism and pushing it forward in the manner of a propeller. They interact hydrodynamically with the surrounding fluid and, because of their asymmetrical shape, have the propensity to align with the local flow. This, along with the dipolar nature of bacteria (the two forces a bacterium exerts on a fluid - one due to self-propulsion and the other opposing drag - have equal magnitude and point in opposite directions), causes nearby bacteria to tend to align, resulting in a intermittent local ordering on the mesoscopic scale, which is between the microscopic scale of an individual bacterium and the macroscopic scale of the suspension (e.g., its container). The local ordering is sometimes called a collective mode or collective swimming. Thanks to self-propulsion, collective modes inject momentum into the fluid in a coherent way. This enhances the local strain rate without changing the macroscopic stress applied at the boundary of the container. The macroscopic effective viscosity of the suspension is defined roughly as the ratio of the applied stress to the bulk strain rate. If local alignment and therefore local strain-rate enhancement, are significant, the effective viscosity can be appreciably lower than that of the corresponding passive suspension or even of the surrounding fluid alone. Indeed, a sevenfold decrease in the effective viscosity was observed in experiments with B. subtilis. More generally, local collective swimming resulting from bacterial alignment can significantly alter other macroscopic properties of the suspension, such as the oxygen diffusivity and mixing rates. In order to understand the unique macroscopic properties of active suspensions the connection between microscopic swimming and alignment dynamics and the mesoscopic pattern formation must be clarified. This is difficult to do analytically in the fully general setting of moderately dense suspensions, because of the large number of bacteria involved (approx. 10 10 cm -3 in experiments) and the complex, time-dependent geometry of the system. Many reduced analytical models of bacterial have been proposed, but all of them require validation. While comparison with experiment is the ultimate test of a model's fidelity, it is difficult to conduct experiments matched to these models assumptions. Numerical simulation of the microscopic dynamics is an acceptable substitute, but it runs into the problem of having to discretize the fluid domain with a fine-grained boundary (the bacteria) and update the discretization as the domain evolves (bacteria move). This leads to a prohibitively high number of degrees of freedom and prohibitively high setup costs per timestep of simulation. In this technical report we propose numerical methods designed to alleviate these two difficulties. We indicate how to (1) construct an optimal discretization in terms of the number of degrees of freedom per digit of accuracy and (2) optimally update the discretization as the simulation evolves. The technical tool here is the derivation of rigorous error bounds on the error in the numerical solution when using our proposed discretization at the initial time as well as after a given elapsed simulation time. These error bounds should guide the construction of practical discretization schemes and update strategies. Our initial construction is carried out by using a theoretically convenient, but practically prohibitive spectral basis, which is a Galerkin basis of functions with global support. At the end of this report we propose localization techniques while maintaining acceptable error bounds. No numerical experiments were conducted as part of this study, but we envision that we may undertake such studies and further development of the method, jointly or individually.

60 APPLIED LIFE SCIENCES↗

First-Order System Least Squares for the Stokes Equations, with Application to Linear Elasticity

Following our earlier work on general second-order scalar equations, here we develop a least-squares functional for the two- and three-dimensional Stokes equations, generalized slightly by allowing a pressure term in the continuity equation. By introducing a velocity flux variable and associated curl and trace equations, we are able to establish ellipticity in an H(exp 1) product norm appropriately weighted by the Reynolds number. This immediately yields optimal discretization error estimates for finite element spaces in this norm and optimal algebraic convergence estimates for multiplicative and additive multigrid methods applied to the resulting discrete systems. Both estimates are uniform in the Reynolds number. Moreover, our pressure-perturbed form of the generalized Stokes equations allows us to develop an analogous result for the Dirichlet problem for linear elasticity with estimates that are uniform in the Lame constants.

Cai, Z.↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-level adaptive computations in fluid dynamics

The multi-level adaptive technique (MLAT) is a general strategy of solving continuous problems by cycling between coarser and finer levels of discretization. It provides very fast solvers together with adaptive, nearly optimal discretization schemes to general boundary-value problems in general domains. Here the state of the art is surveyed, emphasizing steady-state fluid dynamics applications, from slow viscous flows to transonic ones. Various new techniques are briefly discussed, including distributive relaxation schemes, the treatment of evolution problems, the combined use of upstream and central differencing, local truncation extrapolations, and other 'super-solver' techniques.

Brandt, A.↗

SU-F-BRD-13: Quantum Annealing Applied to IMRT Beamlet Intensity Optimization

Purpose: We report on the first application of quantum annealing (QA) to the process of beamlet intensity optimization for IMRT. QA is a new technology, which employs novel hardware and software techniques to address various discrete optimization problems in many fields. Methods: We apply the D-Wave Inc. proprietary hardware, which natively exploits quantum mechanical effects for improved optimization. The new QA algorithm, running on this hardware, is most similar to simulated annealing, but relies on natural processes to directly minimize the free energy of a system. A simple quantum system is slowly evolved into a classical system, representing the objective function. To apply QA to IMRT-type optimization, two prostate cases were considered. A reduced number of beamlets were employed, due to the current QA hardware limitation of ∼500 binary variables. The beamlet dose matrices were computed using CERR, and an objective function was defined based on typical clinical constraints, including dose-volume objectives. The objective function was discretized, and the QA method was compared to two standard optimization Methods: simulated annealing and Tabu search, run on a conventional computing cluster. Results: Based on several runs, the average final objective function value achieved by the QA was 16.9 for the first patient, compared with 10.0 for Tabu and 6.7 for the SA. For the second patient, the values were 70.7 for the QA, 120.0 for Tabu, and 22.9 for the SA. The QA algorithm required 27–38% of the time required by the other two methods. Conclusion: In terms of objective function value, the QA performance was similar to Tabu but less effective than the SA. However, its speed was 3–4 times faster than the other two methods. This initial experiment suggests that QA-based heuristics may offer significant speedup over conventional clinical optimization methods, as quantum annealing hardware scales to larger sizes.

07 ISOTOPE AND RADIATION SOURCES↗

Software For Integer Programming

Improved Exploratory Search Technique for Pure Integer Linear Programming Problems (IESIP) program optimizes objective function of variables subject to confining functions or constraints, using discrete optimization or integer programming. Enables rapid solution of problems up to 10 variables in size. Integer programming required for accuracy in modeling systems containing small number of components, distribution of goods, scheduling operations on machine tools, and scheduling production in general. Written in Borland's TURBO Pascal.

Fogle, F. R.↗

Multi-Level Adaptive Techniques (MLAT) for singular-perturbation problems

The multilevel (multigrid) adaptive technique, a general strategy of solving continuous problems by cycling between coarser and finer levels of discretization is described. It provides very fast general solvers, together with adaptive, nearly optimal discretization schemes. In the process, boundary layers are automatically either resolved or skipped, depending on a control function which expresses the computational goal. The global error decreases exponentially as a function of the overall computational work, in a uniform rate independent of the magnitude of the singular-perturbation terms. The key is high-order uniformly stable difference equations, and uniformly smoothing relaxation schemes.

Brandt, A.↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Application of A Dual-Quaternion Six Degree-of-Freedom Guidance to Human-Scale Mars Entry, Descent, and Landing

Landing humans on Mars comes with many challenges, including the execution of a safe and precise entry, descent, and landing (EDL) sequence. Various NASA studies have shown that there are a variety of EDL guidance methods that potentially offer solutions to the human-scale EDL precision landing problem and work is ongoing to assess new and novel methods. As part of these ongoing studies, a dual-quaternion-based six degree-of-freedom guidance algorithm was implemented in the Program to Optimize Simulated Trajectories II (POST2), a NASA-and industry-standard spacecraft trajectory and vehicle design tool. This algorithm considers both translational and rotational dynamics and casts the trajectory optimization problem as a quadratically constrained quadratic program (QCQP) with various constraints at discrete nodes throughout the trajectory. The QCQP problem is solved via an alternating direction method of multipliers (ADMM) approach, and the output is a discretized optimal trajectory. The guidance is applied to a NASA reference human-scale Mars EDL system, and results are compared and discussed.

Optimization↗

Space–Time Least-Squares Petrov–Galerkin Projection for Nonlinear Model Reduction

This work proposes a space--time least-squares Petrov--Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply (Petrov--)Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space--time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space--time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted $\ell^2$-norm. This norm can be defined to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space--time collocation and space--time Gauss--Newton with Approximated Tensors (GNAT) variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov--Galerkin projection include a reduction of both the spatial and temporal dimensions of the dynamical system, and a priori error bounds that bound the solution error by the best space--time approximation error and whose stability constants exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy for a fixed spatio-temporal discretization.

97 MATHEMATICS AND COMPUTING↗

Space-time least-squares Petrov-Galerkin projection in nonlinear model reduction.

Our work proposes a space-time least-squares Petrov-Galerkin (ST-LSPG) projection method for model reduction of nonlinear dynamical systems. In contrast to typical nonlinear model-reduction methods that first apply Petrov-Galerkin projection in the spatial dimension and subsequently apply time integration to numerically resolve the resulting low-dimensional dynamical system, the proposed method applies projection in space and time simultaneously. To accomplish this, the method first introduces a low-dimensional space-time trial subspace, which can be obtained by computing tensor decompositions of state-snapshot data. The method then computes discrete-optimal approximations in this space-time trial subspace by minimizing the residual arising after time discretization over all space and time in a weighted ℓ 2 -norm. This norm can be de ned to enable complexity reduction (i.e., hyper-reduction) in time, which leads to space-time collocation and space-time GNAT variants of the ST-LSPG method. Advantages of the approach relative to typical spatial-projection-based nonlinear model reduction methods such as Galerkin projection and least-squares Petrov-Galerkin projection include: (1) a reduction of both the spatial and temporal dimensions of the dynamical system, (2) the removal of spurious temporal modes (e.g., unstable growth) from the state space, and (3) error bounds that exhibit slower growth in time. Numerical examples performed on model problems in fluid dynamics demonstrate the ability of the method to generate orders-of-magnitude computational savings relative to spatial-projection-based reduced-order models without sacrificing accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

First-Order System Least-Squares for the Navier-Stokes Equations

This paper develops a least-squares approach to the solution of the incompressible Navier-Stokes equations in primitive variables. As with our earlier work on Stokes equations, we recast the Navier-Stokes equations as a first-order system by introducing a velocity flux variable and associated curl and trace equations. We show that the resulting system is well-posed, and that an associated least-squares principle yields optimal discretization error estimates in the H(sup 1) norm in each variable (including the velocity flux) and optimal multigrid convergence estimates for the resulting algebraic system.

Bochev, P.↗

From Physics Model to Results: An Optimizing Framework for Cross-Architecture Code Generation

Starting from a high-level problem description in terms of partial differential equations using abstract tensor notation, the Chemora framework discretizes, optimizes, and generates complete high performance codes for a wide range of compute architectures. Chemora extends the capabilities of Cactus, facilitating the usage of large-scale CPU/GPU systems in an efficient manner for complex applications, without low-level code tuning. Chemora achieves parallelism through MPI and multi-threading, combining OpenMP and CUDA. Optimizations include high-level code transformations, efficient loop traversal strategies, dynamically selected data and instruction cache usage strategies, and JIT compilation of GPU code tailored to the problem characteristics. The discretization is based on higher-order finite differences on multi-block domains. Chemora's capabilities are demonstrated by simulations of black hole collisions. This problem provides an acid test of the framework, as the Einstein equations contain hundreds of variables and thousands of terms.

Blazewicz, Marek↗

Optimal Membrane Cascade Design for Critical Mineral Recovery Through Logic-based Superstructure Optimization

Critical minerals and rare earth elements play an important role in our climate change initiatives, particularly in applications related with energy storage. Here, we use discrete optimization approaches to design a process for the recovery of Lithium and Cobalt from battery recycling, through membrane separation. Our contribution involves proposing a Generalized Disjunctive Programming (GDP) model for the optimal design of a multistage diafiltration cascade for Li-Co separation. By solving the resulting nonconvex mixed-integer nonlinear program model to global optimality, we investigated scalability and solution quality variations with changes in the number of stages and elements per stage. Results demonstrate the computational tractability of the nonlinear GDP formulation for design of membrane separation processes while opening the door for decom-position strategies for multicomponent separation cascades. Future work aims to extend the GDP formulation to account for stage installation and explore various decomposition techniques to enhance solution efficiency.

Ovalle, Daniel↗

Optimal Design of Grid-Stiffened Composite Panels Using Global and Local Buckling Analysis

A design strategy for optimal design of composite grid-stiffened panels subjected to global and local buckling constraints is developed using a discrete optimizer. An improved smeared stiffener theory is used for the global buckling analysis. Local buckling of skin segments is assessed using a Rayleigh-Ritz method that accounts for material anisotropy and transverse shear flexibility. The local buckling of stiffener segments is also assessed. Design variables are the axial and transverse stiffener spacing, stiffener height and thickness, skin laminate, and stiffening configuration. The design optimization process is adapted to identify the lightest-weight stiffening configuration and pattern for grid stiffened composite panels given the overall panel dimensions, design in-plane loads, material properties, and boundary conditions of the grid-stiffened panel.

Ambur, Damodar R.↗

Optimizing Proprotor Blades Using Coupled Aeroacoustic and Aerodynamic Sensitivities

A quieter and aerodynamically more efficient proprotor design requires high-fidelity and well-integrated optimization and analysis tools. To fulfill that requirement, the present paper delivers a methodology based on multidisciplinary, adjoint-based, discrete optimization. SU2-based code development involves the implementation of aeroacoustic analysis, adjoint computations, and integrations into a multidisciplinary rotorcraft optimization suite. Submodules utilized in the optimization are verified with wind tunnel data to demonstrate the accuracy of aerodynamic and aeroacoustic analyses. The developed code is used for NASA's helically twisted proprotor to maximize the aeroacoustic performance of the proprotor while holding thrust constant. The optimization process considers multiple flight conditions (hence, multipoint), which are forward flight and hovering. As an outcome of the analyses, the optimized blade design propagates lower noise as perceived by multiple observers in both flight conditions

R Omur Icke↗