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,153 records · Page 64

Prediction of strain, inter-layer interaction and critical current in CORC ® wires under axial strain by T-A modeling

Superconducting conductors on round core (CORC ® ) cables and wires can meet the needs of large high-field magnets, such as particle accelerators and compact nuclear fusion machines, due to their simple cabling process, high current-carrying capacity and reliable operation under high mechanical stresses. Many high-field magnets require CORC ® cables to carry a current of thousands of amperes in a background magnetic field exceeding 20 T. As a result, the large electromagnetic forces will deform the cable in the axial direction due to hoop stress and in the transverse direction by compressive stress. Therefore, it is essential to determine the irreversible deformation limit of the CORC ® cable under axial tensile load and optimize the cabling parameters to potentially extend this limit. Analytical and numerical methods are developed to assess the performance degradation of CORC ® wires under axial tensile load. The strain level, interlayer contact pressure and friction and their impact on the critical current are calculated by combining the mechanical response and the T-A method. Analyzing the results shows that the winding angle of the tape and the Poisson’s ratio of the inner core are key factors affecting the irreversible tensile strain limit of CORC ® wires. The smaller the winding angle and the higher the Poisson’s ratio of the inner core, the higher the irreversible tensile strain limit. For multi-layer CORC ® wires, the initial contact pressure caused by the cabling process must also be considered. The inter-layer interaction is coupled with the tape strain of each layer. The results of this research can serve as a basis for optimizing and designing CORC ® wires with extended irreversible strain limits.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Neural message-passing for objective-based uncertainty quantification and optimal experimental design

Various real-world scientific applications involve the mathematical modeling of complex uncertain systems with numerous unknown parameters. Accurate parameter estimation is often practically infeasible in such systems, as the available training data may be insufficient and the cost of acquiring additional data may be high. In such cases, based on a Bayesian paradigm, we can design robust operators retaining the best overall performance across all possible models and design optimal experiments that can effectively reduce uncertainty to enhance the performance of such operators maximally. While objective-based uncertainty quantification (objective-UQ) based on MOCU (mean objective cost of uncertainty) provides an effective means for quantifying uncertainty in complex systems, the high computational cost of estimating MOCU has been a challenge in applying it to real-world scientific/engineering problems. In this work, we propose a novel scheme to reduce the computational cost for objective-UQ via MOCU based on a data-driven approach. We adopt a neural message-passing model for surrogate modeling, incorporating a novel axiomatic constraint loss that penalizes an increase in the estimated system uncertainty. As an illustrative example, we consider the optimal experimental design (OED) problem for uncertain Kuramoto models, where the goal is to predict the experiments that can most effectively enhance robust synchronization performance through uncertainty reduction. We show that our proposed approach can accelerate MOCU-based OED by four to five orders of magnitude, without any visible performance loss compared to the state-of-the-art. The proposed approach applies to general OED tasks, beyond the Kuramoto model.

97 MATHEMATICS AND COMPUTING↗

Distributed Energy Resources Customer Adoption Model - Graphical User Interface, Version 2.1.8

The DER-CAM Graphical User Interface has been redesigned to consist of a dynamic tree structure on the left side of the application window to allow users to quickly navigate between different data categories and views. Views can either be tables with model parameters and input data, the optimization results, or a graphical interface to draw circuit topology and visualize investment results. The model parameters and input data consist of tables where values are assigned to specific keys. The aggregation of all model parameters and input data amounts to the data required to build a DER-CAM model, and is passed to the GAMS solver when users initiate the DER-CAM optimization process. Passing data to the GAMS solver relies on the use of a Java server that handles DER-CAM requests, queuing, and results delivery. This component of the DER-CAM GUI can be deployed either locally or remotely, and constitutes an intermediate step between the user data input and manipulation, and the execution of a DER-CAM optimization in the GAMS engine. The results view shows the results of the DER-CAM optimization and distinguishes between a single and a multi-objective process. The single optimization runs the DER-CAM optimization once and presents the results as a combination of summary charts and hourly dispatch profiles. The multi-objective optimization process consists of a sequence of runs initiated by the GUI, including: 1) CO2 minimization, 2) cost minimization, 3) a user defined number of points in-between objectives 1) and 2). The multi-objective results view includes both access to the detailed results of each point generated by the process as well as the generation of a Pareto Frontier graph to illustrate the trade-off between objectives. DER-CAM GUI 2.1.8 also introduces the ability to graphically generate circuit topologies, enabling support to DER-CAM 5.0.0. This feature consists of: 1) The drawing area, where users can manually create nodes and define their properties (e.g. point of common coupling, slack bus, load) and connect them through edges representing either power lines, transformers, or heat pipes, all with user defined characteristics (e.g., length, ampacity, inductance, or heat loss); 2) The tables, which display the user-defined topology in the final numerical form that will be passed to the DER-CAM optimization. Finally, the DER-CAM GUI is also deployed with a database schema that allows users to provide different energy load profiles, solar irradiance profiles, and tariff data, that can be stored locally and later used in any DER-CAM model. However, no real data will be delivered with this version.

Ewald, Friedrich↗

Advanced numerical methods in mesh generation and mesh adaptation

Numerical solution of partial differential equations requires appropriate meshes, efficient solvers and robust and reliable error estimates. Generation of high-quality meshes for complex engineering models is a non-trivial task. This task is made more difficult when the mesh has to be adapted to a problem solution. This article is focused on a synergistic approach to the mesh generation and mesh adaptation, where best properties of various mesh generation methods are combined to build efficiently simplicial meshes. First, the advancing front technique (AFT) is combined with the incremental Delaunay triangulation (DT) to build an initial mesh. Second, the metric-based mesh adaptation (MBA) method is employed to improve quality of the generated mesh and/or to adapt it to a problem solution. We demonstrate with numerical experiments that combination of all three methods is required for robust meshing of complex engineering models. The key to successful mesh generation is the high-quality of the triangles in the initial front. We use a black-box technique to improve surface meshes exported from an unattainable CAD system. The initial surface mesh is refined into a shape-regular triangulation which approximates the boundary with the same accuracy as the CAD mesh. The DT method adds robustness to the AFT. The resulting mesh is topologically correct but may contain a few slivers. The MBA uses seven local operations to modify the mesh topology. It improves significantly the mesh quality. The MBA method is also used to adapt the mesh to a problem solution to minimize computational resources required for solving the problem. The MBA has a solid theoretical background. In the first two experiments, we consider the convection-diffusion and elasticity problems. We demonstrate the optimal reduction rate of the discretization error on a sequence of adaptive strongly anisotropic meshes. The key element of the MBA method is construction of a tensor metric from hierarchical edge-based error estimates. We conclude that the quasi-optimal mesh must be quasi-uniform in this metric. All numerical experiments are based on the publicly available Ani3D package, the collection of advanced numerical instruments.

99 GENERAL AND MISCELLANEOUS↗

On relaxations of the max k -cut problem formulations

Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.

97 MATHEMATICS AND COMPUTING↗

RLGBS: Reinforcement Learning-Guided Beam Search for process optimization in a paper machine dryer section

Paper drying is responsible for over two-thirds of energy consumption in the U.S. pulp and paper industry, presenting significant potential for energy savings through optimization of process parameters. Current approaches often assume fixed operating conditions, neglecting dynamic ambient and process variations that limit achievable savings and real-world applicability. To this end, we develop a physics-based simulation environment for a paper machine dryer section and propose a reinforcement learning (RL) framework to minimize overall energy consumption by optimizing drying process parameters under diverse operating conditions. To mitigate overdrying and numerical instabilities caused by suboptimal local RL actions, we introduce Reinforcement Learning-Guided Beam Search (RLGBS), which explores multiple action sequences in parallel using beam search. Instead of making step-by-step decisions, RLGBS prioritizes solutions based on cumulative probability, reducing the impact of individual suboptimal actions. Experiments demonstrate that RLGBS achieves consistent energy savings under unseen operating conditions not encountered during training, outperforming conventional RL methods. While validated in drying optimization, this framework is broadly applicable to other RL-based industrial process control problems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Impact of numerics on the predictive capabilities of reacting flow LES

Combustors in modern aerospace propulsion systems are highly optimized devices and further enhancements to their performance will require advanced predictive modeling techniques. The LES approach has potential to be such a technique, but demonstration of its true predictive capability remains a challenge. In this paper, a methodical study is performed to assess the impact of numerical error on the predictive capabilities of LES and to distinguish it from error arising from physical modeling. Four codes are employed to simulate the bluff body stabilized flame experiment of Volvo Flygmotor AB. The physical models (governing equations and sub-grid models) are kept identical between the codes so that the physical modeling error is the same. For the same reason, computational grids are also kept identical since the sub-grid models are grid dependent. Results indicate that all codes produce a very similar solution for the non-reacting flow in terms of large scale unsteady vortex shedding behavior, mean profiles and second order turbulence statistics, on a suitably refined grid. This solution is also very close to the experimentally observed behavior of the flow. In contrast, for the reacting case, solutions from the various codes exhibit significant differences when analyzed under the same metrics and with similar or even finer grid resolution than that used for the non-reacting case. These differences are large enough to change the macroscopic behavior of the flow, e.g. some codes predict symmetric vortex shedding while others predict asymmetric shedding and some codes show strong recirculation zones while others show stagnant regions behind the bluff body. It is also shown that none of the solutions truly predicts the experimentally observed flow. Given that the physical sub-grid models and computational grids are the same in all the simulations, the inconsistency between results points to a significant impact of numerical methods and, hence, numerical error. The need for mitigation of this impact is highlighted, along with the need for metrics detailing how LES should be applied to reacting flows. It is suggested that both of these issues should be the focus of future work.

Energy & Fuels↗

Resonant tunneling assisted propagation and amplification of plasmons in high electron mobility transistors

A rigorous theoretical and computational model is developed for the plasma-wave propagation in high electron mobility transistor structures with electron injection from a resonant tunneling diode at the gate. We discuss the conditions in which low-loss and sustainable plasmon modes can be supported in such structures. The developed analytical model is used to derive the dispersion relation for these plasmon-modes. A non-linear full-wave-hydrodynamic numerical solver is also developed using a finite difference time domain algorithm. The developed analytical solutions are validated via the numerical solution. We also verify previous observations that were based on a simplified transmission line model. It is shown that at high levels of negative differential conductance, plasmon amplification is indeed possible. The proposed rigorous models can enable accurate design and optimization of practical resonant tunnel diode-based plasma-wave devices for terahertz sources, mixers, and detectors, by allowing a precise representation of their coupling when integrated with other electromagnetic structures.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimizing Dirac Wilson Operator and linear solvers for Intel KNL

Lattice Quantumchromodynamics (QCD) is a powerful tool to numerically access the low energy regime of QCD in a straightforward way with quantifyable uncertainties. In this approach, QCD is discretized on a four dimensional, euclidian space-time grid with millions of degrees of freedom. In modern lattice calculations, most of the work is still spent in solving large, sparse linear systems. This part has two challenges, i.e. optimizing the sparse matrix application as well as BLAS-like kernels used in the linear solver. We are going to present performance optimizations of the Dirac operator (dslash) with and without clover term for recent Intel architectures, including Knights Landing (KNL). Using only a single right hand side, we were able to achieve a good fraction of peak performance for slash, CG and BiCGStab. We will also present a series of experiments we performed on KNL, i.e. running MCDRAM in different modes, enabling or disabling hardware prefetching, using different SoA lengths as well as different sub-NUMA-clustering modes.

Joó, Bálint↗

Exploring quantum control landscapes: Topology, features, and optimization scaling

Quantum optimal control experiments and simulations have successfully manipulated the dynamics of systems ranging from atoms to biomolecules. Surprisingly, these collective works indicate that the effort (i.e., the number of algorithmic iterations) required to find an optimal control field appears to be essentially invariant to the complexity of the system. The present work explores this matter in a series of systematic optimizations of the state-to-state transition probability on model quantum systems with the number of states N ranging from 5 through 100. The optimizations occur over a landscape defined by the transition probability as a function of the control field. Previous theoretical studies on the topology of quantum control landscapes established that they should be free of suboptimal traps under reasonable physical conditions. The simulations in this work include nearly 5000 individual optimization test cases, all of which confirm this prediction by fully achieving optimal population transfer of at least 99.9% on careful attention to numerical procedures to ensure that the controls are free of constraints. Collectively, the simulation results additionally show invariance of required search effort to system dimension N. This behavior is rationalized in terms of the structural features of the underlying control landscape. The very attractive observed scaling with system complexity may be understood by considering the distance traveled on the control landscape during a search and the magnitude of the control landscape slope. Exceptions to this favorable scaling behavior can arise when the initial control field fluence is too large or when the target final state recedes from the initial state as N increases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Combining dynamical decoupling with optimal control for improved QIP.

Constructing high-fidelity control pulses that are robust to control and system/environment fluctuations is a crucial objective for quantum information processing (QIP). We combine dynamical decoupling (DD) with optimal control (OC) to identify control pulses that achieve this objective numerically. Previous DD work has shown that general errors up to (but not including) third order can be removed from {pi}- and {pi}/2-pulses without concatenation. By systematically integrating DD and OC, we are able to increase pulse fidelity beyond this limit. Our hybrid method of quantum control incorporates a newly-developed algorithm for robust OC, providing a nested DD-OC approach to generate robust controls. Motivated by solid-state QIP, we also incorporate relevant experimental constraints into this DD-OC formalism. To demonstrate the advantage of our approach, the resulting quantum controls are compared to previous DD results in open and uncertain model systems.

99 GENERAL AND MISCELLANEOUS↗

Spatial resolution of different discretizations over long-time for the Dirac equation with small potentials

In this report we compare the long-time error bounds and spatial resolution of finite difference methods with different spatial discretizations for the Dirac equation with small electromagnetic potentials characterized by $\varepsilon \in (0, 1]$ a dimensionless parameter. We begin with the simple and widely used finite difference time domain (FDTD) methods, and establish rigorous error bounds of them, which are valid up to the time at $O(1/\varepsilon)$. In the error estimates, we pay particular attention to how the errors depend explicitly on the mesh size $h$ and time step $\tau$ as well as the small parameter $\varepsilon$. Based on the results, in order to obtain "correct" numerical solutions up to the time at $O(1/\varepsilon)$, the $\varepsilon$-scalability (or meshing strategy requirement) of the FDTD methods should be taken as $h = O(\varepsilon^{1/2})$ and $\tau = O(\varepsilon^{1/2})$. To improve the spatial resolution capacity, we apply the Fourier spectral method to discretize the Dirac equation in space. Error bounds of the resulting finite difference Fourier pseudospectral (FDFP) methods show that they exhibit uniform spatial errors in the long-time regime, which are optimal in space as suggested by the Shannon's sampling theorem. Extensive numerical results are reported to confirm the error bounds and demonstrate that they are sharp.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantitative characterization of material surface — Application to Ni + Mo electrolytic composite coatings

A new approach to numerical analysis of maps of material surface has been proposed and discussed in detail. It was concluded that the roughness factor RF and the root mean square roughness S{sub q} show a saturation effect with increasing size of the analysed maps what allows determining the optimal map dimension representative of the examined material. A quantitative method of determining predominant direction of the surface texture based on the power spectral density function is also proposed and discussed. The elaborated method was applied in surface analysis of Ni + Mo composite coatings. It was shown that co-deposition of molybdenum particles in nickel matrix leads to an increase in surface roughness. In addition, a decrease in size of the embedded Mo particles in Ni matrix causes an increase of both the surface roughness and the surface texture. It was also stated that the relation between the roughness factor and the double layer capacitance C{sub dl} of the studied coatings is linear and allows determining the double layer capacitance of the smooth nickel electrode. - Highlights: •Optimization of the procedure for the scanning of the material surface •Quantitative determination of the surface roughness and texture intensity •Proposition of the parameter describing privileged direction of the surface texture •Determination of the double layer capacitance of the smooth electrode.

36 MATERIALS SCIENCE↗

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗

ExaTN: Scalable GPU-Accelerated High-Performance Processing of General Tensor Networks at Exascale

We present ExaTN (Exascale Tensor Networks), a scalable GPU-accelerated C++ library which can express and process tensor networks on shared- as well as distributed-memory high-performance computing platforms, including those equipped with GPU accelerators. Specifically, ExaTN provides the ability to build, transform, and numerically evaluate tensor networks with arbitrary graph structures and complexity. It also provides algorithmic primitives for the optimization of tensor factors inside a given tensor network in order to find an extremum of a chosen tensor network functional, which is one of the key numerical procedures in quantum many-body theory and quantum-inspired machine learning. Numerical primitives exposed by ExaTN provide the foundation for composing rather complex tensor network algorithms. We enumerate multiple application domains which can benefit from the capabilities of our library, including condensed matter physics, quantum chemistry, quantum circuit simulations, as well as quantum and classical machine learning, for some of which we provide preliminary demonstrations and performance benchmarks just to emphasize a broad utility of our library.

97 MATHEMATICS AND COMPUTING↗

Online eco-routing for electric vehicles using combinatorial multi-armed bandit with estimated covariance

Identifying energy-efficient routes in real-time has significant implications for the energy-optimal operations of electric vehicles (EVs). Here, this study proposes a novel model for EV online eco-routing problem, which obtains the minimal expected energy consumption paths (MECPs) for multiple origin-destination (OD) pairs simultaneously. Specifically, we formulate the routing problem as a bandit problem and solve it with online algorithms. We extend the algorithms by implementing a path elimination mechanism to reduce the candidate path set and introducing the variance and covariance of the energy consumption to reduce the uncertainties. The numerical results show that the proposed algorithms can efficiently obtain near-optimal MECPs, and the solution is significantly better than the widely used shortest trip time path algorithm (STTP) and shortest trip distance path algorithm (SDP). The variation considering link energy covariance and path elimination generates paths that save 4.1% of energy compared to the SDP and 5.4% to the STTP.

33 ADVANCED PROPULSION SYSTEMS↗

Optimal constraints on local primordial non-Gaussianity from the two-point statistics of large-scale structure

One of the main signatures of primordial non-Gaussianity of the local type is a scale-dependent correction to the bias of large-scale structure tracers such as galaxies or clusters, whose amplitude depends on the bias of the tracers itself. The dominant source of noise in the power spectrum of the tracers is caused by sampling variance on large scales (where the non-Gaussian signal is strongest) and shot noise arising from their discrete nature. Recent work has argued that one can avoid sampling variance by comparing multiple tracers of different bias, and suppress shot noise by optimally weighting halos of different mass. Here we combine these ideas and investigate how well the signatures of non-Gaussian fluctuations in the primordial potential can be extracted from the two-point correlations of halos and dark matter. On the basis of large N-body simulations with local non-Gaussian initial conditions and their halo catalogs we perform a Fisher matrix analysis of the two-point statistics. Compared to the standard analysis, optimal weighting and multiple-tracer techniques applied to halos can yield up to 1 order of magnitude improvements in f{sub NL}-constraints, even if the underlying dark matter density field is not known. In this case one needs to resolve all halos down to 10{sup 10}h{sup -1}M{sub sun} at z=0, while with the dark matter this is already achieved at a mass threshold of 10{sup 12}h{sup -1}M{sub sun}. We compare our numerical results to the halo model and find satisfactory agreement. Forecasting the optimal f{sub NL}-constraints that can be achieved with our methods when applied to existing and future survey data, we find that a survey of 50h{sup -3} Gpc{sup 3} volume resolving all halos down to 10{sup 11}h{sup -1}M{sub sun} at z=1 will be able to obtain {sigma}{sub f{sub N{sub L}}}{approx}1 (68% cl), a factor of {approx}20 improvement over the current limits. Decreasing the minimum mass of resolved halos, increasing the survey volume or obtaining the dark matter maps can further improve these limits, potentially reaching the level of {sigma}{sub f{sub N{sub L}}}{approx}0.1. This precision opens up the possibility to distinguish different types of primordial non-Gaussianity and to probe inflationary physics of the very early Universe.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗