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 955 records · Page 53

REopt Model Overview and Example Use Cases [Slides]

REopt(R) is a mixed-integer optimization model that minimizes the lifecycle cost of serving energy loads at a site. This work provides and introduction to the model along with its key workflow, techno-economic inputs, key outputs, and key caveats for readers to understand REopt the when, why, how of using this model. This resource also includes helpful links related to REopt model and the data sources it uses during the optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗

Optimization of CPAPR for x64 multicore

I report the progress to date of my work on scaling the CPAPR algorithm and necessary supporting code to enable processing large (gigabyte to 100 gigabyte) data sets and benchmarking the same. Where possible, I also report background information possibly of relevance in future modifications of the code. The results include: minor repairs and additions to the TTB library for portability, algorithmic improvements relevant to both serial and multithreaded implementations, algorithmic improvements taking advantage of multithreading hardware, support library additions (binary IO routines) needed for efficiently and reproducibly benchmarking the algorithms. For this optimization work, no large scale data sets are available. Therefore, scalability of data synthesis algorithms is addressed as well.

97 MATHEMATICS AND COMPUTING↗

A large-scale benchmarking of deterministic and stochastic derivative-free optimization algorithms

This presentation summarizes our work in the PrOMMiS project on benchmarking of data-driven optimization algorithms and their applications in self-driving laboratories. This work supports the broader project goal of accelerating the identification of promising separation methods and operating conditions for critical minerals separation processes. We present a systematic benchmarking study of 42 data-driven optimization algorithms on a broad collection of 502 test problems. The results identify BAM, GLCCLUSTER, and MULTIMIN as the most effective optimization solvers, with BAM showing the highest overall performance and solving more than 80% of the benchmark problems. The study also shows that no single solver consistently outperforms the others across all problem types, indicating that our future laboratory applications may benefit from using a small set of strong solvers rather than relying on a single method. The presentation also illustrates an in-silico chemical reactor case study showing that data-driven optimization methods can guide autonomous experimentation in a self-driving laboratory and identify optimal operating conditions within a small number of experiments. Overall, the results provide a basis for selecting efficient optimization methods and demonstrate the practical use of data-driven optimization in self-driving laboratory workflows.

36 MATERIALS SCIENCE↗

Scalable Stochastic Transmission Expansion: A Use Case for ExaSGD

The intermittent nature of renewable energy poses new challenges for power grids due to its variable and un- certain power output. These features of renewable generation are becoming more relevant to transmission planning as grids reach higher penetration levels of renewable energy. In this paper we present an approach for transmission planning based on scalable computational approaches which enable the explicit consideration of operational uncertainties in the planning process. Using three-stage stochastic programming and the progressive hedging algorithm, we compute transmission expansion decisions on a modified RTS-GMLC test system. We augment the grid with large amounts of wind generation and consider many operational scenarios subject to wind uncertainty. This is an example of a possible use of the ExaSGD security constrained AC optimal power flow solver.

Exascale Computing Project↗

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗

The Apollo Lunar Roving Vehicle.

After listing the basic requirements such as operational demands and lunar environmental conditions, characteristic design data of the roving vehicle are given with special attention to the four wheel drive and its control system, the steering system, and the navigational instrumentation. The overall system is optimized in view of total mass, range, mobility, load carrying capability, safety, highest reliability through redundancy, and last but not least, cost and development time. Optimization of the drive and power system has first been evaluated by mathematical models and computational simulation of the vehicle hardware, the wheel/soil interaction, and the lunar terrain profile. The next step to refine optimization and evaluation of the drive, steering, and power system including man/machine interaction has been carried out by the use of a six-degree-of-freedom simulator subjecting the astronauts in their space suits to simulated vehicle motions while driving over a simulated terrain, observable on a cathode ray tube display.

Haeussermann, W.↗

Development of Explainable Data-Driven Turbulence Models with Application to Liquid Fuel Nuclear Reactors

Liquid fuel nuclear reactors offer innovative possibilities in terms of nuclear reactor designs and passive safety systems. Molten Salts Reactors (MSRs) with a fast spectrum are a particular type of these reactors using liquid fuel. MSFRs often involve large open cavities in their core in which the liquid fuel circulates at a high speed to transport the heat generated by the nuclear reactions into the heat exchangers. This high-speed flow yields a turbulent field with large Reynolds numbers in the reactor core. Since the nuclear power, the neutron precursor’s transport and the thermal exchanges are strongly coupled in the MSFR’s core cavity, having accurate turbulent models for the liquid fuel flow is necessary to avoid introducing significant errors in the numerical simulations of these reactors. Nonetheless, high-accuracy simulations of the turbulent flow field in the reactor cavity of these reactors are usually prohibitively expensive in terms of computational resources, especially when performing multiphysics numerical calculations. Therefore, in this work, we propose a novel method using a modified genetic algorithm to optimize the calculation of the Reynolds Shear Stress Tensor (RST) used for turbulence modeling. The proposed optimization methodology is particularly suitable for advanced liquid fuel reactors such as the MSFRs since it allows the development of high-accuracy but still low-computational-cost turbulence models for the liquid fuel. We demonstrate the applicability of this approach by developing high accuracy Reynolds-Averaged Navier–Stokes (RANS) models (averaged flow error less than 5%) for a low and a large aspect ratio in a Backward-Facing Step (BFS) section particularly challenging for RANS models. The newly developed turbulence models better capture the flow field after the boundary layer tipping, over the extent of the recirculation bubble, and near the boundary layer reattachment region in both BFS configurations. The main reason for these improvements is that the developed models better capture the flow field turbulent anisotropy in the bulk region of the BFS. Then, we illustrate the interest in using this turbulence modeling approach for the case of an MSFR by quantifying the impact of the turbulence modeling on the reactor key parameters.

42 ENGINEERING↗

Acceleration of Graph Neural Network-Based Prediction Models in Chemistry via Co-Design Optimization on Intelligence Processing Units

Atomic structure prediction and associated property calculations are the bedrock of chemical physics. Since high-fidelity ab initio modeling techniques for computing the structure and properties can be prohibitively expensive, this motivates the development of machine-learning (ML) models that make these predictions more efficiently. Training graph neural networks over large atomistic databases introduces unique computational challenges such as the need to process millions of small graphs with variable size and support communication patterns that are distinct from learning over large graphs such as social networks. We demonstrate a novel hardware-software co-design approach to scale up the training of atomistic graph neural networks (GNN) for structure and property prediction. First, to eliminate redundant computation and memory associated with alternative padding techniques and to improve throughput via minimizing communication, we formulate the effective coalescing of the batches of variable-size atomistic graphs as the bin packing problem and introduce a hardware-agnostic algorithm to pack these batches. In addition, we propose hardware-specific optimizations including a planner and vectorization for the gather-scatter operations targeted for Graphcore’s Intelligence Processing Unit (IPU), as well as model-specific optimizations such as merged communication collectives and optimized softplus. Putting these all together, we demonstrate the effectiveness of the proposed co-design approach by providing an implementation of a well-established atomistic GNN on the Graphcore IPUs. We evaluate the training performance on multiple atomistic graph databases with varying degrees of graph counts, sizes and sparsity. Here, we demonstrate that such a co-design approach can reduce the training time of atomistic GNNs and can improve the performance by up to 1.5× compared to the baseline implementation of the model on the IPUs. Additionally, we compare our IPU implementation with a Nvidia GPU-based implementation and show that our atomistic GNN implementation on the IPUs can run 1.8× faster on average compared to the execution time on the GPUs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Surrogate Model Selection for Design Space Approximation And Surrogatebased Optimization

Surrogate models are used to map input data to output data when the actual relationship between the two is unknown or computationally expensive to evaluate for sensitivity analysis, uncertainty propagation and surrogate based optimization. This work evaluates the performance of eight surrogate modeling techniques for design space approximation and surrogate based optimization applications over a set of generated datasets with known characteristics. With this work, we aim to provide general rules for selecting an appropriate surrogate model form solely based on the characteristics of the data being modeled. Furthermore, the computational experiments revealed that, in general, multivariate adaptive regression spline models (MARS) and single hidden layer feed forward neural networks (ANN) yielded the most accurate predictions over the design space while Random Forest (RF) models most reliably identified the locations of the optimums when used for surrogate-based optimization.

97 MATHEMATICS AND COMPUTING↗

CAMELOT: A machine learning approach for coarse-grained simulations of aggregation of block-copolymeric protein sequences

We report the development and deployment of a coarse-graining method that is well suited for computer simulations of aggregation and phase separation of protein sequences with block-copolymeric architectures. Our algorithm, named CAMELOT for Coarse-grained simulations Aided by MachinE Learning Optimization and Training, leverages information from converged all atom simulations that is used to determine a suitable resolution and parameterize the coarse-grained model. To parameterize a system-specific coarse-grained model, we use a combination of Boltzmann inversion, non-linear regression, and a Gaussian process Bayesian optimization approach. The accuracy of the coarse-grained model is demonstrated through direct comparisons to results from all atom simulations. We demonstrate the utility of our coarse-graining approach using the block-copolymeric sequence from the exon 1 encoded sequence of the huntingtin protein. This sequence comprises of 17 residues from the N-terminal end of huntingtin (N17) followed by a polyglutamine (polyQ) tract. Simulations based on the CAMELOT approach are used to show that the adsorption and unfolding of the wild type N17 and its sequence variants on the surface of polyQ tracts engender a patchy colloid like architecture that promotes the formation of linear aggregates. These results provide a plausible explanation for experimental observations, which show that N17 accelerates the formation of linear aggregates in block-copolymeric N17-polyQ sequences. The CAMELOT approach is versatile and is generalizable for simulating the aggregation and phase behavior of a range of block-copolymeric protein sequences.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PDE-constrained high-order mesh optimization

Here, we present a novel framework for PDE-constrained r-adaptivity of high-order meshes. The proposed method formulates mesh movement as an optimization problem, with an objective function defined as a convex combination of a mesh quality metric and a measure of the accuracy of the PDE solution obtained via finite element discretization. The proposed formulation achieves optimized, well-defined high-order meshes by integrating mesh quality control, PDE solution accuracy, and robust gradient regularization. We adopt the Target-Matrix Optimization Paradigm to control geometric properties across the mesh, independent of the PDE of interest. To incorporate the accuracy of the PDE solution, we introduce error measures that control the finite element discretization error. The implicit dependence of these error measures on the mesh nodal positions is accurately captured by adjoint sensitivity analysis. Additionally, a convolution-based gradient regularization strategy is used to ensure stable and effective adaptation of high-order meshes. We demonstrate that the proposed framework can improve mesh quality and reduce the error by up to 10 times for the solution of Poisson and linear elasto-static problems. The approach is general with respect to the dimensionality, the order of the mesh, the types of mesh elements, and can be applied to any PDE that admits well-defined adjoint operators.

Computer science↗

Parametric and Sensitivity Analysis of a Steam Generator Model Using Python and Machine-Learning Tools

For this study, we used Python and machine-learning tools to perform a comprehensive parametric and sensitivity analysis on a steam generator (SG) model. (The Python model was based on a previously completed MATLAB framework for the Holtec SMR-160 SG.) We investigated the influence of various input parameters (e.g., heat transfer coefficient [HTC], Nusselt number, and heat exchanger effectiveness) on the system’s output. With machine-learning tools such as the Risk Analysis Virtual Environment (RAVEN), which was developed at Idaho National Laboratory, we were then able to perform an automated analysis of the SG inputs’ effect on the HTC. The analysis results give valuable insights into the performance and optimization of SG systems. We found the inlet mass flow rate (MFR) to have the greatest impact on the HTC, followed closely by the inlet temperature, and then pressure. Shifting of the input parameters causes the location of the maximum HTC along the SG length to change incrementally. The cold leg (CL) MFR was also found to impact the HTC magnitude as well as the location of the maximum HTC. At between 0.4–0.9 of the total SG length, the input parameters experience maximum impact on the HTC, leading us to suggest that sensors be efficiently placed on the SG so as to closely and effectively monitor thermal-hydraulic properties during reactor operation. We also found that the sensitivity data calculated manually agrees with the RAVEN – based data, confirming the same range of maximum sensitivity. However, the RAVEN-based analysis showed that cold leg pressure and hot leg temperature have a greater impact on the heat transfer coefficient than the mass flow rate, implying that a manual sensitivity study taking only two samples is not accurate.

20 FOSSIL-FUELED POWER PLANTS↗

Robust optimization of metal forming processes using a metamodel-based strategy

Robustness, optimization and Finite Element (FE) simulations are of major importance for achieving better products and cost reductions in the metal forming industry. In this paper, a metamodel-based robust optimization strategy is proposed for metal forming processes. The applicability of the strategy is demonstrated by application to an analytical test function and an industrial V-bending process. The results of both applications underline the importance of including uncertainty and robustness explicitly in the optimization procedure.

36 MATERIALS SCIENCE↗

spopt: a python package for solving spatial optimization problems in PySAL

Spatial optimization is a major spatial analytical tool in management and planning, the significance of which cannot be overstated. Spatial optimization models play an important role in designing and managing effective and efficient service systems such as transportation, education, public health, environmental protection, and commercial investment among others. To this end, spopt (spatial optimization) is under active development for the inclusion of newly proposed models and methods for regionalization, facility location, and transportation-oriented solutions (Feng et al., 2021). Spopt is a submodule in the open-source spatial analysis library PySAL (Python Spatial Analysis Library) founded by Dr. Sergio J. Rey and Dr. Luc Anselin in 2005 (Rey et al., 2015, 2021; Rey & Anselin, 2007). The goal of developing spopt is to provide management and decision-making support to all relevant practitioners and to further promote the appropriate and meaningful application of spatial optimization models in practice.

97 MATHEMATICS AND COMPUTING↗

The Secret Life of Quarks, Final Report for the University of North Carolina at Chapel Hill

This final report summarizes activities and results at the University of North Carolina as part of the the SciDAC-2 Project The Secret Life of Quarks: National Computational Infrastructure for Lattice Quantum Chromodynamics. The overall objective of the project is to construct the software needed to study quantum chromo- dynamics (QCD), the theory of the strong interactions of subatomic physics, and similar strongly coupled gauge theories anticipated to be of importance in the LHC era. It built upon the successful efforts of the SciDAC-1 project National Computational Infrastructure for Lattice Gauge Theory, in which a QCD Applications Programming Interface (QCD API) was developed that enables lat- tice gauge theorists to make effective use of a wide variety of massively parallel computers. In the SciDAC-2 project, optimized versions of the QCD API were being created for the IBM Blue- Gene/L (BG/L) and BlueGene/P (BG/P), the Cray XT3/XT4 and its successors, and clusters based on multi-core processors and Infiniband communications networks. The QCD API is being used to enhance the performance of the major QCD community codes and to create new applications. Software libraries of physics tools have been expanded to contain sharable building blocks for inclusion in application codes, performance analysis and visualization tools, and software for au- tomation of physics work flow. New software tools were designed for managing the large data sets generated in lattice QCD simulations, and for sharing them through the International Lattice Data Grid consortium. As part of the overall project, researchers at UNC were funded through ASCR to work in three general areas. The main thrust has been performance instrumentation and analysis in support of the SciDAC QCD code base as it evolved and as it moved to new computation platforms. In support of the performance activities, performance data was to be collected in a database for the purpose of broader analysis. Third, the UNC work was done at RENCI (Renaissance Computing Institute), which has extensive expertise and facilities for scientific data visualization, so we acted in an ongoing consulting and support role in that area.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Predictive drug dosage control through a Fokker–Planck observer

During the years, various techniques have been presented for optimal control of tumor growth for which its stochastic behavior has rarely been considered. This article uses the well-known Gompertz stochastic model, for describing tumor growth, and by receding horizon model predictive control (RH-MPC) scheme computes the drug dosage for minimizing the tumor-cell population. To do this, a predictive control problem is defined based on the difference between the probability density function of tumor-cell population and the desired probability density function. In the model, both the drug dosage limitation and the Fokker–Planck equation have been considered as constraints. By solving this problem, the drug dosage which is considered as an external input to tumor model, is computed. In this article, the Fokker–Planck equation is used (1) as a nonlinear observer of probability density function of tumor-cell population and (2) a mapping vehicle from stochastic to deterministic domain. The Fokker–Planck equation is written for the Gompertz stochastic model of tumor growth. The equation is then solved through the path integral method. In this way, the probability density function of tumor-cell population, which contains the entire stochastic characteristics of the tumor growth, is obtained for any instance of time. The simulation results have also been presented for the evaluation of the suggested approach. The results show that the tumor-cell population can be controlled within a number of time windows (15 time windows in our case study) if an appropriate desired PDF is selected.

97 MATHEMATICS AND COMPUTING↗