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,189 records · Page 66

BaseBuddy v1

The software "BaseBuddy" (basebuddy.lbl.gov) is a user-friendly web app designed for codon optimization of heterologous genes. Codon optimization is a widely used technique to enhance the expression levels of non-native genes. Our app is built on the DNA Chisel Python library (Zulkower and Rosser, 2020), which offers highly customizable and transparent gene optimization. Unlike DNA Chisel, which is a command-line interface software with numerous optional functions, our web app simplifies the process for users. Additionally, while DNA Chisel relies on the outdated Kazusa codon usage database, our app introduces the option to utilize the most recent version of the CoCoPUTs database (Athey et al., 2017). By incorporating CoCoPUTs, we also expand the range of target organisms and maintain up-to-date sequencing data for more accurate codon optimization results.

Schmidt, Matthias↗

Mass-preserving time second-order explicit–implicit domain decomposition schemes for solving parabolic equations with variable coefficients

In this paper, the new mass-preserving time second-order explicit–implicit domain decomposition (DD) schemes for solving parabolic equations with various coefficients are proposed. In the schemes, first, the interface values on the interfaces of sub-domains are explicitly calculated, in which two kinds of explicit difference schemes are used. Second, the interior values in sub-domains are determined by the implicit schemes. Third, the interface values are recalculated explicitly to preserve mass. The important feature is that the developed schemes are more than first order in time step and the correction operators at the third step ensure the schemes’ mass conservative. The stability and convergence are analyzed for the two schemes. The optimal error estimates are obtained in the H{sup 1} semi-norm under a stability condition. Numerical experiments confirm the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Forward and inverse modeling of fault transmissibility in subsurface flows

Characterizing physical properties of faults, such as their transmissibility, is crucial for performing predictive numerical simulation of subsurface flows, such as those encountered in petroleum engineering and remediation of subsurface contamination. Here, this paper provides a complete investigation of the inverse problem for fault transmissibility in subsurface flow models, under appropriate assumptions on fault structure. In particular, the following aspects are considered: 1) fault modeling and well-posedness of the forward problem; 2) finite element (FEM) discretizations of the forward problem and their rigorous a priori convergence analysis; 3) Well-posedness of the Bayesian inverse problem, FEM discretization of the infinite dimensional Bayesian inverse formulation, and its rigorous a priori analysis. Moreover, computation of the maximum a posteriori (MAP) point via fast inexact Newton-conjugate gradient optimization and a Laplace approximation of the Bayesian posterior are also presented. Numerical results illustrate the use of the proposed fault model in forward and inverse problems for subsurface flows in two dimensional domains with multiple faults.

97 MATHEMATICS AND COMPUTING↗

Optimization of global model composed of radial basis functions using the term-ranking approach

A term-ranking method is put forward to optimize the global model composed of radial basis functions to improve the predictability of the model. The effectiveness of the proposed method is examined by numerical simulation and experimental data. Numerical simulations indicate that this method can significantly lengthen the prediction time and decrease the Bayesian information criterion of the model. The application to real voice signal shows that the optimized global model can capture more predictable component in chaos-like voice data and simultaneously reduce the predictable component (periodic pitch) in the residual signal.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-Driven Compositional Optimization in Misspecified Regimes

With a manifold growth in the scale and intricacy of systems, the challenges of parametric misspecification become pronounced. These concerns are further exacerbated in compositional settings, which emerge in problems complicated by modeling risk and robustness. In “Data-Driven Compositional Optimization in Misspecified Regimes,” the authors consider the resolution of compositional stochastic optimization problems, plagued by parametric misspecification. In considering settings where such misspecification may be resolved via a parallel learning process, the authors develop schemes that can contend with diverse forms of risk, dynamics, and nonconvexity. They provide asymptotic and rate guarantees for unaccelerated and accelerated schemes for convex, strongly convex, and nonconvex problems in a two-level regime with extensions to the multilevel setting. Surprisingly, the nonasymptotic rate guarantees show no degradation from the rate statements obtained in a correctly specified regime and the schemes achieve optimal (or near-optimal) sample complexities for general T-level strongly convex and nonconvex compositional problems.

Business & Economics↗

Optimal subinterval selection approach for power system transient stability simulation

Power system transient stability analysis requires an appropriate integration time step to avoid numerical instability as well as to reduce computational demands. For fast system dynamics, which vary more rapidly than what the time step covers, a fraction of the time step, called a subinterval, is used. However, the optimal value of this subinterval is not easily determined because the analysis of the system dynamics might be required. This selection is usually made from engineering experiences, and perhaps trial and error. This paper proposes an optimal subinterval selection approach for power system transient stability analysis, which is based on modal analysis using a single machine infinite bus (SMIB) system. Fast system dynamics are identified with the modal analysis and the SMIB system is used focusing on fast local modes. An appropriate subinterval time step from the proposed approach can reduce computational burden and achieve accurate simulation responses as well. As a result, the performance of the proposed method is demonstrated with the GSO 37-bus system.

24 POWER TRANSMISSION AND DISTRIBUTION↗

New bounding and decomposition approaches for MILP investment problems: Multi-area transmission and generation planning under policy constraints

A novel two-phase bounding and decomposition approach to compute optimal and near-optimal solutions to large-scale mixed-integer investment planning problems is proposed and it considers a large number of operating subproblems, each of which is a convex optimization. Our motivating application is the planning of power transmission and generation in which policy constraints are designed to incentivize high amounts of intermittent generation in electric power systems. The bounding phase exploits Jensen’s inequality to define a lower bound, which we extend to stochastic programs that use expected-value constraints to enforce policy objectives. The decomposition phase, in which the bounds are tightened, improves upon the standard Benders’ algorithm by accelerating the convergence of the bounds. The lower bound is tightened by using a Jensen’s inequality-based approach to introduce an auxiliary lower bound into the Benders master problem. Upper bounds for both phases are computed using a sub-sampling approach executed on a parallel computer system. Numerical results show that only the bounding phase is necessary if loose optimality gaps are acceptable. But, the decomposition phase is required to attain optimality gaps. Moreover, use of both phases performs better, in terms of convergence speed, than attempting to solve the problem using just the bounding phase or regular Benders decomposition separately.

97 MATHEMATICS AND COMPUTING↗

Finding inputs that trigger floating-point exceptions in heterogeneous computing via Bayesian optimization

Testing code for floating-point exceptions is crucial as exceptions can quickly propagate and produce unreliable numerical answers. The state-of-the-art to test for floating-point exceptions in heterogeneous systems is quite limited and solutions require the application’s source code, which precludes their use in accelerated libraries where the source is not publicly available. We present an approach to find inputs that trigger floating-point exceptions in black-box CPU or GPU functions, i.e., functions where the source code and information about input bounds are unavailable. Our approach is the first to use Bayesian optimization (BO) to identify such inputs and uses novel strategies to overcome the challenges that arise in applying BO to this problem. Here, we implement our approach in the XSCOPE framework and demonstrate it on 58 functions from the CUDA Math Library and 81 functions from the Intel Math Library. XSCOPE is able to identify inputs that trigger exceptions in about 73% of the tested functions.

97 MATHEMATICS AND COMPUTING↗

Substation-Level Grid Topology Optimization Using Bus Splitting: Preprint

Operations of substation circuit breakers are of high significance for performing system maintenance and topology optimization. Bus splitting is one type of topology changes where the two bus-bars at a substation become electrically disconnected after certain actions of circuit breakers. As these events involve detailed substation modeling, they are not typically considered in power system routine operation and control. In this paper, an improved substation-level topology optimization is developed by expanding traditional line switching with breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bi-linear terms in the resultant topology optimization model. Thus, a tractable mixed-integer linear program formulation is presented which can be efficiently solved for real-time control. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the performance and economic benefits of the proposed topology optimization approach.

bus split↗

Interfacial electroneutrality controls transport of asymmetric salts through charge-patterned mosaic membranes

Membranes that selectively enhance target solute permeation while rejecting competing species are essential for precision separations. This study introduces charge-patterned mosaic membranes (CMMs) that selectively transport divalent asymmetric salts by leveraging a net-neutral membrane–solution interface. This mechanism, dictated by the charge ratio of positive and negative domains on the membrane surface and the balance of cations and anions in the salt, is supported by analytical, numerical, and experimental results. Analytical solutions identified cationic domain coverages (f + ) of 33%, 50%, and 66% as optimal for the selective transport of +2:−1 salts, +1:−1 salts, and +1:−2 salts, respectively, under conditions where the pattern size (L) is significantly larger than the Debye length. Numerical simulations and experiments using CMMs with alternating charged-stripes inkjet-printed onto nanostructure copolymer substrates confirmed these findings. By varying stripe widths to control f + , pressure-driven filtration experiments demonstrated selective enrichment of MgCl 2 and K 2 SO 4 at the predicted f + values, with deviations from these values leading to salt rejection. These results highlight the pivotal role of a net-neutral interface in enabling asymmetric salt enrichment. This study positions CMMs as a versatile platform for tuning ion selectivity, addressing challenges in resource recovery, water treatment, and precision separations.

additive manufacturing↗

Optimal Sizing of PV and Energy Storage in an Electric Vehicle Extreme Fast Charging Station

This paper proposes an optimization model for the optimal sizing of photovoltaic (PV) and energy storage in an electric vehicle extreme fast charging station considering the coordinated charging strategy of the electric vehicles. The proposed model minimizes the annualized cost of the extreme fast charging station, including investment and maintenance cost of PV and energy storage, cost of purchasing energy from utility and demand charge. The decision variables are capacity of invested PV and the power and energy ratings of invested energy storage. To further reduce the annualized cost of the extreme fast charging station, the charging strategy of electric vehicles are integrated into the optimization model and coordinated with the power output of PV and charging/discharging of energy storage. Results of numerical simulations indicate that investment of PV and energy storage could help reduce the annualized cost of the extreme fast charging station significantly. Meanwhile, the impacts of various parameters on the optimal solution are investigated by sensitivity analysis.

Liu, Guodong↗

Holistic fleet optimization incorporating system design considerations

The methodology described in this article enables a type of holistic fleet optimization that simultaneously considers the composition and activity of a fleet through time as well as the design of individual systems within the fleet. Often, real-world system design optimization and fleet-level acquisition optimization are treated separately due to the prohibitive scale and complexity of each problem. Importantly, this means that fleet-level schedules are typically limited to the inclusion of predefined system configurations and are blind to a rich spectrum of system design alternatives. Similarly, system design optimization often considers a system in isolation from the fleet and is blind to numerous, complex portfolio-level considerations. In reality, these two problems are highly interconnected. To properly address this system-fleet design interdependence, we present a general method for efficiently incorporating multi-objective system design trade-off information into a mixed-integer linear programming (MILP) fleet-level optimization. This work is motivated by the authors' experience with large-scale DOD acquisition portfolios. However, the methodology is general to any application where the fleet-level problem is a MILP and there exists at least one system having a design trade space in which two or more design objectives are parameters in the fleet-level MILP.

97 MATHEMATICS AND COMPUTING↗

Differentiable lagrangian shock hydrodynamics with application to stable shock acceleration of density interfaces

We develop a gradient based optimization approach for the equations of compressible, Lagrangian hydrodynamics and demonstrate how it can be employed to automatically uncover strategies to control hydrodynamic instabilities arising from shock acceleration of density interfaces. Strategies for controlling the Richtmyer-Meshkov instability (RMI) are of great benefit for inertial confinement fusion (ICF) where shock interactions with many small imperfections in the density interface lead to instabilities which rapidly grow over time. These instabilities lead to mixing which, in the case of laser driven ICF, quenches the runaway fusion process ruining the potential for positive energy return. Here, we demonstrate that control of these instabilities can be achieved by optimization of initial conditions with ( > 100) parameters. Optimizing over a large parameter space like this is not possible with gradient-free optimization strategies. This requires computation of the gradient of the outputs of a numerical solution to the equations of Lagrangian hydrodynamics with respect to the inputs. We show that the efficient computation of these gradients is made possible via a judicious application of (i) adjoint methods, the exact formal representation of sensitivities involving partial differential equations, and (ii) automatic differentiation (AD), the algorithmic calculation of derivatives of functions. Careful regularization of multiple operators including artificial viscosity and timestep control is required. We perform design optimization of > 100 parameter energy field driving the Richtmyer Meshkov instability showing significant suppression while simultaneously enhancing the acceleration of the interface relative to a nominal baseline case.

Hydrophysics↗

Scalable tensor factorizations with missing data.

The problem of missing data is ubiquitous in domains such as biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, and communication networks|all domains in which data collection is subject to occasional errors. Moreover, these data sets can be quite large and have more than two axes of variation, e.g., sender, receiver, time. Many applications in those domains aim to capture the underlying latent structure of the data; in other words, they need to factorize data sets with missing entries. If we cannot address the problem of missing data, many important data sets will be discarded or improperly analyzed. Therefore, we need a robust and scalable approach for factorizing multi-way arrays (i.e., tensors) in the presence of missing data. We focus on one of the most well-known tensor factorizations, CANDECOMP/PARAFAC (CP), and formulate the CP model as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) using a first-order optimization approach to solve the weighted least squares problem. Based on extensive numerical experiments, our algorithm is shown to successfully factor tensors with noise and up to 70% missing data. Moreover, our approach is significantly faster than the leading alternative and scales to larger problems. To show the real-world usefulness of CP-WOPT, we illustrate its applicability on a novel EEG (electroencephalogram) application where missing data is frequently encountered due to disconnections of electrodes.

99 GENERAL AND MISCELLANEOUS↗

Structured illumination of a sub-wavelength hollow-waveguide array

A hollow-waveguide array with sub-wavelength dimensions was suggested earlier as a space-variant polarization converter. For optimum light transmission through the array, periodic structured illumination is generated by using a dielectric grating with the same period. In this paper various numerical simulations are performed. The transmission depends on numerous parameters. Particularly, it is shown how the grating can be optimized and how longitudinal and lateral displacements influence the results. For the considered configuration it is found that the transmission can be increased by factors up to 1.46 (TE) and 1.35 (TM) compared to a uniform illumination of the hollow waveguide array.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Higher-order temporal integration for the incompressible Navier–Stokes equations in bounded domains

Here, this paper compares and contrasts higher-order, semi-implicit temporal integration strategies for the incompressible Navier–Stokes methods based on spectral deferred corrections applied to certain gauge or auxiliary variable formulations of the equations. Particular focus is placed on the imposition of boundary conditions in the semi-implicit formulation, the accurate treatment of the pressure term, and the smoothness of the numerical solution for different formulations. The main result presented here is the formulation and numerical validation of a single-step, semi-implicit method called spectral deferred pressure corrections, which can in theory obtain arbitrary formal order of accuracy in time. Lastly, numerical results demonstrate up to eighth-order accuracy, scenarios where optimal temporal accuracy is attained, and scenarios where order reduction is observed due to time-dependent boundary conditions.

97 MATHEMATICS AND COMPUTING↗

Enhanced physics-constrained deep neural networks for modeling vanadium redox flow battery

Numerical simulation has become indispensable in advancing cost-effective process optimization and control of flow batteries. We propose an enhanced version of the physics-constrained deep neural network (PCDNN) approach to provide high-accuracy voltage predictions in the vanadium redox flow batteries (VRFBs). The purpose of the PCDNN approach is to enforce the physics-based zero-dimensional (0D) VRFB model in a neural network to assure model generalization for various battery operation conditions. However, limited by the simplifications of the 0D model, the PCDNN cannot capture sharp voltage changes in the extreme SOC regions. To improve the accuracy of voltage prediction at extreme ranges, we introduce a second (enhanced) DNN to mitigate the prediction errors carried from the 0D model itself and call the resulting approach enhanced PCDNN (ePCDNN). By comparing with experimental data, we demonstrate that the ePCDNN approach can accurately capture the voltage response throughout the charge–discharge cycle, including the tail region of the voltage discharge curve. The loss function for training the ePCDNN is designed to be flexible by adjusting the weights of the physics-constrained DNN and the enhanced DNN. In conclusion, this allows the ePCDNN framework to be transferable to battery systems with variable physical model fidelity.

25 ENERGY STORAGE↗

Impact of detector simulation in particle physics collider experiments

Through the last three decades, precise simulation of the interactions of particles with matter and modeling of detector geometries has proven to be of critical importance to the success of the international high-energy physics experimental programs. For example, the detailed detector modeling and accurate physics of the Geant4-based simulation software of the CMS and ATLAS particle physics experiments at the European Center of Nuclear Research (CERN) Large Hadron Collider (LHC) was a determinant factor for these collaborations to deliver physics results of outstanding quality faster than any hadron collider experiment ever before. This review article highlights the impact of detector simulation on particle physics collider experiments. It presents numerous examples of the use of simulation, from detector design and optimization, through software and computing development and testing, to cases where the use of simulation samples made a difference in the accuracy of the physics results and publication turnaround, from data-taking to submission. It also presents the economic impact and cost of simulation in the CMS experiment. Future experiments will collect orders of magnitude more data, taxing heavily the performance of simulation and reconstruction software for increasingly complex detectors. Consequently, it becomes urgent to find solutions to speed up simulation software in order to cope with the increased demand in a time of flat budgets. The study ends with a short discussion on the potential solutions that are being explored, by leveraging core count growth in multicore machines, using new generation coprocessors, and re-engineering of HEP code for concurrency and parallel computing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗