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,495 records · Page 83

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗

Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer

We solve a multi-period portfolio optimization problem using D-Wave Systems' quantum annealer. We derive a formulation of the problem, discuss several possible integer encoding schemes, and present numerical examples that show high success rates. The formulation incorporates transaction costs (including permanent and temporary market impact), and, significantly, the solution does not require the inversion of a covariance matrix. The discrete multi-period portfolio optimization problem we solve is significantly harder than the continuous variable problem. We present insight into how results may be improved using suitable software enhancements and why current quantum annealing technology limits the size of problem that can be successfully solved today. Here, the formulation presented is specifically designed to be scalable, with the expectation that as quantum annealing technology improves, larger problems will be solvable using the same techniques.

97 MATHEMATICS AND COMPUTING↗

Mathematical efficiency calibration with uncertain source geometries using smart optimization

The In Situ Object Counting Software (ISOCS), a mathematical method developed by CANBERRA, is a well established technique for computing High Purity Germanium (HPGe) detector efficiencies for a wide variety of source shapes and sizes. In the ISOCS method, the user needs to input the geometry related parameters such as: the source dimensions, matrix composition and density, along with the source-to-detector distance. In many applications, the source dimensions, the matrix material and density may not be well known. Under such circumstances, the efficiencies may not be very accurate since the modeled source geometry may not be very representative of the measured geometry. CANBERRA developed an efficiency optimization software known as 'Advanced ISOCS' that varies the not well known parameters within user specified intervals and determines the optimal efficiency shape and magnitude based on available benchmarks in the measured spectra. The benchmarks could be results from isotopic codes such as MGAU, MGA, IGA, or FRAM, activities from multi-line nuclides, and multiple counts of the same item taken in different geometries (from the side, bottom, top etc). The efficiency optimization is carried out using either a random search based on standard probability distributions, or using numerical techniques that carry out a more directed (referred to as 'smart' in this paper) search. Measurements were carried out using representative source geometries and radionuclide distributions. The radionuclide activities were determined using the optimum efficiency and compared against the true activities. The 'Advanced ISOCS' method has many applications among which are: Safeguards, Decommissioning and Decontamination, Non-Destructive Assay systems and Nuclear reactor outages maintenance. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimization of micropillar sequences for fluid flow sculpting

Inertial fluid flow deformation around pillars in a microchannel is a new method for controlling fluid flow. Sequences of pillars have been shown to produce a rich phase space with a wide variety of flow transformations. Previous work has successfully demonstrated manual design of pillar sequences to achieve desired transformations of the flow cross section, with experimental validation. However, such a method is not ideal for seeking out complex sculpted shapes as the search space quickly becomes too large for efficient manual discovery. We explore fast, automated optimization methods to solve this problem. We formulate the inertial flow physics in microchannels with different micropillar configurations as a set of state transition matrix operations. These state transition matrices are constructed from experimentally validated streamtraces for a fixed channel length per pillar. This facilitates modeling the effect of a sequence of micropillars as nested matrix-matrix products, which have very efficient numerical implementations. With this new forward model, arbitrary micropillar sequences can be rapidly simulated with various inlet configurations, allowing optimization routines quick access to a large search space. We integrate this framework with the genetic algorithm and showcase its applicability by designing micropillar sequences for various useful transformations. We computationally discover micropillar sequences for complex transformations that are substantially shorter than manually designed sequences. We also determine sequences for novel transformations that were difficult to manually design. Finally, we experimentally validate these computational designs by fabricating devices and comparing predictions with the results from confocal microscopy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments

Here, we present a novel stochastic approach to binary optimization suited for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality criterion, is cast into a stochastic objective function in the form of an expectation over a multivariate Bernoulli distribution. The probabilistic objective is then solved by using a stochastic optimization routine to find an optimal observational policy. This formulation (a) is generally applicable to binary optimization problems with soft constraints and is ideal for OED and sensor placement problems; (b) does not require differentiability of the original objective function (e.g., a utility function in OED applications) with respect to the design variable, and thus it enables direct employment of sparsity-enforcing penalty functions such as $\ell_0$, without needing to utilize a continuation procedure or apply a rounding technique; (c) exhibits much lower computational cost than traditional gradient-based relaxation approaches; and (d) can be applied to both linear and nonlinear OED problems with proper choice of the utility function. The proposed approach is analyzed from an optimization perspective with detailed convergence analysis of the optimization approach and is also analyzed from a machine learning perspective with correspondence to policy gradient reinforcement learning. The approach is demonstrated numerically by using an idealized two-dimensional Bayesian linear inverse problem and validated by extensive numerical experiments carried out for sensor placement in a parameter identification setup.

97 MATHEMATICS AND COMPUTING↗

Prediction of Cutting Forces Using ANNs Approach in Hard Turning of AISI 52100 steel

In this study, artificial neural networks (ANNs) was used to predict cutting forces in the case of machining the hard turning of AISI 52100 bearing steel using cBN cutting tool. Cutting forces evolution is considered as the key factors which affect machining. Predicting cutting forces evolution allows optimizing machining by an adaptation of cutting conditions. In this context, it seems interesting to study the contribution that could have artificial neural networks (ANNs) on the machining forces prediction in both numerical and experiment studies. Feed-forward multi-layer neural networks trained by the error back-propagation (BP) algorithm are used. Levenberg-Marquardt (LM) optimization algorithm was used for finding out weights. The training of the network is carried out with experimental machining data.The input dataset used are cutting speed, feed rate, cutting depth and hardness of the material. The output dataset used are cutting forces (Ft-cutting force, Fa- feed force and Fr- radial force).Results of the neural networks approach, in comparison with experimental data are discussed in last part of this paper.

36 MATERIALS SCIENCE↗

CFL Optimized Forward–Backward Runge–Kutta Schemes for the Shallow-Water Equations

Abstract We present the formulation and optimization of a Runge–Kutta-type time-stepping scheme for solving the shallow-water equations, aimed at substantially increasing the effective allowable time step over that of comparable methods. This scheme, called FB-RK(3,2), uses weighted forward–backward averaging of thickness data to advance the momentum equation. The weights for this averaging are chosen with an optimization process that employs a von Neumann–type analysis, ensuring that the weights maximize the admittable Courant number. Through a simplified local truncation error analysis and numerical experiments, we show that the method is at least second-order in time for any choice of weights and exhibits low dispersion and dissipation errors for well-resolved waves. Further, we show that an optimized FB-RK(3,2) can take time steps up to 2.8 times as large as a popular three-stage, third-order strong stability-preserving Runge–Kutta method in a quasi-linear test case. In fully nonlinear shallow-water test cases relevant to oceanic and atmospheric flows, FB-RK(3,2) outperforms SSPRK3 in admittable time step by factors roughly between 1.6 and 2.2, making the scheme approximately twice as computationally efficient with little to no effect on solution quality. Significance Statement The purpose of this work is to develop and optimize time-stepping schemes for models relevant to oceanic and atmospheric flows. Specifically, for the shallow-water equations we optimize for schemes that can take time steps as large as possible while retaining solution quality. We find that our optimized schemes can take time steps between 1.6 and 2.2 times larger than schemes that cost the same number of floating point operations, translating directly to a corresponding speedup. Our ultimate goal is to use these schemes in climate-scale simulations.

54 ENVIRONMENTAL SCIENCES↗

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗

Spectral Formulation for the Solution of Full-Wave Scattering from a Conducting Wedge Tipped with a Corrugated Cylinder

A spectral mode-matching technique is formulated to solve for the full-wave scattering of a corrugated cylinder-tipped wedge in the presence of an impressed electric or magnetic line source. Asymptotic approximations of large-order Bessel or Henkel functions for a fixed argument were introduced in order to overcome numerical difficulties in their regular series expansions. The corrugations on the conducting cylinder have the shape of annular sectors. The primary objective of this work is to investigate the impact of corrugations on the scattered field in the shadow region of the structure. An optimally designed corrugated cylinder placed at the tip of a conducting wedge can effectively suppress electromagnetic scattering in the shadow region. Obtained numerical results using the proposed approach prove the above concept. These results were validated against numerical data obtained using a nodal finite element method. The aim of this research is to utilize these corrugated tips in horn antenna design for the reduction of side-lobe level and the shaping of the respective E-plane radiation pattern.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Higher-order triangular spectral element method with optimized cubature points for seismic wavefield modeling

The mass-lumped method avoids the cost of inverting the mass matrix and simultaneously maintains spatial accuracy by adopting additional interior integration points, known as cubature points. To date, such points are only known analytically in tensor domains, such as quadrilateral or hexahedral elements. Thus, the diagonal-mass-matrix spectral element method (SEM) in non-tensor domains always relies on numerically computed interpolation points or quadrature points. However, only the cubature points for degrees 1 to 6 are known, which is the reason that we have developed a p-norm-based optimization algorithm to obtain higher-order cubature points. In this way, we obtain and tabulate new cubature points with all positive integration weights for degrees 7 to 9. The dispersion analysis illustrates that the dispersion relation determined from the new optimized cubature points is comparable to that of the mass and stiffness matrices obtained by exact integration. Simultaneously, the Lebesgue constant for the new optimized cubature points indicates its surprisingly good interpolation properties. As a result, such points provide both good interpolation properties and integration accuracy. The Courant–Friedrichs–Lewy (CFL) numbers are tabulated for the conventional Fekete-based triangular spectral element (TSEM), the TSEM with exact integration, and the optimized cubature-based TSEM (OTSEM). A complementary study demonstrates the spectral convergence of the OTSEM. A numerical example conducted on a half-space model demonstrates that the OTSEM improves the accuracy by approximately one order of magnitude compared to the conventional Fekete-based TSEM. In particular, the accuracy of the 7th-order OTSEM is even higher than that of the 14th-order Fekete-based TSEM. Furthermore, the OTSEM produces a result that can compete in accuracy with the quadrilateral SEM (QSEM). The high accuracy of the OTSEM is also tested with a non-flat topography model. In terms of computational efficiency, the OTSEM is more efficient than the Fekete-based TSEM, although it is slightly costlier than the QSEM when a comparable numerical accuracy is required. - Highlights: • Higher-order cubature points for degrees 7 to 9 are developed. • The effects of quadrature rule on the mass and stiffness matrices has been conducted. • The cubature points have always positive integration weights. • Freeing from the inversion of a wide bandwidth mass matrix. • The accuracy of the TSEM has been improved in about one order of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Energy enhancement of proton acceleration in combinational radiation pressure and bubble by optimizing plasma density

The combinational laser radiation pressure and plasma bubble fields to accelerate protons are researched through theoretical analysis and numerical simulations. The dephasing length of the accelerated protons bunch in the front of the bubble and the density gradient effect of background plasma on the accelerating phase are analyzed in detail theoretically. The radiation damping effect on the accelerated protons energy is also considered. And it is demonstrated by two-dimensional particle-in-cell simulations that the protons bunch energy can be increased by using the background plasma with negative density gradient. However, radiation damping makes the maximal energy of the accelerated protons a little reduction.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optimal Collinear Gaussian Beams for Spontaneous Parametric Down-Conversion

I investigate the properties of spontaneous parametric down-conversion (SPDC) involving co-linear Gaussian spatial modes for the pump and the photon collection optics. Approximate analytical and numerical results are obtained for the peak spectral density, photon bandwidth, pair collection probability, heralding ratio, and spectral purity, as a function of crystal length and beam focusing parameters. I address the optimization of these properties individually as well as jointly, and find focusing conditions that simultaneously bring the pair collection probability, heralding ratio, and spectral purity to near-optimal values. These properties are also found to be nearly scale invariant, that is, ultimately independent of crystal length. The results obtained here are expected to be useful for designing SPDC sources with high performance in multiple categories for the next generation of SPDC applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sensitivity of thermodynamic profiles retrieved from ground-based microwave and infrared observations to additional input data from active remote sensing instruments and numerical weather prediction models

Accurate and continuous estimates of the thermodynamic structure of the lower atmosphere are highly beneficial to meteorological process understanding and its applications, such as weather forecasting. In this study, the Tropospheric Remotely Observed Profiling via Optimal Estimation (TROPoe) physical retrieval is used to retrieve temperature and humidity profiles from various combinations of input data collected by passive and active remote sensing instruments, in situ surface platforms, and numerical weather prediction models. Among the employed instruments are microwave radiometers (MWRs), infrared spectrometers (IRSs), radio acoustic sounding systems (RASSs), ceilometers, and surface sensors. TROPoe uses brightness temperatures and/or radiances from MWRs and IRSs, as well as other observational inputs (virtual temperature from the RASS, cloud-base height from the ceilometer, pressure, temperature, and humidity from the surface sensors) in a physical iterative retrieval approach. This starts from a climatologically reasonable profile of temperature and water vapor, with the radiative transfer model iteratively adjusting the assumed temperature and humidity profiles until the derived brightness temperatures and radiances match those observed by the MWR and/or IRS instruments within a specified uncertainty, as well as within the uncertainties of the other observations, if used as input. In this study, due to the uniqueness of the dataset that includes all the above-mentioned sensors, TROPoe is tested with different observational input combinations, some of which also include information higher than 4 km above ground level (a.g.l.) from the operational Rapid Refresh numerical weather prediction model. These temperature and humidity retrievals are assessed against independent collocated radiosonde profiles under non-cloudy conditions to assess the sensitivity of the TROPoe retrievals to different input combinations.

54 ENVIRONMENTAL SCIENCES↗

Stochastic growth logistic model with aftereffect for batch fermentation process

In this paper, the stochastic growth logistic model with aftereffect for the cell growth of C. acetobutylicum P262 and Luedeking-Piret equations for solvent production in batch fermentation system is introduced. The parameters values of the mathematical models are estimated via Levenberg-Marquardt optimization method of non-linear least squares. We apply Milstein scheme for solving the stochastic models numerically. The effciency of mathematical models is measured by comparing the simulated result and the experimental data of the microbial growth and solvent production in batch system. Low values of Root Mean-Square Error (RMSE) of stochastic models with aftereffect indicate good fits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of deformable image registration accuracy using computational modeling

Computer aided modeling of anatomic deformation, allowing various techniques and protocols in radiation therapy to be systematically verified and studied, has become increasingly attractive. In this study the potential issues in deformable image registration (DIR) were analyzed based on two numerical phantoms: One, a synthesized, low intensity gradient prostate image, and the other a lung patient's CT image data set. Each phantom was modeled with region-specific material parameters with its deformation solved using a finite element method. The resultant displacements were used to construct a benchmark to quantify the displacement errors of the Demons and B-Spline-based registrations. The results show that the accuracy of these registration algorithms depends on the chosen parameters, the selection of which is closely associated with the intensity gradients of the underlying images. For the Demons algorithm, both single resolution (SR) and multiresolution (MR) registrations required approximately 300 iterations to reach an accuracy of 1.4 mm mean error in the lung patient's CT image (and 0.7 mm mean error averaged in the lung only). For the low gradient prostate phantom, these algorithms (both SR and MR) required at least 1600 iterations to reduce their mean errors to 2 mm. For the B-Spline algorithms, best performance (mean errors of 1.9 mm for SR and 1.6 mm for MR, respectively) on the low gradient prostate was achieved using five grid nodes in each direction. Adding more grid nodes resulted in larger errors. For the lung patient's CT data set, the B-Spline registrations required ten grid nodes in each direction for highest accuracy (1.4 mm for SR and 1.5 mm for MR). The numbers of iterations or grid nodes required for optimal registrations depended on the intensity gradients of the underlying images. In summary, the performance of the Demons and B-Spline registrations have been quantitatively evaluated using numerical phantoms. The results show that parameter selection for optimal accuracy is closely related to the intensity gradients of the underlying images. Also, the result that the DIR algorithms produce much lower errors in heterogeneous lung regions relative to homogeneous (low intensity gradient) regions, suggests that feature-based evaluation of deformable image registration accuracy must be viewed cautiously.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Optimization and Prediction of Spectral Response of Metasurfaces Using Artificial Intelligence

Hot-electron generation has been a topic of intense research for decades for numerous applications ranging from photodetection and photochemistry to biosensing. Recently, the technique of hot-electron generation using non-radiative decay of surface plasmons excited by metallic nanoantennas, or meta-atoms, in a metasurface has attracted attention. These metasurfaces can be designed with thicknesses on the order of the hot-electron diffusion length. The plasmonic resonances of these ultrathin metasurfaces can be tailored by changing the shape and size of the meta-atoms. One of the fundamental mechanisms leading to generation of hot-electrons in such systems is optical absorption, therefore, optimization of absorption is a key step in enhancing the performance of any metasurface based hot-electron device. Here we utilized an artificial intelligence-based approach, the genetic algorithm, to optimize absorption spectra of plasmonic metasurfaces. Using genetic algorithm optimization strategies, we designed a polarization insensitive plasmonic metasurface with 90% absorption at 1550 nm that does not require an optically thick ground plane. We fabricated and optically characterized the metasurface and our experimental results agree with simulations. Finally, we present a convolutional neural network that can predict the absorption spectra of metasurfaces never seen by the network, thereby eliminating the need for computationally expensive simulations. Our results suggest a new direction for optimizing hot-electron based photodetectors and sensors.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗

Towards Robustness Guarantees for Feedback-Based Optimization

Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the robustness properties have been observed both in simulation and experimental results, the theoretical analysis in the literature is mostly limited to nominal conditions. In this work, we propose a framework to systematically assess the robust stability of feedback-based online optimization algorithms. We leverage tools from monotone operator theory, variational inequalities and classical robust control to obtain tractable numerical tests that guarantee robust convergence properties of online algorithms in feedback with a physical system, even in the presence of disturbances and model uncertainty. The results are illustrated via an academic example and a case study of a power distribution system.

approximation algorithms↗