Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mathematical 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 865 records · Page 48

Mathematical modeling of biomass fuels formation process

The increasing demand for thermal and electric energy in many branches of industry and municipal management accounts for a drastic diminishing of natural resources (fossil fuels). Meanwhile, in numerous technical processes, a huge mass of wastes is produced. A segregated and converted combustible fraction of the wastes, with relatively high calorific value, may be used as a component of formed fuels. The utilization of the formed fuel components from segregated groups of waste in associated processes of co-combustion with conventional fuels causes significant savings resulting from partial replacement of fossil fuels, and reduction of environmental pollution resulting directly from the limitation of waste migration to the environment (soil, atmospheric air, surface and underground water). The realization of technological processes with the utilization of formed fuel in associated thermal systems should be qualified by technical criteria, which means that elementary processes as well as factors of sustainable development, from a global viewpoint, must not be disturbed. The utilization of post-process waste should be preceded by detailed technical, ecological and economic analyses. In order to optimize the mixing process of fuel components, a mathematical model of the forming process was created. The model is defined as a group of data structures which uniquely identify a real process and conversion of this data in algorithms based on a problem of linear programming. The paper also presents the optimization of parameters in the process of forming fuels using a modified simplex algorithm with a polynomial worktime. This model is a datum-point in the numerical modeling of real processes, allowing a precise determination of the optimal elementary composition of formed fuels components, with assumed constraints and decision variables of the task.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Execution of Multidisciplinary Design Optimization Approaches on Common Test Problems

A class of synthetic problems for testing multidisciplinary design optimization (MDO) approaches is presented. These test problems are easy to reproduce because all functions are given as closed-form mathematical expressions. They are constructed in such a way that the optimal value of all variables and the objective is unity. The test problems involve three disciplines and allow the user to specify the number of design variables, state variables, coupling functions, design constraints, controlling design constraints, and the strength of coupling. Several MDO approaches were executed on two sample synthetic test problems. These approaches included single-level optimization approaches, collaborative optimization approaches, and concurrent subspace optimization approaches. Execution results are presented, and the robustness and efficiency of these approaches an evaluated for these sample problems.

Balling, R. J.↗

An asynchronous parallel high-throughput model calibration framework for crystal plasticity finite element constitutive models

Crystal plasticity finite element model (CPFEM) is a powerful numerical simulation in the integrated computational materials engineering toolboxes that relates microstructures to homogenized materials properties and establishes the structure–property linkages in computational materials science. However, to establish the predictive capability, one needs to calibrate the underlying constitutive model, verify the solution and validate the model prediction against experimental data. Bayesian optimization (BO) has stood out as a gradient-free efficient global optimization algorithm that is capable of calibrating constitutive models for CPFEM. Here in this paper, we apply a recently developed asynchronous parallel constrained BO algorithm to calibrate phenomenological constitutive models for stainless steel 304 L, Tantalum, and Cantor high-entropy alloy.

304L stainless steel↗

A New FE Modeling Method for Isothermal Local Loading Process of Large-scale Complex Titanium Alloy Components Based on DEFORM-3D

Isothermal local loading process provides a new way to form large-scale complex titanium alloy components. The forming process is characterized by an extreme size (large scale in global and compared small size in regional), multi-parameter effects, and complicated loading path. To establish a reasonable finite element model is one of the key problems urgently to be solved in the research and development of isothermal local loading forming process of large-scale complex titanium alloy components. In this paper, a new finite element model of the isothermal local loading process is developed under the DEFORM-3D environment based on the solution of some key techniques. The modeling method has the following features: (1) different meshing techniques are used in different loading areas and the number of meshed elements is determined according to the deformation characteristic in different local loading steps in order to improve computational efficiency; (2) the accurate magnitude of the friction factor under titanium alloy hot forming (isothermal forming) condition is adopted instead of the typical value for lubricated hot forming processes; (3) different FEM solvers are chosen at different stages according to the loading characteristic and the contact state; (4) in contrast to the local component model, a full 3D component is modeled to simulate the process. The 3D-FE model is validated by experimental data of a large-scale bulkhead forming under isothermal local loading. The model can describe the quantitative relationships between the forming conditions and the forming results. The results of the present study may provide a basis for studying the local deformation mechanism, selecting the reasonable parameters, optimizing the die design and the process control in isothermal local loading process of large-scale complex titanium alloy components.

36 MATERIALS SCIENCE↗

Data for Controlling Circuitry Underlies the Growth Optimization of Saccharomyces cerevisiae

Microbial growth emerges from coordinated synthesis of various cellular components from limited resources. In Saccharomyces cerevisiae , cyclic AMP (cAMP)-mediated signaling is shown to orchestrate cellular metabolism; however, it remains unclear quantitatively how the controlling circuit drives resource partition and subsequently shapes biomass growth. Here we combined experiment with mathematical modeling to dissect the signaling-mediated growth optimization of S. cerevisiae . We showed that, through cAMP-mediated control, the organism achieves maximal or nearly maximal steady-state growth during the utilization of multiple tested substrates as well as under perturbations impairing glucose uptake. However, the optimal cAMP concentration varies across cases, suggesting that different modes of resource allocation are adopted for varied conditions. Under settings with nutrient alterations, S. cerevisiae tunes its cAMP level to dynamically reprogram itself to realize rapid adaptation. Moreover, to achieve growth maximization, cells employ additional regulatory systems such as the GCN2-mediated amino acid control. This study establishes a systematic understanding of global resource allocation in S. cerevisiae , providing insights into quantitative yeast physiology as well as metabolic strain engineering for biotechnological applications.

Conversion↗

Selecting the selector: Comparison of update rules for discrete global optimization

In this paper, we compare some well-known Bayesian global optimization methods in four distinct regimes, corresponding to high and low levels of measurement noise and to high and low levels of “quenched noise” (which term we use to describe the roughness of the function we are trying to optimize). We isolate the two stages of this optimization in terms of a “regressor,” which fits a model to the data measured so far, and a “selector,” which identifies the next point to be measured. Finally, the focus of this paper is to investigate the choice of selector when the regressor is well matched to the data.

97 MATHEMATICS AND COMPUTING↗

Some Optimization Problems for p-Laplacian Type Equations

In this paper we study some optimization problems for nonlinear elastic membranes. More precisely, we consider the problem of optimizing the cost functional over some admissible class of loads f where u is the (unique) solution to the problem -{delta}{sub p}u+ vertical bar u vertical bar {sup p-2}u=0 in {omega} with vertical bar {nabla}u vertical bar {sup p-2}u{sub {nu}}=f on {partial_derivative}{omega}.

97 MATHEMATICS AND COMPUTING↗

Deep kernel methods learn better: from cards to process optimization

Abstract The ability of deep learning methods to perform classification and regression tasks relies heavily on their capacity to uncover manifolds in high-dimensional data spaces and project them into low-dimensional representation spaces. In this study, we investigate the structure and character of the manifolds generated by classical variational autoencoder (VAE) approaches and deep kernel learning (DKL). In the former case, the structure of the latent space is determined by the properties of the input data alone, while in the latter, the latent manifold forms as a result of an active learning process that balances the data distribution and target functionalities. We show that DKL with active learning can produce a more compact and smooth latent space which is more conducive to optimization compared to previously reported methods, such as the VAE. We demonstrate this behavior using a simple cards dataset and extend it to the optimization of domain-generated trajectories in physical systems. Our findings suggest that latent manifolds constructed through active learning have a more beneficial structure for optimization problems, especially in feature-rich target-poor scenarios that are common in domain sciences, such as materials synthesis, energy storage, and molecular discovery. The Jupyter Notebooks that encapsulate the complete analysis accompany the article.

97 MATHEMATICS AND COMPUTING↗

Wireless Transmission of Monitoring Data out of the HADES Underground Laboratory - 12450

As part of the European 7. framework project MoDeRn, Nuclear Research and Consultancy Group (NRG) performed experiments in order to demonstrate the feasibility of wireless data transmission through the subsurface over larger distances by low frequency magnetic fields. The main objective of NRG's contribution is to characterize and optimize the energy use of this technique within the specific context of post-closure monitoring. For this, measurements have been performed in the HADES underground laboratory located at Mol, Belgium, at 225 m depth. The experimental set-up makes use of a loop antenna for the transmitter that has been matched into the existing infrastructure of the HADES. The experimental work of NRG is divided into several stages: in 2010, the necessary hardware has been designed and assembled and tested in the Netherlands. Site-specific magnetic background noise in Mol and frequency-dependent signal attenuation by the geologic medium has been measured. Signal transmission has been demonstrated and several transmission channels around 1 kHz have been identified. In 2011, additional measures and experiments have been performed in order to characterize and test relevant element of the transmission chain and to optimize the energy use of the set-up. A mathematical model description has been developed that includes the most relevant characteristics of the transmitter, receiver and transmission path and was used to analyse possible options to optimize the set-up. In 2012, experiments are planned in order to test several data transmission options. Results so far have shown that signal transmission over larger distances through the subsurface is feasible. However, to make quantitative conclusions on the energy need per bit of transmitted data, additional experiments planned in 2012 are necessary. The experimental and theoretical results gained by NRG, as part of the European 7. framework project MoDeRn, so far demonstrated that signal transmission through 225 m of a geological medium is feasible, even in case of a 'good conductor' as present in Mol. At this particular site the transmission distance through the different layers of clay and sandy aquifers is larger than the skin depth and clearly extends the near-field. The step from signal to data transmission will be made in 2012 and is essential to be able to make quantitative statements of the energy use per transmitted data bit. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗

Optimization with the OpenACC-to-FPGA framework on the Arria 10 and Stratix 10 FPGAs

The reconfigurable computing paradigm with field programmable gate arrays (FPGAs) has received renewed interest in the high-performance computing field due to FPGAs’ unique combination of performance and energy efficiency. However, difficulties in programming and optimizing FPGAs have prevented them from being widely accepted as general-purpose computing devices. In accelerator-based heterogeneous computing, portability across diverse heterogeneous devices is also an important issue, but the unique architectural features in FPGAs make this difficult to achieve. To address these issues, a directive-based, high-level FPGA programming and optimization framework was previously developed. In this work, developed optimizations were combined holistically using the directive-based approach to show that each individual benchmark requires a unique set of optimizations to maximize performance. We perform this exploration on Intel Arria 10 and Stratix 10 FPGAs. We also explored the relationships between performance, resource usages, and compilation times, and investigated implications for performance portability. Finally, we present an initial evaluation of a real-world proxy application, LULESH.

97 MATHEMATICS AND COMPUTING↗

Final Technical Report: Sparse Grid Scenario Generation and Interior Algorithms for Stochastic Optimization in a Parallel Computing Environment

The support from this grant resulted in seven published papers and a technical report. Two papers are published in SIAM J. on Optimization [87, 88]; two papers are published in IEEE Transactions on Power Systems [77, 78]; one paper is published in Smart Grid [79]; one paper is published in Computational Optimization and Applications [44] and one in INFORMS J. on Computing [67]). The works in [44, 67, 87, 88] were funded primarily by this DOE grant. The applied papers in [77, 78, 79] were also supported through a subcontract from the Argonne National Lab. We start by presenting our main research results on the scenario generation problem in Sections 1–2. We present our algorithmic results on interior point methods for convex optimization problems in Section 3. We describe a new ‘central’ cutting surface algorithm developed for solving large scale convex programming problems (as is the case with our proposed research) with semi-infinite number of constraints in Section 4. In Sections 5–6 we present our work on two application problems of interest to DOE.

97 MATHEMATICS AND COMPUTING↗

Two Error Bounds for Constrained Optimization Problems and Their Applications

This paper presents a global error bound for the projected gradient and a local error bound for the distance from a feasible solution to the optimal solution set of a nonlinear programming problem by using some characteristic quantities such as value function, trust region radius etc., which are appeared in the trust region method. As applications of these error bounds, we obtain sufficient conditions under which a sequence of feasible solutions converges to a stationary point or to an optimal solution, respectively, and a necessary and sufficient condition under which a sequence of feasible solutions converges to a Kuhn-Tucker point. Other applications involve finite termination of a sequence of feasible solutions. For general optimization problems, when the optimal solution set is generalized non-degenerate or gives generalized weak sharp minima, we give a necessary and sufficient condition for a sequence of feasible solutions to terminate finitely at a Kuhn-Tucker point, and a sufficient condition which guarantees that a sequence of feasible solutions terminates finitely at a stationary point.

97 MATHEMATICS AND COMPUTING↗

Optimizing Excited-State Electronic-Structure Codes for Intel Knights Landing: A Case Study on the BerkeleyGW Software

We profile and optimize calculations performed with the BerkeleyGW code on the Xeon-Phi architecture. BerkeleyGW depends both on hand-tuned critical kernels as well as on BLAS and FFT libraries. We describe the optimization process and performance improvements achieved. We discuss a layered parallelization strategy to take advantage of vector, thread and node-level parallelism. We discuss locality changes (including the consequence of the lack of L3 cache) and effective use of the on-package high-bandwidth memory. We show preliminary results on Knights-Landing including a roofline study of code performance before and after a number of optimizations. We find that the GW method is particularly well-suited for many-core architectures due to the ability to exploit a large amount of parallelism over plane-wave components, band-pairs, and frequencies.

97 MATHEMATICS AND COMPUTING↗

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗

Optimizing Performance of Combustion Chemistry Solvers on Intel's Many Integrated Core (MIC) Architectures

This work investigates novel algorithm designs and optimization techniques for restructuring chemistry integrators in zero and multidimensional combustion solvers, which can then be effectively used on the emerging generation of Intel's Many Integrated Core/Xeon Phi processors. These processors offer increased computing performance via large number of lightweight cores at relatively lower clock speeds compared to traditional processors (e.g. Intel Sandybridge/Ivybridge) used in current supercomputers. This style of processor can be productively used for chemistry integrators that form a costly part of computational combustion codes, in spite of their relatively lower clock speeds. Performance commensurate with traditional processors is achieved here through the combination of careful memory layout, exposing multiple levels of fine grain parallelism and through extensive use of vendor supported libraries (Cilk Plus and Math Kernel Libraries). Important optimization techniques for efficient memory usage and vectorization have been identified and quantified. These optimizations resulted in a factor of ~ 3 speed-up using Intel 2013 compiler and ~ 1.5 using Intel 2017 compiler for large chemical mechanisms compared to the unoptimized version on the Intel Xeon Phi. The strategies, especially with respect to memory usage and vectorization, should also be beneficial for general purpose computational fluid dynamics codes.

97 MATHEMATICS AND COMPUTING↗