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 1,639 records · Page 91

Large‐Area, High‐Numerical‐Aperture, Freeform Metasurfaces

Abstract Nanophotonic devices are optical platforms capable of unprecedented wavefront control. To push the limits of experimental device performance, scalable design methodologies that combine the simplicity and fabricability of conventional design paradigms with the extended capabilities of freeform optimization are required. A novel gradient‐based design framework for large‐area freeform metasurfaces is introduced in which nonlocal interactions between simply shaped nanostructures, placed on an irregular lattice, are tailored to produce high‐order hybridized modes that support customizable large‐angle scattering profiles. Utilizing this approach, multifunctional super‐dispersive metalenses are designed and experimentally demonstrated. The approach to high‐numerical‐aperture radial metalenses capable of diffraction limited focusing and the generation of donut‐shaped point spread functions is also extended. It is anticipated that these concepts will have utility in super‐resolution microscopy, particle trapping, additive manufacturing, and metrology applications that require ultra‐high numerical apertures.

Optics↗

A nonsmooth nonconvex optimization algorithm for two-stage optimization problems

An optimization algorithm for a group of nonsmooth nonconvex problems inspired by two-stage stochastic programming problems is proposed. The main challenges for these problems include (1) the problems lack the popular lower-type properties such as prox-regularity assumed in many nonsmooth nonconvex optimization algorithms, (2) the objective can not be analytically expressed and (3) the evaluation of function values and subgradients are computationally expensive. To address these challenges, this report first examines the properties that exist in many two-stage problems, specifically upper-C 2 objectives. Then, we show that quadratic penalty method for securityconstrained alternating current optimal power flow (SCACOPF) contingency problems can make the contingency solution functions upper-C 2 . Based on these observations, a simplified bundle algorithm that bears similarity to sequential quadratic programming (SQP) method is proposed. It is more efficient in implementation and computation compared to conventional bundle methods. Global convergence analysis of the algorithm is presented under novel and reasonable assumptions. The proposed algorithm therefore fills the gap of theoretical convergence for smoothed SCACOPF problems. The inconsistency that might arise in our treatment of the constraints are addressed through a penalty algorithm whose convergence analysis is also provided. Finally, theoretical capabilities and numerical performance of the algorithm are demonstrated through numerical examples.

97 MATHEMATICS AND COMPUTING↗

Optimal design of acoustic metamaterial cloaks under uncertainty

In this work, we consider the problem of optimal design of an acoustic cloak under uncertainty and develop scalable approximation and optimization methods to solve this problem. The design variable is taken as an infinite-dimensional spatially-varying field that represents the material property, while an additive infinite-dimensional random field represents the variability of the material property or the manufacturing error. Discretization of this optimal design problem results in high-dimensional design variables and uncertain parameters. To solve this problem, we develop a computational approach based on a Taylor approximation and an approximate Newton method for optimization, which is based on a Hessian derived at the mean of the random field. We show our approach is scalable with respect to the dimension of both the design variables and uncertain parameters, in the sense that the necessary number of acoustic wave propagations is essentially independent of these dimensions, for numerical experiments with up to one million design variables and half a million uncertain parameters. Additionally, we demonstrate that, using our computational approach, an optimal design of the acoustic cloak that is robust to material uncertainty is achieved in a tractable manner. The optimal design under uncertainty problem is posed and solved for the classical circular obstacle surrounded by a ring-shaped cloaking region, subjected to both a single-direction single-frequency incident wave and multiple-direction multiple-frequency incident waves. Finally, we apply the method to a deterministic large-scale optimal cloaking problem with complex geometry, to demonstrate that the approximate Newton method’s Hessian computation is viable for large, complex problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse adaptive finite elements for radiative transfer

The linear radiative transfer equation, a partial differential equation for the radiation intensity u(x,s), with independent variables x element of D is contained in R{sup n} in the physical domain D of dimension n=2,3, and angular variable s element of S{sup 2}:={l_brace}y element of R{sup 3}:|y|=1{r_brace}, is solved in the n+2-dimensional computational domain DxS{sup 2}. We propose an adaptive multilevel Galerkin finite element method (FEM) for its numerical solution. Our approach is based on (a) a stabilized variational formulation of the transport operator, (b) on so-called sparse tensor products of two hierarchic families of finite element spaces in H{sup 1}(D) and in L{sup 2}(S{sup 2}), respectively, and (c) on wavelet thresholding techniques to adapt the discretization to the underlying problem. An a priori error analysis shows, under strong regularity assumptions on the solution, that the sparse tensor product method is clearly superior to a discrete ordinates method, as it converges with essentially optimal asymptotic rates while its complexity grows essentially only as that for a linear transport problem in R{sup n}. Numerical experiments for n=2 on a set of example problems agree with the convergence and complexity analysis of the method and show that introducing adaptivity can improve performance in terms of accuracy vs. number of degrees even further.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical methods for instability mitigation in the modeling of laser wakefield accelerators in a Lorentz-boosted frame

Modeling of laser-plasma wakefield accelerators in an optimal frame of reference has been shown to produce orders of magnitude speed-up of calculations from first principles. Obtaining these speedups required mitigation of a high-frequency instability that otherwise limits effectiveness. In this paper, methods are presented which mitigated the observed instability, including an electromagnetic solver with tunable coefficients, its extension to accommodate Perfectly Matched Layers and Friedman's damping algorithms, as well as an efficient large bandwidth digital filter. It is observed that choosing the frame of the wake as the frame of reference allows for higher levels of filtering or damping than is possible in other frames for the same accuracy. Detailed testing also revealed the existence of a singular time step at which the instability level is minimized, independently of numerical dispersion. A combination of the techniques presented in this paper prove to be very efficient at controlling the instability, allowing for efficient direct modeling of 10 GeV class laser plasma accelerator stages. The methods developed in this paper may have broader application, to other Lorentz-boosted simulations and Particle-In-Cell simulations in general.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Efficient photoassociation with a train of asymmetric laser pulses

The photoassociation (PA) dynamics implemented by a train of asymmetric slowly turned-on and rapidly turned-off (STRT) laser pulses is investigated theoretically with Cs{sub 2} as an example. A higher PA efficiency is achieved by optimizing the parameters of the STRT pulse train. The PA reaction goes partly beyond the scope of the PA window. Numerical calculations show that an efficient population accumulation in the PA process can be realized with the STRT laser-pulse train which is available in the current experiment based on laser mode-lock and shaping technology.

74 ATOMIC AND MOLECULAR PHYSICS↗

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗

A MILP-Based Distribution Optimal Power Flow Model for Microgrid Operation

This paper proposes a distribution optimal power flow (D-OPF) model for the operation of microgrids. The proposed model minimizes not only the operating cost, including fuel cost, purchasing cost and demand charge, but also several performance indices, including voltage deviation, network power loss and power factor. It co-optimizes the real and reactive power form distributed generators (DGs) and batteries considering their capacity and power factor limits. The D-OPF is formulated as a mixed-integer linear programming (MILP). Numerical simulation results show the effectiveness of the proposed model.

distributed generators↗

Exact Optimal Power Dispatch in Unbalanced Distribution Systems With High PV Penetration

Smart inverters provide additional control capability to help optimize the operation of distribution systems. This paper proposes a framework for exact optimal active and reactive power dispatch of distributed photovoltaic (PV) generation, switched capacitors, and tap changers in large multi-phase unbalanced distribution systems. The objectives of the optimal dispatch are minimization of the energy loss, PV active power curtailment, and capacitor and tap changer switching operations, in addition to elimination of voltage violations and reverse power flow. The optimization problem is formulated in rectangular coordinates as a nonlinear, nonconvex problem. Effective computational strategies are proposed to allow the application of predictorcorrector primal-dual interior point method to solve optimization problems in real-time with a large number of constraints and variables, including discrete variables corresponding to switched capacitors and tap changers. The accuracy of the numerical solution and the ability to implement the proposed framework are validated using the unbalanced multi-phase IEEE 34-bus and EPRI 2,998-bus distribution systems with 15-minute load and PV data. The results show a significant loss reduction and complete removal of both voltage violations and reverse power flow.

Nguyen, Quan (ORCID:0000000347769557)↗

Optimal white-noise stochastic forcing for linear models of turbulent channel flow

In the present study an optimisation problem is formulated to determine the forcing of an eddy-viscosity-based linearised Navier–Stokes model in channel flow at $Re_\tau \approx 5200$ ( $Re_\tau$ is the friction Reynolds number), where the forcing is white-in-time and spatially decorrelated. The objective functional is prescribed such that the forcing drives a response to best match a set of velocity spectra from direct numerical simulation (DNS), as well as remaining sufficiently smooth. Strong quantitative agreement is obtained between the velocity spectra from the linear model with optimal forcing and from DNS, but only qualitative agreement between the Reynolds shear stress co-spectra from the model and DNS. The forcing spectra exhibit a level of self-similarity, associated with the primary peak in the velocity spectra, but they also reveal a non-negligible amount of energy spent in phenomenologically mimicking the non-self-similar part of the velocity spectra associated with energy cascade. By exploiting linearity, the effect of the individual forcing components is assessed and the contributions from the Orr mechanism and the lift-up effect are also identified. Finally, the effect of the strength of the eddy viscosity on the optimisation performance is investigated. The inclusion of the eddy viscosity diffusion operator is shown to be essential in modelling of the near-wall features, while still allowing the forcing of the self-similar primary peak. In particular, reducing the strength of the eddy viscosity results in a considerable increase in the near-wall forcing of wall-parallel components.

Mechanics↗

Absorption of charged particles in perfectly matched layers by optimal damping of the deposited current

Perfectly matched layers (PMLs) are widely used in particle-in-cell simulations, in order to absorb electromagnetic waves that propagate out of the simulation domain. However, when charged particles cross the interface between the simulation domain and the PMLs, a number of numerical artifacts can arise. Here, in order to mitigate these artifacts, we introduce a PML algorithm whereby the current deposited by the macroparticles in the PML is damped by an analytically derived optimal coefficient. The benefits of this algorithm are illustrated in practical simulations. In particular, it is shown that this algorithm is well suited for particles exiting the box in near-normal incidence, in the sense that the fields behave as if the exiting particle is propagating in an infinite vacuum.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Collection of low-grade waste heat for enhanced energy harvesting

Enhanced energy harvesting through the collection of low-grade waste heat is experimentally demonstrated. A structural optimization technique is exploited in the design of a thermal-composite substrate to guide and gather the heat emanating from multiple sources to a predetermined location. A thermoelectric generator is then applied at the selected focusing region to convert the resulting low-grade waste heat to electrical power. The thermal characteristics of the device are experimentally verified by direct temperature measurements of the system and numerically validated via heat conduction simulations. Electrical performance under natural and forced convection is measured, and in both cases, the device with optimized heat flow control plus energy harvesting demonstrates increased power generation when compared with a baseline waste heat recovery system. Electronics applications include energy scavenging for autonomously powered sensor networks or self-actuated devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Remote quantification of Cm(III) and HNO 3 by fluorescence spectroscopy and chemometrics

A unique approach to remotely quantify Cm(III) (0–100 µg mL −1 ) in HNO 3 (1–12 M) using steady-state laser fluorescence spectroscopy and multivariate regression models was developed. Photoluminescence is amenable to remote measurements using fiber-optic cables and is sensitive to numerous lanthanide and actinide species. In-line measurements can provide feedback to support complex processing in harsh environments (e.g., hot cells) to help guide and optimize radiochemical separations. In this work, Cm(III) spectra were acquired remotely in a glove box as a function of HNO 3 concentration to better understand spectral characteristics and evaluate the utility of multivariate regression models in this system. Furthermore, the Cm(III) fluorescence peak shape, width, position, and intensity changed significantly as a function of HNO 3 concentration, likely because of the displacement of emission quenching inner-sphere water molecules and complexation with nitrate ions. Despite significant covariance and nonlinearity in the data, a D-optimal design strategy successfully minimized training set sample size and was used to build effective partial least squares regression models for Cm(III) and HNO 3 concentrations without a priori knowledge of solution conditions. Chemometrics for modeling complex fluorescence spectra are promising and may find widespread applicability for online analysis in numerous chemical systems found in the nuclear field.

Actinide↗

Multi-Level Optimal Power Flow Solver in Large Distribution Networks: Preprint

Solving optimal power flow (OPF) problem for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution networks of tree topology with deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multi-level implementation of the primal-dual gradient algorithm for solving the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verifies that the proposed algorithm can significantly improve computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Multilevel Monte Carlo Estimators For Derivative-Free Optimization Under Uncertainty

Optimization is a key tool for scientific and engineering applications; however, in the presence of models affected by uncertainty, the optimization formulation needs to be extended to consider statistics of the quantity of interest. Optimization under uncertainty (OUU) deals with this endeavor and requires uncertainty quantification analyses at several design locations; i.e., its overall computational cost is proportional to the cost of performing a forward uncertainty analysis at each design location. An OUU workflow has two main components: an inner loop strategy for the computation of statistics of the quantity of interest, and an outer loop optimization strategy tasked with finding the optimal design, given a merit function based on the inner loop statistics. Here, in this work, we propose to alleviate the cost of the inner loop uncertainty analysis by leveraging the so-called multilevel Monte Carlo (MLMC) method, which is able to allocate resources over multiple models with varying accuracy and cost. The resource allocation problem in MLMC is formulated by minimizing the computational cost given a target variance for the estimator. We consider MLMC estimators for statistics usually employed in OUU workflows and solve the corresponding allocation problem. For the outer loop, we consider a derivative-free optimization strategy implemented in the SNOWPAC library; our novel strategy is implemented and released in the Dakota software toolkit. We discuss several numerical test cases to showcase the features and performance of our approach with respect to its Monte Carlo single fidelity counterpart.

97 MATHEMATICS AND COMPUTING↗

Multistage distributionally robust mixed-integer programming with decision-dependent moment-based ambiguity sets

We study multistage distributionally robust mixed-integer programs under endogenous uncertainty, where the probability distribution of stage-wise uncertainty depends on the decisions made in previous stages. We first consider two ambiguity sets defined by decision-dependent bounds on the first and second moments of uncertain parameters and by mean and covariance matrix that exactly match decision-dependent empirical ones, respectively. For both sets, we show that the subproblem in each stage can be recast as a mixed-integer linear program (MILP). Moreover, we extend the general moment-based ambiguity set in to the multistage decision-dependent setting, and derive mixed-integer semidefinite programming (MISDP) reformulations of stage-wise subproblems. We develop methods for attaining lower and upper bounds of the optimal objective value of the multistage MISDPs, and approximate them using a series of MILPs. We deploy the Stochastic Dual Dynamic integer Programming (SDDiP) method for solving the problem under the three ambiguity sets with risk-neutral or risk-averse objective functions, and conduct numerical studies on multistage facility-location instances having diverse sizes under different parameter and uncertainty settings. Furthermore, our results show that the SDDiP quickly finds optimal solutions for moderate-sized instances under the first two ambiguity sets, and also finds good approximate bounds for the multistage MISDPs derived under the third ambiguity set. We also demonstrate the efficacy of incorporating decision-dependent distributional ambiguity in multistage decision-making processes.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Unified Differential Evolution Algorithm for Global Optimization

In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

43 PARTICLE ACCELERATORS↗

Optimization of dynamic aperture for hadron lattices in eRHIC

The potential upgrade of the Relativistic Heavy Ion Collider (RHIC) to an electron ion collider (eRHIC) involves numerous extensive changes to the existing collider complex. The expected very high luminosity is planned to be achieved at eRHIC with the help of squeezing the beta function of the hadron ring at the IP to a few cm, causing a large rise of the natural chromaticities and thus bringing with it challenges for the beam long term stability (Dynamic aperture). We present our effort to expand the DA by carefully tuning the nonlinear magnets thus controlling the size of the footprints in tune space and all lower order resonance driving terms. We show a reasonably large DA through particle tracking over millions of turns of beam revolution.

43 PARTICLE ACCELERATORS↗