Search NASA⌕ Search

SEARCH · Search NASA

Results for “computationally expensive function”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

A Portfolio Approach to Massively Parallel Bayesian Optimization

One way to reduce the time of conducting optimization studies is to evaluate designs in parallel rather than just one-at-a-time. For expensive-to-evaluate black-boxes, batch versions of Bayesian optimization have been proposed. They work by building a surrogate model of the black-box to simultaneously select multiple designs via an infill criterion. Still, despite the increased availability of computing resources that enable large-scale parallelism, the strategies that work for selecting a few tens of parallel designs for evaluations become limiting due to the complexity of selecting more designs. It is even more crucial when the black-box is noisy, necessitating more evaluations as well as repeating experiments. Here we propose a scalable strategy that can keep up with massive batching natively, focused on the exploration/exploitation trade-off and a portfolio allocation. We compare the approach with related methods on noisy functions, for mono and multi-objective optimization tasks. These experiments show orders of magnitude speed improvements over existing methods with similar or better performance.

97 MATHEMATICS AND COMPUTING↗

Performance of an Optimized Eta Model Code on the Cray T3E and a Network of PCs

In the year 2001, NASA will launch the satellite TRIANA that will be the first Earth observing mission to provide a continuous, full disk view of the sunlit Earth. As a part of the HPCC Program at NASA GSFC, we have started a project whose objectives are to develop and implement a 3D cloud data assimilation system, by combining TRIANA measurements with model simulation, and to produce accurate statistics of global cloud coverage as an important element of the Earth's climate. For simulation of the atmosphere within this project we are using the NCEP/NOAA operational Eta model. In order to compare TRIANA and the Eta model data on approximately the same grid without significant downscaling, the Eta model will be integrated at a resolution of about 15 km. The integration domain (from -70 to +70 deg in latitude and 150 deg in longitude) will cover most of the sunlit Earth disc and will continuously rotate around the globe following TRIANA. The cloud data assimilation is supposed to run and produce 3D clouds on a near real-time basis. Such a numerical setup and integration design is very ambitious and computationally demanding. Thus, though the Eta model code has been very carefully developed and its computational efficiency has been systematically polished during the years of operational implementation at NCEP, the current MPI version may still have problems with memory and efficiency for the TRIANA simulations. Within this work, we optimize a parallel version of the Eta model code on a Cray T3E and a network of PCs (theHIVE) in order to improve its overall efficiency. Our optimization procedure consists of introducing dynamically allocated arrays to reduce the size of static memory, and optimizing on a single processor by splitting loops to limit the number of streams. All the presented results are derived using an integration domain centered at the equator, with a size of 60 x 60 deg, and with horizontal resolutions of 1/2 and 1/3 deg, respectively. In accompanying charts we report the elapsed time, the speedup and the Mflops as a function of the number of processors for the non-optimized version of the code on the T3E and theHIVE. The large amount of communication required for model integration explains its poor performance on theHIVE. Our initial implementation of the dynamic memory allocation has contributed to about 12% reduction of memory but has introduced a 3% overhead in computing time. This overhead was removed by performing loop splitting in some of the high demanding subroutines. When the Eta code is fully optimized in order to meet the memory requirement for TRIANA simulations, a non-negligeable overhead may appear that may seriously affect the efficiency of the code. To alleviate this problem, we are considering implementation of a new algorithm for the horizontal advection that is computationally less expensive, and also a new approach for marching in time.

Kouatchou, Jules↗

The small-voxel tracking algorithm for simulating chemical reactions among diffusing molecules

Simulating the evolution of a chemically reacting system using the bimolecular propensity function, as is done by the stochastic simulation algorithm and its reaction-diffusion extension, entails making statistically inspired guesses as to where the reactant molecules are at any given time. Those guesses will be physically justified if the system is dilute and well-mixed in the reactant molecules. Otherwise, an accurate simulation will require the extra effort and expense of keeping track of the positions of the reactant molecules as the system evolves. One molecule-tracking algorithm that pays careful attention to the physics of molecular diffusion is the enhanced Green's function reaction dynamics (eGFRD) of Takahashi, Tănase-Nicola, and ten Wolde [Proc. Natl. Acad. Sci. U.S.A. 107, 2473 (2010)]. We introduce here a molecule-tracking algorithm that has the same theoretical underpinnings and strategic aims as eGFRD, but a different implementation procedure. Called the small-voxel tracking algorithm (SVTA), it combines the well known voxel-hopping method for simulating molecular diffusion with a novel procedure for rectifying the unphysical predictions of the diffusion equation on the small spatiotemporal scale of molecular collisions. Indications are that the SVTA might be more computationally efficient than eGFRD for the problematic class of non-dilute systems. A widely applicable, user-friendly software implementation of the SVTA has yet to be developed, but we exhibit some simple examples which show that the algorithm is computationally feasible and gives plausible results.

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems

Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.

optimal power flow, power distribution systems, su↗

Autonomous spacecraft attitude control using magnetic torquing only

Magnetic torquing of spacecraft has been an important mechanism for attitude control since the earliest satellites were launched. Typically a magnetic control system has been used for precession/nutation damping for gravity-gradient stabilized satellites, momentum dumping for systems equipped with reaction wheels, or momentum-axis pointing for spinning and momentum-biased spacecraft. Although within the small satellite community there has always been interest in expensive, light-weight, and low-power attitude control systems, completely magnetic control systems have not been used for autonomous three-axis stabilized spacecraft due to the large computational requirements involved. As increasingly more powerful microprocessors have become available, this has become less of an impediment. These facts have motivated consideration of the all-magnetic attitude control system presented here. The problem of controlling spacecraft attitude using only magnetic torquing is cast into the form of the Linear Quadratic Regulator (LQR), resulting in a linear feedback control law. Since the geomagnetic field along a satellite trajectory is not constant, the system equations are time varying. As a result, the optimal feedback gains are time-varying. Orbit geometry is exploited to treat feedback gains as a function of position rather than time, making feasible the onboard solution of the optimal control problem. In simulations performed to date, the control laws have shown themselves to be fairly robust and a good candidate for an onboard attitude control system.

Musser, Keith L.↗

The SRT reconstruction algorithm for semiquantification in PET imaging

Purpose: The spline reconstruction technique (SRT) is a new, fast algorithm based on a novel numerical implementation of an analytic representation of the inverse Radon transform. The mathematical details of this algorithm and comparisons with filtered backprojection were presented earlier in the literature. In this study, the authors present a comparison between SRT and the ordered-subsets expectation–maximization (OSEM) algorithm for determining contrast and semiquantitative indices of {sup 18}F-FDG uptake. Methods: The authors implemented SRT in the software for tomographic image reconstruction (STIR) open-source platform and evaluated this technique using simulated and real sinograms obtained from the GE Discovery ST positron emission tomography/computer tomography scanner. All simulations and reconstructions were performed in STIR. For OSEM, the authors used the clinical protocol of their scanner, namely, 21 subsets and two iterations. The authors also examined images at one, four, six, and ten iterations. For the simulation studies, the authors analyzed an image-quality phantom with cold and hot lesions. Two different versions of the phantom were employed at two different hot-sphere lesion-to-background ratios (LBRs), namely, 2:1 and 4:1. For each noiseless sinogram, 20 Poisson realizations were created at five different noise levels. In addition to making visual comparisons of the reconstructed images, the authors determined contrast and bias as a function of the background image roughness (IR). For the real-data studies, sinograms of an image-quality phantom simulating the human torso were employed. The authors determined contrast and LBR as a function of the background IR. Finally, the authors present plots of contrast as a function of IR after smoothing each reconstructed image with Gaussian filters of six different sizes. Statistical significance was determined by employing the Wilcoxon rank-sum test. Results: In both simulated and real studies, SRT exhibits higher contrast and lower bias than OSEM at the cold lesions. This improvement is achieved at the expense of increasing the noise in the reconstructed images. For the hot lesions, SRT exhibits a small improvement in contrast and LBR over OSEM with 21 subsets and two iterations; however, this improvement is not statistically significant. As the number of iterations increases, the performance of OSEM improves over SRT but again without statistical significance. The curves of contrast and LBR as a function of IR after Gaussian blurring indicate that the advantage of SRT in the cold regions is maintained even after decreasing the noise level by Gaussian blurring. Conclusions: SRT, at the expense of slightly increased noise in the reconstructed images, reconstructs images of higher contrast and lower bias than the clinical protocol of OSEM. This improvement is particularly evident for images involving cold regions. Thus, it appears that SRT should be particularly useful for the quantification of low-count and cold regions.

60 APPLIED LIFE SCIENCES↗

Fluid temperature predictions of geothermal borefields using load estimations via state observers

Fluid temperature predictions of geothermal borefields usually involves temporal superposition of its characteristic g-function, using load aggregation schemes to reduce computational times. Assuming that the ground has linear properties, it can be modeled as a linear state space system where the states are the aggregated loads. However, the application and accuracy of these models is compromised when the borefield is already operating and its load history is not registered or there are gaps in the data. This paper assesses the performance of state observers to estimate the borefield load history and obtain accurate fluid predictions. Results show that both Time-Varying Kalman Filter (TVKF) and Moving Horizon Estimator (MHE) provide predictions with average and maximum errors below 0.1 $^\circ C$ and 1 $^\circ C$ respectively. MHE outperforms TVKF in terms of n-step ahead output predictions and load history profile at the expenses of about 5 times more computational time.

Figueroa, Iago C.↗

Highly scalable distributed-memory sparse triangular solution algorithms.

This paper presents a highly efficient distributed-memory parallel sparse triangular solver. The triangular solution phase is often performed following factorization phase in the sparse linear solvers and has become increasingly computa­tionally expensive for direct solvers with many right hand sides (RHSs) or preconditioned iterative solvers. However, the low arithmetic intensity and sequential nature of the triangular solve algorithm pose performance challenges for its large-scale distributed-memory parallelization. In this work, we propose several strategies to enhance scalability of an algorithm with 2D block cyclic process layout. First, an asynchronous binary-tree-based communication scheme implemented via non-blocking MPI functions is leveraged to broadcast partial solutions and reduce partial updates among a subset of processes for each block column and row of the triangular matrix, respectively. This scheme reduces message latency, improves communication load balance and significantly accelerates asynchronous execution of the triangular solve. In addition, efficient BLAS operations and threading implementations are exploited to accelerate local computations and further reduce process idle time. The proposed strategies are implemented in SuperLU_DIST and numerical experiments show up to 4.4x improvement with one right-hand side and up to 6.1x improvement with 50 right- hand sides on 4096 processes, compared to the current release. This is the first time that sparse triangular solution is demonstrated strong scaling on more than 4000 cores.

Liu, Yang↗

Efficient Stochastic Inversion Using Adjoint Models and Kernel-PCA

Performing stochastic inversion on a computationally expensive forward simulation model with a high-dimensional uncertain parameter space (e.g. a spatial random field) is computationally prohibitive even with gradient information provided. Moreover, the ‘nonlinear’ mapping from parameters to observables generally gives rise to non-Gaussian posteriors even with Gaussian priors, thus hampering the use of efficient inversion algorithms designed for models with Gaussian assumptions. In this work, we propose a novel Bayesian stochastic inversion methodology, characterized by a tight coupling between a gradient-based Langevin Markov Chain Monte Carlo (LMCMC) method and a kernel principal component analysis (KPCA). This approach addresses the ‘curse-of-dimensionality’ via KPCA to identify a low-dimensional feature space within the high-dimensional and nonlinearly correlated spatial random field. Moreover, non-Gaussian full posterior probability distribution functions are estimated via an efficient LMCMC method on both the projected low-dimensional feature space and the recovered high-dimensional parameter space. We demonstrate this computational framework by integrating and adapting recent developments such as data-driven statistics-on-manifolds constructions and reduction-through-projection techniques to solve inverse problems in linear elasticity.

97 MATHEMATICS AND COMPUTING↗

First-Order Model Management With Variable-Fidelity Physics Applied to Multi-Element Airfoil Optimization

First-order approximation and model management is a methodology for a systematic use of variable-fidelity models or approximations in optimization. The intent of model management is to attain convergence to high-fidelity solutions with minimal expense in high-fidelity computations. The savings in terms of computationally intensive evaluations depends on the ability of the available lower-fidelity model or a suite of models to predict the improvement trends for the high-fidelity problem, Variable-fidelity models can be represented by data-fitting approximations, variable-resolution models. variable-convergence models. or variable physical fidelity models. The present work considers the use of variable-fidelity physics models. We demonstrate the performance of model management on an aerodynamic optimization of a multi-element airfoil designed to operate in the transonic regime. Reynolds-averaged Navier-Stokes equations represent the high-fidelity model, while the Euler equations represent the low-fidelity model. An unstructured mesh-based analysis code FUN2D evaluates functions and sensitivity derivatives for both models. Model management for the present demonstration problem yields fivefold savings in terms of high-fidelity evaluations compared to optimization done with high-fidelity computations alone.

Alexandrov, N. M.↗

Catalytic Deoxydehydration of Carbohydrates and Polyols to Chemicals and Fuels

As the world's fossil fuel resources are being depleted and their costs increase, there is an urgent need to discover and develop new processes for the conversion of renewable, biomass resources into fuels and chemical feedstocks. Research and development in this area have been given high priority by both governmental agencies and industry. To increase the energy content and decrease the boiling points of biomass-derived carbohydrates and polyols to the useful liquid range it is necessary to chemically remove water (dehydrate) and, preferably, oxygen (deoxygenate/reduce). The poly-hydroxylic nature of carbohydrates is attractive for their use as functionalized chemical building blocks, but it presents a daunting challenge for their selective conversion to single product chemicals or fuels. The long term, practical objective of this project is to develop catalytic processes for the deoxydehydration (DODH) of biomass-derived carbohydrates and polyols to produce unsaturated alcohols and hydrocarbons of value as chemical feedstocks and fuels; DODH: polyol + reductant --(LMOx catalyst)--> unsaturate + oxidized reductant + H2O. Limited prior studies have established the viability of the DODH process with expensive phosphine reductants and rhenium-catalysts. Initial studies in the PI's laboratory have now demonstrated: 1) the moderately efficient conversion of glycols to olefins by the economical sulfite salts is catalyzed by MeReO3 and Z+ReO4-; 2) effective phosphine-based catalytic DODH of representative glycols to olefins by cheap LMoO2 complexes; and 3) computational studies (with K. Houk, UCLA) have identified several Mo-, W-, and V-oxo complexes that are likely to catalyze glycol DODH. Seeking practically useful DODH reactions of complex polyols and new understanding of the reactivity of polyoxo-metal species with biomass-oxygenates we will employ a two-pronged approach: 1) investigate experimentally the reactivity, both stoichiometric and catalytic, of polyoxo-complexes and practical reductants with representative polyols to establish structure/reactivity relationships and reaction mechanisms; and b) carry out parallel computational studies of these reactions and their mechanisms- both analytical and predictive. Our prioritized action plan is: (1) to optimize the catalytic efficiency, assess the substrate scope/selectivity, and address key mechanistic aspects of Re-catalyzed, sulfite-driven DODH reactions; (2) use the findings from (1), together with computational predictions, to discover new, effective non-precious metal catalysts for sulfite-driven DODH reactions; and 3) to initiate exploratory studies of CO- and H2-driven DODH. Successful execution of this research project will: 1) provide practical chemical processes for the conversion of biomass into useful chemicals and fuels: 2) bring fundamental new understanding of chemical reactions involving metal-oxo catalysts; and 3) provide educational and technical training of future energy scientists.

09 BIOMASS FUELS↗

Enabling Technologies for High-Throughput Screening of Nano-Porous Materials: Collaboration with the Nanoporous Materials Genome Center

The overarching goal of this research was to develop new methodologies to enable the accurate and efficient modeling of complex materials using computer simulations. Using inter-molecular interaction energies calculated via an accurate but computationally expensive approach (symmetry-adapted perturbation theory), we parameterized efficient next-generation “force fields” to utilize in subsequent simulations. Since the resulting force fields incorporate much of the relevant physics of inter-molecular interactions, they consequently exhibit high transferability from one material to another. This transferability enables the modeling of a wide range of novel materials without additional computational cost. While this approach is quite general, a particular emphasis of this research involved applications to so-called “metal-organic framework”(MOF) materials relevant to energy-intensive gas separations. We focused specifically on CO 2 /N 2 selectivity, which is a key metric for post combustion CO 2 capture efforts at coal-fired power plants. The gas adsorption capacities and selectivity of the MOFs can be tailored via careful functionalization. We have demonstrated that our force fields exhibit predictive accuracy for a wide variety of functionalized MOFs, thus opening the door for the computational design of “tailored” materials for particular separations. Finally, we have also demonstrated the importance of accounting for the presence of reactive contaminant species when evaluating the performance of MOFs in practical applications.

36 MATERIALS SCIENCE↗

Changes in polarization dictate necessary approximations for modeling electronic deexcitation intensity: Application to x-ray emission

Accurate simulation of electronic excitations and deexcitations are critical for complementing complex spectroscopic experiments and can provide validation to theoretical approaches. Here, using a generalized framework, we contrast the accuracy and validity of orbital-constrained and linear-response approaches that build upon Kohn-Sham density functional theory (DFT) to simulate emission spectra of electronic origin and propose an efficient approximation, named many-body x-ray emission spectroscopy or MBXES, for simulating such processes. We show analytically as well as with computed examples that for electronic (de)excitation leading to an appreciable change in polarization (i.e., density rearrangement), the adiabatic approximation in a response-based formalism will be inadequate for the calculation of oscillator strength. Thus, such a change (e.g., in the net electrostatic dipole moment of a finite system) can be used as a metric for evaluating the applicability of the adiabatic response-based approach and can be particularly valuable in x-ray emission spectroscopy. On the other hand, MBXES, the flexible method introduced in this paper, can compute oscillator strengths accurately at a much lower computational expense on the basis of two DFT-based self-consistent field calculations. Using illustrative examples of emission spectra, the efficacy of the MBXES method is demonstrated by comparison with its parent theory, orbital-optimized DFT, and with experiments.

74 ATOMIC AND MOLECULAR PHYSICS↗

SOFTC: A Software Correlator for VLBI

SOFTC is an advanced software implementation of a signal correlator for very-long-baseline interferometry (VLBI) for measuring positions of natural celestial objects and distant spacecraft. Because of increases in processing speeds of general-purpose computers, software VLBI correlators have become viable alternatives to hardware ones. The input to SOFTC consists of digitized samples of raw VLBI-antenna received- signal voltages. Optionally, SOFTC also tracks calibration tones superimposed on the received signals. The outputs of SOFTC are (1) phases and amplitudes as functions of time and frequency for cross-correlated received signals and (2) phases and amplitudes as functions of time, station, and tone number for the calibration tones. SOFTC was created to be as accurate as possible, capable of processing essentially any VLBI data, pass strong debugging tests, have a simple user interface, and have no platform dependencies. SOFTC is written modularly in the C programming language. The great advantage of implementing a correlator in software, in contradistinction to hardware, is that it becomes relatively easy and much less expensive and time-consuming to adapt, modify, improve, and update the correlator.

Lowe, Stephen↗

Simple Ion Channels: From Structure to Electrophysiology and Back

A reliable way to establish whether our understanding of a channel is satisfactory is to reproduce its measured ionic conductance over a broad range of applied voltages in computer simulations. In molecular dynamics (MD), this can be done by way of applying an external electric field to the system and counting the number of ions that traverse the channel per unit time. Since this approach is computationally very expensive, we have developed a markedly more efficient alternative in which MD is combined with the electrodiffusion (ED) equation. In this approach, the assumptions of the ED equation can be rigorously tested, and the precision and consistency of the calculated conductance can be determined. We have demonstrated that the full current/voltage dependence and the underlying free energy profile for a simple channel can be reliably calculated from equilibrium or non-equilibrium MD simulations at a single voltage. To carry out MD simulations, a structural model of a channel has to be assumed, which is an important constraint, considering that high-resolution structures are available for only very few simple channels. If the comparison of calculated ionic conductance with electrophysiological data is satisfactory, it greatly increases our confidence that the structure and the function are described sufficiently accurately. We examined the validity of the ED for several channels embedded in phospholipid membranes - four naturally occurring channels: trichotoxin, alamethicin, p7 from hepatitis C virus (HCV) and Vpu from the HIV-1 virus, and a synthetic, hexameric channel, formed by a 21-residue peptide that contains only leucine and serine. All these channels mediate transport of potassium and chloride ions. It was found that the ED equation is satisfactory for these systems. In some of them experimental and calculated electrophysiological properties are in good agreement, whereas in others there are strong indications that the structural models are incorrect.

molecular dynamics (MD↗

Improvements in Block-Krylov Ritz Vectors and the Boundary Flexibility Method of Component Synthesis

A method of dynamic substructuring is presented which utilizes a set of static Ritz vectors as a replacement for normal eigenvectors in component mode synthesis. This set of Ritz vectors is generated in a recurrence relationship, proposed by Wilson, which has the form of a block-Krylov subspace. The initial seed to the recurrence algorithm is based upon the boundary flexibility vectors of the component. Improvements have been made in the formulation of the initial seed to the Krylov sequence, through the use of block-filtering. A method to shift the Krylov sequence to create Ritz vectors that will represent the dynamic behavior of the component at target frequencies, the target frequency being determined by the applied forcing functions, has been developed. A method to terminate the Krylov sequence has also been developed. Various orthonormalization schemes have been developed and evaluated, including the Cholesky/QR method. Several auxiliary theorems and proofs which illustrate issues in component mode synthesis and loss of orthogonality in the Krylov sequence have also been presented. The resulting methodology is applicable to both fixed and free- interface boundary components, and results in a general component model appropriate for any type of dynamic analysis. The accuracy is found to be comparable to that of component synthesis based upon normal modes, using fewer generalized coordinates. In addition, the block-Krylov recurrence algorithm is a series of static solutions and so requires significantly less computation than solving the normal eigenspace problem. The requirement for less vectors to form the component, coupled with the lower computational expense of calculating these Ritz vectors, combine to create a method more efficient than traditional component mode synthesis.

Carney, Kelly Scott↗

Optimizing Discharge Capacity of Li-O 2 Batteries by Design of Air-Electrode Porous Structure: Multifidelity Modeling and Optimization

We develop a new mathematical framework to study the optimal design of air electrode microstructures for lithium-oxygen (Li-O2) batteries. It can eectively reduce the number of expensive experiments for testing dierent air-electrodes, thereby minimizing the cost in the design of Li-O2 batteries. The design parameters to characterize an air-electrode microstructure include the porosity, surface-to-volume ratio, and parameters associated with the pore-size distribution. A surrogate model (also known as response surface) for discharge capacity is rst constructed as a function of these design parameters. The surrogate model is accurate and easy to evaluate such that an optimization can be performed based on it. In particular, a Gaussian process regression method, co-kriging, is employed due to its accuracy and eciency in predicting high-dimensional responses from a combination of multidelity data. Specically, a small amount of data from high-delity simulations are combined with a large number of data obtained from computationally ecient low-delity simulations. The high-delity simulation is based on a multiscale modeling approach that couples the microscale (pore-scale) and macroscale (device-scale) models. Whereas, the low-delity simulation is based on an empirical macroscale model. The constructed response surface provides quantitative understanding and prediction about how air electrode microstructures aect the discharge performance of Li-O2 batteries. The succeeding sensitivity analysis via Sobol indices and optimization via genetic algorithm ultimately oer a reliable guidance on the optimal design of air electrode microstructures. The proposed mathematical framework can be generalized to investigate other new energy storage techniques and materials.

25 ENERGY STORAGE↗

Bayesian optimization for inverse calibration of expensive computer models: A case study for Johnson-Cook model in machining

Inverse model calibration for identifying the constitutive model parameters can be computationally demanding for expensive-to-evaluate simulation models. Here, this paper presents a modified Bayesian optimization (BO) method, denoted as BO-bound, that incorporates theoretical bounds on the quantity of interest. A case study for the inverse calibration of the Johnson Cook (J-C) flow stress model parameters is presented using machining (cutting) force data. The results show fast calibration of the five J-C parameters within 25 simulations. In general, the BO-bound method is applicable for inverse calibration of any expensive simulation models as well as optimization problems with known bounds.

Bayesian optimization↗