Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “merit function”

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 37 records · Page 2

Impact of shorter wavelengths on optical quality for laws

This study explores parametrically as a function of wavelength the degrading effects of several common optical aberrations (defocus, astigmatism, wavefront tilts, etc.), using the heterodyne mixing efficiency factor as the merit function. A 60 cm diameter aperture beam expander with an expansion ratio of 15:1 and a primary mirror focal ratio of f/2 was designed for the study. An HDOS copyrighted analysis program determined the value of merit function for various optical misalignments. With sensitivities provided by the analysis, preliminary error budget and tolerance allocations were made for potential optical wavefront errors and boresight errors during laser shot transit time. These were compared with the baseline l.5 m CO2 LAWS and the optical fabrication state of the art (SOA) as characterized by the Hubble Space Telescope. Reducing wavelength and changing optical design resulted in optical quality tolerances within the SOA both at 2 and 1 micrometers. However, advanced sensing and control devices would be necessary to maintain on-orbit alignment. Optical tolerance for maintaining boresight stability would have to be tightened by a factor of 1.8 for a 2 micrometers system and by 3.6 for a 1 micrometers system relative to the baseline CO2 LAWS. Available SOA components could be used for operation at 2 micrometers but operation at 1 micrometers does not appear feasible.

Wissinger, Alan B.↗

Wideband dichroic-filter design for LED-phosphor beam-combining

A general method is disclosed of designing two-component dichroic short-pass filters operable for incidence angle distributions over the 0-30.degree. range, and specific preferred embodiments are listed. The method is based on computer optimization algorithms for an N-layer design, specifically the N-dimensional conjugate-gradient minimization of a merit function based on difference from a target transmission spectrum, as well as subsequent cycles of needle synthesis for increasing N. A key feature of the method is the initial filter design, upon which the algorithm proceeds to iterate successive design candidates with smaller merit functions. This initial design, with high-index material H and low-index L, is (0.75 H, 0.5 L, 0.75 H)^m, denoting m (20-30) repetitions of a three-layer motif, giving rise to a filter with N=2 m+1.

36 MATERIALS SCIENCE↗

Using Approximations to Accelerate Engineering Design Optimization

Optimization problems that arise in engineering design are often characterized by several features that hinder the use of standard nonlinear optimization techniques. Foremost among these features is that the functions used to define the engineering optimization problem often are computationally intensive. Within a standard nonlinear optimization algorithm, the computational expense of evaluating the functions that define the problem would necessarily be incurred for each iteration of the optimization algorithm. Faced with such prohibitive computational costs, an attractive alternative is to make use of surrogates within an optimization context since surrogates can be chosen or constructed so that they are typically much less expensive to compute. For the purposes of this paper, we will focus on the use of algebraic approximations as surrogates for the objective. In this paper we introduce the use of so-called merit functions that explicitly recognize the desirability of improving the current approximation to the objective during the course of the optimization. We define and experiment with the use of merit functions chosen to simultaneously improve both the solution to the optimization problem (the objective) and the quality of the approximation. Our goal is to further improve the effectiveness of our general approach without sacrificing any of its rigor.

Torczon, Virginia↗

Inverse Design of a Graphene-Based Quantum Transducer via Neuroevolution

Here we introduce an inverse design framework based on artificial neural networks, genetic algorithms, and tight-binding calculations, capable to optimize the very large configuration space of nanoelectronic devices. Our non-linear optimization procedure operates on trial Hamiltonians through superoperators controlling growth policies of regions of distinct doping. We demonstrate that our algorithm optimizes the doping of graphene-based three-terminal devices for valleytronics applications, monotonously converging to synthesizable devices with high merit functions in a few thousand evaluations (out of similar or equal to ≃ 2 3800 possible configurations). The best-performing device allowed for a terminal-specific separation of valley currents with similar or equal to ≃ 96% (≃ 94%) K(K') valley purity. Importantly, the devices found through our non-linear optimization procedure have both a higher merit function and higher robustness to defects than the ones obtained through geometry optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Report of the subpanel on resampling functions

The state of the art and anticipated requirements for resampling in applications of remote sensing are examined. It is noted that the wide range of potential applications and expanded needs for resampling versatility in new imaging sensors leads to a concern for creating standardized test data sets and ground training sites. Several research areas are defined including the development of (1) a theory for defining an input psf of an instrument such that upon resampling of the processed data into the desired output grid the radiometric and geometric properties are a best estimate of the true upwelling radiances; (2) algorithms for estimating missing data or for ignoring missing data; (3) optimal resampling functions; (4) standard data sets; and (5) merit functions for assessing resampling techniques.

Source record↗

OSA Spotlight Summary: Designing Miniature X-ray Optics for the SmallSat Lunar Science Mission Concept CubeX

The scientific demand for extended field X-Ray remote sensing for mapping of planetary bodies has produced the CubeSat X-ray Telescope (CubeX) lunar mission concept. Orbiting the Moon at 6,000 km for 1 year sometime during the mid-decade solar maximum, the primary objectives of CubeX are to map lunar surface elemental abundances and to assess feasibility of x-ray pulsar timing navigation. CubeX’s Miniature X-ray Optics (MiXO) design builds on heritage of existing X-ray imaging designs using new electroformed NiCo alloy replication (ENR) to create shells of 1 mm thickness. MiXO will provide 1 arcmin resolution X-Ray imaging for an extended instantaneous field of view, at various energy range sensitivities. Based on the classic Wolter-Type I design (using a paraboloid/hyperboloid grazing mirror pair), mirror parameters were expanded to allow both shell length and focal-plane offsets to vary independently. The design was optimized with a merit function that factored together four sub-merits: PSF sharpness (measured as half-power diameter), consistency across the field, minimized scattering, and maximized effective area. Monte Carlo analysis was used to predict final performance, including surface scatter effects. The demonstrated configurations include a compact 34 shell design with a diameter of 105 mm more efficient at higher energies, and a larger 130 mm/24 shell version with a larger overall effective area at lower energies. The compact design carries more expensive fabrication and assembly cost (with more shells) as well as a more challenging alignment (with denser packing). Both have overall resolution <1’ up to 26’ off-axis and <1.5’ up to 33’ off-axis, whereas a conventional design’s image quality degrades quickly beyond 15’ off-axis. This opens up new possibilities for future SmallSat missions that could use two different configurations for wide energy ranges or midsized instruments using multiple identical modules for larger collecting area.

x-ray↗

Top Ten Blendstocks For Turbocharged Gasoline Engines: Bioblendstocks With Potential to Deliver the for Highest Engine Efficiency

More efficient engines enabled by better fuels derived from biomass could increase the fuel economy of the light duty (LD) fleet by 10% over current technology and planned developments. This report identifies top LD boosted spark ignition (BSI) biofuel candidates for further development and commercialization identified using a fuel property basis. The BSI merit function was used to evaluate the performance of candidate bio-blendstocks in improving engine efficiency. This report is aimed at biofuel researchers looking to better understand the efficiency implications of biofuels under development, as well as engine researchers who are interested in future biofuels with properties that enable more efficient engine design and operation.

09 BIOMASS FUELS↗

A Machine Learning-Genetic Algorithm (ML-GA) Approach for Rapid Optimization Using High-Performance Computing

A Machine Learning-Genetic Algorithm (ML-GA) approach was developed to virtually discover optimum designs using training data generated from multi-dimensional simulations. Machine learning (ML) presents a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. In the present work, a total of over 2000 sector-mesh computational fluid dynamics (CFD) simulations of a heavy-duty engine were performed. These were run concurrently on a supercomputer to reduce overall turnaround time. The engine being optimized was run on a low-octane (RON70) gasoline fuel under partially premixed compression ignition (PPCI) mode. A total of nine input parameters were varied, and the CFD simulation cases were generated by randomly sampling points from this nine-dimensional input space. These input parameters included fuel injection strategy, injector design, and various in-cylinder flow and thermodynamic conditions at intake valve closure (IVC). The outputs (targets) of interest from these simulations included five metrics related to engine performance and emissions. Over 2000 samples generated from CFD were then used to train an ML model that could predict these five targets based on the nine input features. A robust super learner approach was employed to build the ML model, where results from a collection of different ML algorithms were pooled together. Thereafter, a stochastic global optimization genetic algorithm (GA) was used, with the ML model as the objective function, to optimize the input parameters based on a merit function so as to minimize fuel consumption while satisfying CO and NOx emissions constraints. The optimized configuration from ML-GA was found to be very close to that obtained from a sequentially performed CFD-GA approach, where a CFD simulation served as the objective function. In addition, the overall turnaround time was (at least) 75% lower with the ML-GA approach, as the training data was generated from concurrent CFD simulations and employing the ML model as the objective function significantly accelerated the GA optimization. Finally, this study demonstrates the potential of ML-GA and high-performance computing (HPC) to reduce the number of CFD simulations to be performed for optimization problems without loss in accuracy, thereby providing significant cost savings compared to traditional approaches.

97 MATHEMATICS AND COMPUTING↗

A parallel trajectory optimization tool for aerospace plane guidance

A parallel trajectory optimization algorithm is being developed. One possible mission is to provide real-time, on-line guidance for the National Aerospace Plane. The algorithm solves a discrete-time problem via the augmented Lagrangian nonlinear programming algorithm. The algorithm exploits the dynamic programming structure of the problem to achieve parallelism in calculating cost functions, gradients, constraints, Jacobians, Hessian approximations, search directions, and merit functions. Special additions to the augmented Lagrangian algorithm achieve robust convergence, achieve (almost) superlinear local convergence, and deal with constraint curvature efficiency. The algorithm can handle control and state inequality constraints such as angle-of-attack and dynamic pressure constraints. Portions of the algorithm have been tested. The nonlinear programming core algorithm performs well on a variety of static test problems and on an orbit transfer problem. The parallel search direction algorithm can reduce wall clock time by a factor of 10 for this part of the computation task.

Psiaki, Mark L.↗

A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions

We study an unconstrained minimization approach to the generalized complementarity problem GCP(f, g) based on the generalized Fischer-Burmeister function and its generalizations when the underlying functions are C{sup 1}. Also, we show how, under appropriate regularity conditions, minimizing the merit function corresponding to f and g leads to a solution of the generalized complementarity problem. Moreover, we propose a descent algorithm for GCP(f, g) and show a result on the global convergence of a descent algorithm for solving generalized complementarity problem. Finally, we present some preliminary numerical results. Our results further give a unified/generalization treatment of such results for the nonlinear complementarity problem based on generalized Fischer-Burmeister function and its generalizations.

97 MATHEMATICS AND COMPUTING↗

A Damped Gauss-Newton Method for the Second-Order Cone Complementarity Problem

We investigate some properties related to the generalized Newton method for the Fischer-Burmeister (FB) function over second-order cones, which allows us to reformulate the second-order cone complementarity problem (SOCCP) as a semismooth system of equations. Specifically, we characterize the B-subdifferential of the FB function at a general point and study the condition for every element of the B-subdifferential at a solution being nonsingular. In addition, for the induced FB merit function, we establish its coerciveness and provide a weaker condition than Chen and Tseng (Math. Program. 104:293-327, 2005) for each stationary point to be a solution, under suitable Cartesian P-properties of the involved mapping. By this, a damped Gauss-Newton method is proposed, and the global and superlinear convergence results are obtained. Numerical results are reported for the second-order cone programs from the DIMACS library, which verify the good theoretical properties of the method.

97 MATHEMATICS AND COMPUTING↗

ALTSched: Improved Scheduling for Time-domain Science with LSST

Abstract Telescope scheduling is the task of determining the best sequence of observations (pointings and filter choices) for a survey system. Because it is computationally intractable to optimize over all possible multiyear sequences of observations, schedulers use heuristics to pick the best observation at a given time. A greedy scheduler selects the next observation by choosing whichever one maximizes a scalar merit function, which serves as a proxy for the scientific goals of the telescope. This sort of bottom-up approach for scheduling is not guaranteed to produce a schedule for which the sum of merit over all observations is maximized. As an alternative to greedy schedulers, we introduce ALTS ched, which takes a top-down approach to scheduling. Instead of considering only the next observation, ALTS ched makes global decisions about which area of sky and which filter to observe in, and then refines these decisions into a sequence of observations taken along the meridian to minimize airmass. We implement ALTS ched for the Large Synoptic Survey Telescope (LSST) and show that it equals or outperforms the baseline greedy scheduler in essentially all quantitative performance metrics. Due to its simplicity, our implementation is considerably faster than O p S im , the simulated greedy scheduler currently used by the LSST Project: a full 10-yr survey can be simulated in 4 minutes, as opposed to tens of hours for O p S im . LSST’s hardware is fixed, so improving the scheduling algorithm is one of the only remaining ways to optimize LSST’s performance. We see ALTS ched as a prototype scheduler that gives a lower bound on the performance achievable by LSST.

79 ASTRONOMY AND ASTROPHYSICS↗

Data-driven chemical kinetic reaction mechanism for F-24 jet fuel ignition

A data-driven chemical kinetic mechanism for the military version of Jet A, F-24, is developed for numerical simulations of the ignition process. The main purpose of this study is to obtain a practical F-24 mechanism across wide temperature and equivalence ratio ranges, with a particular focus on the negative temperature coefficient and low temperature regions. The new mechanism (ARLMech-HC-F24) is based on the HyChem model of a similar fuel and optimized using a micro-genetic algorithm against an experimental ignition delay data set of the target fuel. The development and optimization processes include reaction selection, population creation, shuffled tournament implementation based on a merit function, and child-individual creation for the next generation. Several techniques and parameters are proposed to generate an accurate mechanism through an efficient process. The newly introduced data-driven mechanism based on these techniques shows better merit value convergence and represents the ignition behavior more accurately than that without the techniques. This practical mechanism is suitable for the numerical simulations of the F-24 or Jet A ignition problem, and the suggested strategies can be employed in similar problems of rate coefficients estimation.

42 ENGINEERING↗

A practical globalization of one-shot optimization for optimal design of tokamak divertors

In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FUNDAMENTAL PERFORMANCE OF A DISPERSED FIXED DELAY INTERFEROMETER IN SEARCHING FOR PLANETS AROUND M DWARFS

We present a new method to calculate fundamental Doppler measurement limits with a dispersed fixed delay interferometer (DFDI) in the near-infrared (NIR) wavelength region for searching for exoplanets around M dwarfs in the coming decade. It is based on calculating the Q factor, a measure of flux-normalized Doppler sensitivity in the fringing spectra created with DFDI. We calculate the Q factor as a function of spectral resolution R, stellar-projected rotational velocity Vsin i, stellar effective temperature T{sub eff}, and optical path difference (OPD) of the interferometer. We also compare the DFDI Q factor to that for the popular cross-dispersed echelle spectrograph method (the direct echelle (DE) method). We find that (1) Q{sub DFDI} is a factor of 1.5-3 higher than Q{sub DE} at R ranging from 5000 to 20,000; (2) Q{sub DFDI} and Q{sub DE} converge at a very high R (R {>=} 100,000); (3) Q{sub DFDI} increases as R increases and Vsin i deceases; (4) for a given R, Q{sub DFDI} increases as T{sub eff} drops from 3100 K to 2400 K (M4V to M9V). We also investigate how Q{sub DFDI} is affected by OPD and find that a 5 mm deviation from the optimal OPD does not significantly affect Q{sub DFDI} (10% or less) for a wide range of R. Given that the NIR Doppler measurement is likely to be detector-limited for a while, we introduce new merit functions, which is directly related to photon-limited radial velocity (RV) uncertainty, to evaluate Doppler performance with the DFDI and DE methods. We find that DFDI has strength in wavelength coverage and multi-object capability over the DE for a limited detector resource. We simulate the performance of the InfraRed Exoplanet Tracker (IRET) based on the DFDI design, being considered for the next generation IR Doppler measurements. The predicted photon-limited RV uncertainty suggests that IRET is capable of detecting Earth-like exoplanets in habitable zone around nearby bright M dwarfs if they exist. A new method is developed to quantitatively estimate the influence of telluric lines on RV uncertainty. Our study shows that photon-limited RV uncertainty can be reached if 99% of the strength of telluric lines can be removed from the measured stellar spectra. At low to moderate levels of telluric line strength removal (50%-90%), the optimal RV uncertainty is typically a factor of two to three times larger than photon-limited RV uncertainty.

79 ASTRONOMY AND ASTROPHYSICS↗

LOCO with Constraints and Improved Fitting Technique

LOCO has been a powerful beam-based diagnostics and optics control method for storage rings and synchrotrons worldwide ever since it was established at NSLS by J. Safranek. This method measures the orbit response matrix and optionally the dispersion function of the machine. The data are then fitted to a lattice model by adjusting parameters such as quadrupole and skew quadrupole strengths in the model, BPM gains and rolls, corrector gains and rolls of the measurement system. Any abnormality of the machine that affects the machine optics can then be identified. The resulting lattice model is equivalent to the real machine lattice as seen by the BPMs. Since there are usually two or more BPMs per betatron period in modern circular accelerators, the model is often a very accurate representation of the real machine. According to the fitting result, one can correct the machine lattice to the design lattice by changing the quadrupole and skew quadrupole strengths. LOCO is so important that it is routinely performed at many electron storage rings to guarantee machine performance, especially after the Matlab-based LOCO code became available. However, for some machines, LOCO is not easy to carry out. In some cases, LOCO fitting converges to an unrealistic solution with large changes to the quadrupole strengths {Delta}K. The quadrupole gradient changes can be so large that the resulting lattice model fails to find a closed orbit and subsequent iterations become impossible. In cases when LOCO converges, the solution can have {Delta}K that is larger than realistic and often along with a spurious zigzag pattern between adjacent quadrupoles. This degeneracy behavior of LOCO is due to the correlation between the fitting parameters - usually between neighboring quadrupoles. The fitting scheme is therefore less restrictive over certain patterns of changes to these quadrupoles with which the correlated quadrupoles fight each other and the net effect is very inefficient {chi}{sup 2} reduction, i.e., small {chi}{sup 2} reduction with large changes of {Delta}K. Under effects of random noise, the fitting solution tends to crawl toward these patterns and ends up with unrealistically large {Delta}K. Such a solution is not very useful in optics correction because after the solution is dialed in, the quadrupoles will not respond as predicted by the lattice model due to magnet hysteresis. We will show that adding constraints to the fitting parameters is an effective way to combat this problem of LOCO. In fact, it improves optics calibration precision even for machines that don't show severe degeneracy behavior. LOCO fitting is essentially to solve a nonlinear least square problem with an iterative approach. The linear least square technique is applied in each iteration to move the solution toward the minimum. This approach is commonly referred to as the Gauss-Newton method. By using singular value decomposition (SVD) to invert the Jacobian matrix, this method has generally been very successful for LOCO. However, this method is based on a linear expansion of the residual vector over the fitting parameters which is valid only when the starting solution is sufficiently close to the real minimum. The fitting algorithm can have difficulties to converge when the initial guess is too far off. For example, it's possible for the {chi}{sup 2} merit function to increase after an iteration instead of decrease. This situation can be improved by using more robust nonlinear least square fitting algorithms, such as the Levenberg-Marquardt method. We will discuss the degeneracy problem in section 2 and then show how the constrained fitting can help in section 3. The application of Levenberg-Marquadt method to LOCO is shown in section 4. A summary is given in section 5.

43 PARTICLE ACCELERATORS↗

An adaptive stochastic sequential quadratic programming with differentiable exact augmented lagrangians

In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗