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 793 records · Page 44

Multidisciplinary design optimization in Architecture, Engineering, and Construction: a detailed review and call for collaboration

The design of buildings has become a complex and multidisciplinary problem involving multiple conflicting objectives as architects and designers address competing technical, economic, environmental, and societal concerns. This has been driving research in Architecture, Engineering, and Construction (AEC) toward rigorous multidisciplinary decision-making frameworks that generate and evaluate numerous design alternatives using multi-objective optimization in concert with simulation and analysis models of varying fidelity and computational expense. While such frameworks are well known and widely employed in the aerospace and systems engineering domains, efforts by design professionals and researchers in the AEC field are scattered at best. In this paper, we provide a detailed review of recent developments in optimization frameworks in the AEC field and subsequently highlight how such developments are largely compartmentalized into separate domains such as structural, energy, daylighting, and other performance factors. Herein, we further discuss the technical challenges involved in concurrent coupled multidisciplinary design optimization (MDO) in the AEC field such as interoperability issues between Building Information Modeling (BIM) environments, analysis/simulation tools, and optimization frameworks. We conclude by outlining research needed for more unified modeling and simulation-based optimization frameworks to aid in complex and multidisciplinary building design processes. We also highlight the need for the identification and development of multi-fidelity simulation tools for use across multiple design phases. As such, this paper contributes a novel roadmap to leverage aerospace and systems engineering research in MDO into the field of AEC, along with a call for researchers in the MDO community to seek collaborations in AEC field.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE site remedial management optimization utilizing on the cloud computing systems - 15676

Environmental cleanups at complex sites necessarily address many competing demands and answer questions such as: 'What is the best way and in a sustainable manner to minimize risk to human health and the environment during active restoration efforts and/or long term legacy management, while incorporating parameter uncertainty, management considerations, and stakeholder concerns into the process?' Physics Based Management Optimization (PBMO{sup TM}) provides a means to answer such questions. 'Physics Based' indicates incorporation of numerically computed groundwater flow and transport processes into the analysis. This enables optimal remedy design based on comprehensive mass removal/destruction metrics and optimal monitoring strategies. 'Management Optimization' indicates the ability to incorporate objective functions (e.g., management constraints, sustainability considerations) into the evaluation. PBMO{sup TM} components have been successfully implemented for optimal plume delineation (points of compliance) and monitoring, for optimal system design and to optimize existing active treatment systems in the US at multiple DOE, DOD and industrial sites since the mid 1990's. PBMO{sup TM} has been recently extended and implemented on multi-core, multi-CPU grid computing systems including computational clusters, local area networks and the Cloud. This extension allows for increased flexibility and adaptation of computational resources which can now support optimal remedy design and long term management strategies for complex soil and groundwater sites. In the PBMO{sup TM} -Grid case study, we evaluate flow and transport for a typical optimization search for a realistic project against sequential optimization. PBMO{sup TM}-Grid reduces the CPU time required to solve the optimization problem by more than a factor of 14 X compared to sequential optimization. PBMO{sup TM}-Grid can be deployed for deterministic or stochastic optimization and formally computes design risk and predicted degree of remedial action success. The numerical models used can consist of a single 'mega' model (aka a monolith), or a mixture of models and other calculations or expert systems. PBMO{sup T}M-Grid integrates the computational models in a seamless manner, and models run on the Cloud can be implemented in Windows or Linux platforms. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Light-trapping optimization in wet-etched silicon photonic crystal solar cells

We demonstrate, by numerical solution of Maxwell's equations, near-perfect solar light-trapping and absorption over the 300–1100 nm wavelength band in silicon photonic crystal (PhC) architectures, amenable to fabrication by wet-etching and requiring less than 10 μm (equivalent bulk thickness) of crystalline silicon. These PhC's consist of square lattices of inverted pyramids with sides comprised of various (111) silicon facets and pyramid center-to-center spacing in the range of 1.3–2.5 μm. For a wet-etched slab with overall height H = 10 μm and lattice constant a = 2.5 μm, we find a maximum achievable photo-current density (MAPD) of 42.5 mA/cm{sup 2}, falling not far from 43.5 mA/cm{sup 2}, corresponding to 100% solar absorption in the range of 300–1100 nm. We also demonstrate a MAPD of 37.8 mA/cm{sup 2} for a thinner silicon PhC slab of overall height H = 5 μm and lattice constant a = 1.9 μm. When H is further reduced to 3 μm, the optimal lattice constant for inverted pyramids reduces to a = 1.3 μm and provides the MAPD of 35.5 mA/cm{sup 2}. These wet-etched structures require more than double the volume of silicon, in comparison to the overall mathematically optimum PhC structure (consisting of slanted conical pores), to achieve the same degree of solar absorption. It is suggested these 3–10 μm thick structures are valuable alternatives to currently utilized 300 μm-thick textured solar cells and are suitable for large-scale fabrication by wet-etching.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗

Optimisation of the blank shape for micro deep drawing of rectangular parts

In this investigation the blank shape for micro deep drawing of rectangular parts was for the first time optimized using FEM method with consideration of the real process conditions in micro forming, i.e. the coefficient of friction and the flow curves of thin foils. The acquired optimized blank shape was then validated by applying it to experiments. For both numerical and experimental investigations a punch with a section of 2x1 mm{sup 2} was used. Aluminum Al99.5 with a sheet thickness of 20 {mu}m was used as blank material in this investigation. A flange free drawn part was successfully obtained from experiment using the blank shape and blank holder force optimized using FEM.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Diabatic error and propagation of Majorana zero modes in interacting quantum dots systems

Motivated by recent experimental progress in realizing Majorana zero modes (MZMs) using quantum dot systems, we investigate the diabatic errors associated with the movement of those MZMs. The movement is achieved by tuning time-dependent gate potentials applied to individual quantum dots, effectively creating a moving potential wall. To probe the optimized movement of MZMs, we calculate the experimentally accessible time-dependent fidelity and local density-of-states using many-body time-dependent numerical methods. Furthermore, our analysis reveals that an optimal potential wall height is crucial to preserve the well-localized nature of the MZM during its movement. Moreover, we analyze diabatic errors in realistic quantum-dot systems, incorporating the effects of repulsive Coulomb interactions and disorder in both hopping and pairing terms. Additionally, we provide a comparative study of diabatic errors arising from the simultaneous versus sequential tuning of multiple gates during the MZMs movement. Finally, we estimate the timescale required for MZM transfer in a six-quantum-dot system, demonstrating that MZM movement is feasible and can be completed well within the qubit's operational lifetime in practical quantum-dot setups.

Density of states↗

Utilizing a Novel Acoustic Backscatter Array to Characterize Waste Consolidation and Settling in a Horizontal Flow Clarifier - 16051

As part of a collaboration between the University of Leeds, Sellafield Ltd and MMI Engineering Ltd, bespoke acoustic instrumentation and numerical simulation methods have been established to optimize nuclear legacy waste transfers. Specifically, a new ultrasonic measurement system has been developed, allowing suspended particle concentration and consolidation to be measured remotely. This technology has been combined with computational fluid dynamics (CFD) modelling of settling particulate systems, permitting full characterization, simulation and prediction of sludge separation processes. Presented here are experimental and numerical results on the transport and settling behavior of non-active nuclear-analogue suspensions in two flow geometries: gravitational settling of glass dispersions in a 250-liter column; and transport and sedimentation of flocculated calcite in a close-to-full-scale clarifier (9 m{sup 3} total volume and 4.8 m{sup 2} length). In addition, details of the design, construction and calibration of a custom-built Ultrasonic Array Research Platform (UARP) are described. Settling column results suggested that particle concentration changes could be simulated with good accuracy by a CFD model (developed using the open source OpenFOAM framework) when compared to measured samples. Large-scale clarifier trials were used to assess the effectiveness of the UARP controller with an attached in situ acoustic backscatter array (ABA). The ABA consisted of 8 transducers angled down at 20 deg. to the vertical, pulsing at 2-2.5 MHz in cycles (covering 1.8 m total depth). In comparison to a range of sampled concentrations across the length of the clarifier, results confirmed that the UARP-ABA system was highly successful at characterizing these complex flows over several hours of operation, allowing visualization of depth-wise bulk density changes and bed build-up over time. Collectively, this work highlights the capability of these tools to monitor and optimize a number of current waste transfer operations at Sellafield, with further potential applications for solid-liquid separations across waste, water treatment and minerals engineering industries. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Optimal block-tridiagonalization of matrices for coherent charge transport

Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. The reordered Hamiltonian can lead to significant performance gains in transport calculations, and allows to apply conventional two-terminal algorithms to arbitrarily complex geometries, including multi-terminal structures. The block-tridiagonalization algorithm can thus be the foundation for a generic quantum transport code, applicable to arbitrary tight-binding systems. We demonstrate the power of this approach by applying the block-tridiagonalization algorithm together with the recursive Green's function algorithm to various examples of mesoscopic transport in two-dimensional electron gases in semiconductors and graphene.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A holey cavity for single-transducer 3D ultrasound imaging with physical optimization

Within the compressive sensing (CS) framework, one effective way to increase the likelihood of successful signal reconstruction is to employ random processes in the construction of the sensing matrix. This work presents a 3D holey cavity, with diverse frequency modes, to spectrally code, that is, randomize, the ultrasound wave fields. The simulated results show that the use of such a cavity enables imaging simple or complex targets, such as spheres or the letter E, by only a single transceiver—something that is not possible without the use of a coding structure like the cavity. The effect of noise on imaging results and the size of the targets on the first-order Born approximation (BA) are also investigated. Moreover, this study attempts to optimize the cavity, based on a single numerical metric, such as the sum of singular values (SSV) or mutual coherence (MC). Yet, it will be shown that neither of these metrics can consistently compare the norm-one imaging performance between two cavities of different materials or hole sizes. This leaves finding a quantitative metric for these kinds of optimizations an open problem.

42 ENGINEERING↗

J-variational inequalities and zeroes of a family of maximal monotone operators by sunny generalized nonexpansive retraction

In this paper, using generalized resolvents and retractions onto shrinking closed subsets, we present new extragradient algorithms for finding the solution of a J-variational-like inequality, the zero points of a family of maximal monotone operators, and the solution set of mixed equilibrium problems for a J-α-inverse-strongly monotone-like operator in a 2-uniformly convex and 2-uniformly smooth Banach space. By introducing the new definitions, we prove strong convergence of generated iterates in the extragradient methods. Using FMINCON optimization toolbox in MATLAB, we give some numerical examples and compare them with several existence results in the literature to illustrate the usability of our results.

97 MATHEMATICS AND COMPUTING↗

Flattening of the EFT-hedron: supersymmetric positivity bounds and the search for string theory

We examine universal positivity constraints on 2 → 2 scattering in 4d planar N = 4 supersymmetric Yang-Mills theory with higher-derivative corrections. We present numerical evidence that the convex region of allowed Wilson coefficients (the “EFT-hedron”) flattens completely along about one-third of its dimensions when an increasing number of constraints on the spectral density from crossing-symmetry are included. Our analysis relies on the formulation of the positivity constraints as a linear optimization problem, which we implement using two numerical solvers, SDPB and CPLEX. Motivated by the flattening, we propose a novel partially resummed low-energy expansion of the 2 → 2 amplitude. As part of the analysis, we provide additional evidence in favor of the conjecture [1] that the Veneziano amplitude is the only amplitude compatible with both S-matrix bootstrap constraints and string monodromy.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Lax-Oleinik-Type Formulas and Efficient Algorithms for Certain High-Dimensional Optimal Control Problems

Two of the main challenges in optimal control are solving problems with state-dependent running costs and developing efficient numerical solvers that are computationally tractable in high dimension. In this paper, we provide analytical solutions to certain optimal control problems whose running cost depends on the state variable and with constraints on the control. We also provide Lax-Oleinik-type representation formulas for the corresponding Hamilton-Jacobi partial differential equations with state-dependent Hamiltonians. Additionally, we present an efficient, grid-free numerical solver based on our representation formulas, which is shown to scale linearly with the state dimension, and thus, to overcome the curse of dimensionality. Using existing optimization methods and the min-plus technique, we extend our numerical solvers to address more general classes of convex and nonconvex initial costs. We demonstrate the capabilities of our numerical solvers using implementations on a central processing unit (CPU) and a field-programmable gate array (FPGA). In several cases, our FPGA implementation obtains over a 10 times speedup compared to the CPU, which demonstrates the promising performance boosts FPGAs can achieve. Furthermore, our numerical results show that our solvers have the potential to serve as a building block for solving broader classes of high-dimensional optimal control problems in real-time.

97 MATHEMATICS AND COMPUTING↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Two-Dimensional Non-Linear Magnetic Equivalent Circuit Model to Facilitate the Preliminary Design of a Normal Conducting Quadrupole

Normal conducting quadrupoles have been used to focus charged particle beams in synchrotrons, beam transfer lines, medical linacs, etc. for a long time. Optimization techniques based on analytical expressions combined with the use of a numerical field analysis tool exist in the literature for the design of an optimal pole tip shape. However, the initial shape and dimensions of the remaining yoke (including the pole itself and yoke base that act as the return path) are usually less well defined. This article discusses a design methodology for a normal conducting quadrupole based on a two-dimensional magnetic equivalent circuit. Here, this approach considers the geometry of the entire magnet and the non-linear behavior of the yoke material, thereby eliminating the initial iterations. The design outcome of this exercise serves as a competent starting point and can then be used to refine the pole tip, pole taper, yoke size, and add other geometrical features to achieve the required field quality, gradient, coil considerations, etc. by employing a finite element analysis tool. An example design study to demonstrate the proposed methodology is presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Adaptive anisotropic meshing for steady convection-dominated problems

Obtaining accurate solutions for convection–diffusion equations is challenging due to the presence of layers when convection dominates the diffusion. To solve this problem, we design an adaptive meshing algorithm which optimizes the alignment of anisotropic meshes with the numerical solution. Three main ingredients are used. First, the streamline upwind Petrov–Galerkin method is used to produce a stabilized solution. Second, an adapted metric tensor is computed from the approximate solution. Third, optimized anisotropic meshes are generated from the computed metric tensor by an anisotropic centroidal Voronoi tessellation algorithm. Our algorithm is tested on a variety of two-dimensional examples and the results shows that the algorithm is robust in detecting layers and efficient in avoiding non-physical oscillations in the numerical approximation.

97 MATHEMATICS AND COMPUTING↗

Non-linear dynamic characteristics and optimal control of giant magnetostrictive film subjected to in-plane stochastic excitation

The non-linear dynamic characteristics and optimal control of a giant magnetostrictive film (GMF) subjected to in-plane stochastic excitation were studied. Non-linear differential items were introduced to interpret the hysteretic phenomena of the GMF, and the non-linear dynamic model of the GMF subjected to in-plane stochastic excitation was developed. The stochastic stability was analysed, and the probability density function was obtained. The condition of stochastic Hopf bifurcation and noise-induced chaotic response were determined, and the fractal boundary of the system's safe basin was provided. The reliability function was solved from the backward Kolmogorov equation, and an optimal control strategy was proposed in the stochastic dynamic programming method. Numerical simulation shows that the system stability varies with the parameters, and stochastic Hopf bifurcation and chaos appear in the process; the area of the safe basin decreases when the noise intensifies, and the boundary of the safe basin becomes fractal; the system reliability improved through stochastic optimal control. Finally, the theoretical and numerical results were proved by experiments. The results are helpful in the engineering applications of GMF.

36 MATERIALS SCIENCE↗