Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimality”

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

A Novel Method for Controlling Crud Deposition in Nuclear Reactors Using Optimization Algorithms and Deep Neural Network Based Surrogate Models

This work presents the use of a high-fidelity neural network surrogate model within a Modular Optimization Framework for treatment of crud deposition as a constraint within light-water reactor core loading pattern optimization. The neural network was utilized for the treatment of crud constraints within the context of an advanced genetic algorithm applied to the core design problem. This proof-of-concept study shows that loading pattern optimization aided by a neural network surrogate model can optimize the manner in which crud distributes within a nuclear reactor without impacting operational parameters such as enrichment or cycle length. Several analysis methods were investigated. Analysis found that the surrogate model and genetic algorithm successfully minimized the deviation from a uniform crud distribution against a population of solutions from a reference optimization in which the crud distribution was not optimized. Strong evidence is presented that shows boron deposition in crud can be optimized through the loading pattern. This proof-of-concept study shows that the methods employed provide a powerful tool for mitigating the effects of crud deposition in nuclear reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Design Methodology for Optimizing and Integrating Composite Materials in Gear Structures

The application of composite materials to gear structures is complex because of the gear shape, the need for precise dimensional tolerances, and the complex dynamic load condition. Methods are presented in this work to design and optimize an integrated composite hub-web structure that can be used as part of a hybrid composite-steel gear. The composite hub-web structure is a planar structure with a large decrease in thickness from the hub to the rim. Methods for design and optimization of this variable-thickness structure are presented along with a method for forming braided prepreg material to conform to the shape of this structure. A layered approach is presented that integrates cut plies or filler materials for thickness buildup with continuous-fiber layers for the primary load path. An additional gear design concept is presented that has an axially extended continuous-fiber composite structure that can be combined with the planar structure. A proposed optimization methodology is introduced where an optimized design is output for each type of optimization simulation. Through this process, composite knowledge can be incorporated in the optimization, and more control is given over the design during the process. The methods in this study provide a tool for designing and optimizing composite structures for gears and other high-power-density applications.

optimization↗

Optimal Experimental Design With Fast Neural Network Surrogate Models

Designing optimal experiments minimizes the uncertainty of results and maximizes the efficient use of resources. Herein, machine learning surrogate models and the approximate coordinate exchange (ACE) algorithm are used to determine optimum experimental designs over large or arbitrarily restrictive design spaces. Optimal experimental design is particularly salient in materials science where experiments are expensive and material properties must often be inferred indirectly. The proposed framework is demonstrated by finding optimal experiments with which the hidden constituent properties of composite materials can be most efficiently inferred from observable experimental outcomes. The optimum experimental design is given by an information-theoretic criteria, which maximizes the conditional mutual information between the hidden properties and the expected experimental outcomes. To perform tractable optimization a neural network is trained as a surrogate model to mimic a physics based simulation, which can calculate the expected experimental outcome based on a candidate experimental design and sampled constituent properties. The ACE algorithm is used to optimize over large design spaces with many tests and controlled parameters where an exhaustive search would be intractable even with the surrogate model. Using this approach, optimal experimental designs that are consistent with those produced by heuristic knowledge and established best practices are found; then optimal designs in larger design spaces where heuristic knowledge is unavailable are examined.

machine learning↗

Fast Aircraft Separation Calculations for Gradient Based Optimization of Airspace Simulations

Simulations of airspace operational concepts can play a significant role in determining future paradigms that would allow for a safe increase in airspace density. In particular, airspace simulations which are capable of handling large numbers of aircraft act as an enabling capability for the testing of proposed airspace operational concepts. Simulations allowing for gradient based optimization methods are particularly attractive, since they would potentially allow for an efficient and empirical means to derive best operational practices. These could also allow for vehicle multidisciplinary design and optimization studies to include air traffic management considerations as a discipline. But any large scale simulation of airspace operations must include some methodology for addressing airspace separation requirements, which in the most direct sense would be tracked in a manner that computationally grows as a quadratic function of the number of simulated aircraft. Efficient indirect methods have been developed in certain contexts to address this limitation. However, any means of addressing separation requirements in a gradient based optimization context should be implemented by functions which provide analytic derivative information to maximize numerical precision and computational efficiency. In this paper, a fast and differentiable separation metric is described in application to gradient based optimization of airspace operations. Rather than computing the separation distance between every pair of aircraft in a simulation, this method effectively reduces the problem to a smaller relevant set using a geometric decomposition. This method guarantees that the smallest distance at all points in simulated time is determined exactly. When used in an optimization constraint context, this guarantees that a minimum separation is maintained between all pairs of aircraft. The presented metric has logarithmic computational growth with respect to the number of simulated aircraft, and is shown to perform well in a series of notional 2D airspace optimization problems when used to enforce specified airborne separation constraints. Results show that this is notably faster than a direct pairwise distance computing metric for optimizations involving both small and large numbers of aircraft, yet enforce separation requirements to the same tolerance. It is shown that this favorable scalability is an enabling capability for more sophisticated air traffic management conceptual studies.

Optimization↗

Investigations of an Aeroelastic Optimization Benchmark Problem with MPhys and FUN3D

High-fidelity aeroelastic optimization capabilities are becoming more common in recent years. In this field, researchers typically present results on the design problems of greatest interest to them. The lack of consistency with respect to baseline configurations, design variables, objectives and constraints, etc., makes it difficult to compare approaches and creates an obstacle for the community to work together to advance the state of the art. The High-Fidelity Aeroelastic Optimization Benchmark Working Group has been established to create and study a series of benchmark aeroelastic optimization problems that the community can utilize to compare methods on the same optimization problem. This paper presents optimization results from NASA Langley Research Center for the first benchmark case of this series with analysis based on MPhys, a multiphysics library for OpenMDAO, and FUN3D, an unstructured computational fluid dynamics suite of tools. For the optimization case presented, it is demonstrated that a progression of increasing aerodynamic model fidelity reduces the wall time required to complete the optimization.

Aeroelasticity↗

Battery Pack Shape Optimization using Transient Heat Conduction Coupled with Cell-Discharge Analysis

Battery electric systems exhibit significant time-dependence, especially when evaluated in the context of an aircraft mission profile with continually changing power demands. Additionally, when evaluating battery-powered aircraft concepts, it is important to accurately compute the temperature of the batteries and properly characterize the thermal response of the system. The temperature of the batteries has a significant impact on cell performance, in addition to safety considerations of maintaining battery temperatures below their operating limit. Because of these considerations, battery models for preliminary design and optimization of aircraft should include the capability to accurately compute the temperature distribution within the battery pack. Furthermore, battery pack designs should be as light-weight as possible to maximize the pack energy density, while also considering battery temperature limits. Here, we demonstrate a simultaneous trajectory and shape optimization of a battery pack concept, using a transient heat transfer finite element model coupled with a time-varying cell-discharge battery model to provide this capability. Including the transient finite element problem in the loop enables accurate temperatures that can be passed back to the cell discharge model, while the cell discharge model can supply the finite element model with time-varying heat boundary conditions to the finite element problem, further benefiting the fidelity of the thermal response of the batteries. We first demonstrate the coupling capability between the battery cell-discharge model and the transient finite-element heat transfer through an optimization which computes the optimal current profile for the battery pack while ensuring the battery temperatures remain below their operational limit. We then build on this optimization by adding shape optimization to the problem, which allows us to consider a composite objective function which also minimizes the mass of the battery pack, while also producing an optimal current discharge profile.

Optimization↗

Battery Pack Shape Optimization using Transient Heat Conduction Coupled with Cell-Discharge Analysis

Battery electric systems exhibit significant time-dependence, especially when evaluated in the context of an aircraft mission profile with continually changing power demands. Additionally, when evaluating battery-powered aircraft concepts, it is important to accurately compute the temperature of the batteries and properly characterize the thermal response of the system. The temperature of the batteries has a significant impact on cell performance, in addition to safety considerations of maintaining battery temperatures below their operating limit. Because of these considerations, battery models for preliminary design and optimization of aircraft should include the capability to accurately compute the temperature distribution within the battery pack. Furthermore, battery pack designs should be as light-weight as possible to maximize the pack energy density, while also considering battery temperature limits. Here, we demonstrate a simultaneous trajectory and shape optimization of a battery pack concept, using a transient heat transfer finite element model coupled with a time-varying cell-discharge battery model to provide this capability. The transient finite-element analysis is done using TACS, and the cell-discharge battery model uses OpenMDAO and dymos. Including the transient finite element problem in the loop enables accurate temperatures that can be passed back to the cell discharge model, while the cell discharge model can supply the finite element model with time-varying heat boundary conditions, further benefiting the fidelity of the thermal response of the batteries. We first demonstrate the coupling capability between the battery cell-discharge model and the transient finite-element heat transfer through an optimization which computes the optimal current profile for the battery pack while ensuring the battery temperatures remain below their operational limit. We then build on this optimization by adding shape optimization to the problem, which allows us to consider a composite objective function which also minimizes the mass of the battery pack, while also producing an optimal current discharge profile.

Optimization↗

Investigations of an Aeroelastic Optimization Benchmark Problem with MPhys and FUN3D

High-fidelity aeroelastic optimization capabilities are becoming more common in recent years. In this field, researchers typically present results on the design problems of greatest interest to them. The lack of consistency with respect to baseline configurations, design variables, objectives and constraints, etc., makes it difficult to compare approaches and creates an obstacle for the community to work together to advance the state of the art. The High-Fidelity Aeroelastic Optimization Benchmark Working Group has been established to create and study a series of benchmark aeroelastic optimization problems that the community can utilize to compare methods on the same optimization problem. This paper presents optimization results from NASA Langley Research Center for the first benchmark case of this series with analysis based on MPhys, a multiphysics library for OpenMDAO, and FUN3D, an unstructured computational fluid dynamics suite of tools. For the optimization case presented, it is demonstrated that a progression of increasing aerodynamic model fidelity reduces the wall time required to complete the optimization.

CFD↗

A Modular Conjugate Heat Transfer Optimization Framework for Thermal Management of Electric Aircraft

Conjugate heat transfer (CHT) analysis and optimization is a powerful method for improving thermal management, as it simultaneously resolves the temperature distribution in both fluid and solid domains. This paper presents a modular, discrete adjoint-based CHT optimization capability integrated within the OpenMDAO/MPhys framework. A unique feature of the proposed framework is its flexibility to extend to multidisciplinary optimization, including aero-structural-thermal applications. The fluid domain is modeled using a finite-volume Computational Fluid Dynamics (CFD) solver, and the solid domain with a conduction heat transfer solver. A mixed Neumann-Dirichlet boundary condition is developed to enable full submersion of the solid geometry within the fluid domain, while ensuring consistent temperature and heat flux coupling at the CHT interface. Gradient-based optimization is performed; the gradients are efficiently computed using the discrete adjoint solvers implemented in DAFoam. To demonstrate the method, this paper considers two cases related to electric aircraft thermal management: a U-bend heat exchanger and an actively cooled battery pack. The U-bend case aims to minimize pressure loss while maximizing heat flux by changing the pipe geometry. The optimized design reduces pressure loss by 52.7% and increases total heat flux by 2.3%. In the battery pack case, a 3-by-3 cell configuration is cooled by ambient airflow, with constant heat generation prescribed in the cells. The battery casing shape serves as the design variable, and the objective function is a weighted sum of pressure loss and pack weight, subject to a maximum temperature constraint. The optimized design achieves a 44.6% reduction in pressure loss and a 1.5% reduction in weight, while satisfying the thermal constraint. To ensure the reliability of the optimized designs, this study validates coarse-mesh, steady-state predictions against fine-mesh unsteady simulations, demonstrating consistency within acceptable errors. This work demonstrates the potential of the developed framework to enable rapid, high-fidelity design of thermal management systems for electric aircraft.

heat transfer↗

Mathematical Model of a Regenerative Fuel Cell for System Optimization

This thesis developed a system-level optimization model of a regenerative fuel cell (RFC) system for long-duration, off-world energy storage applications. Prior RFC design studies have typically been limited to reduced parameter sets and simplified constraints due to computational limitations relative to the number of relevant degrees of freedom. As a result, important nonlinear interactions between subsystems have not been fully captured. This work began to address that gap by developing a higher-fidelity, nonlinear optimization framework that incorporates a broader set of design variables and coupled constraints, enabling a multidimensional model that captures the coupled behavior of RFC subsystems and demonstrates the feasibility of applying optimization to such systems. An expanded system-level optimization approach was established that captures interactions between electrochemical performance, structural requirements, and storage design. This enabled a more comprehensive evaluation of trade-offs than conventional formulations. The model integrates four coupled subsystems: a fuel cell, an electrolyzer, reactant gas, and high-pressure storage tanks, and was formulated to accommodate a wide range of mission parameters, including operational time and required output power. It incorporates constraints on available solar array power, reactant mass balance between production and consumption, and pressure-dependent storage requirements. To enable reliable convergence, the optimization problem was reformulated to reduce dimensionality and improve numerical stability, with subsystem models organized for efficient evaluation. Problem dimensionality was reduced by consolidating lower-level design variables into higher-level representative quantities, and subsystem behavior was evaluated within the optimization loop. A multi-start initialization strategy was employed to mitigate sensitivity to local minima and improve solution quality, while nonlinear relationships were solved using robust numerical methods. The results showed that convergence was achieved across a range of required output power values. Specific energy reached a maximum at a critical mission power level, where the electrolyzer power matched the available solar input and operated near its voltage and current density limits. Beyond this point, further increases in required power resulted in less mass-efficient operation, increasing total system mass and reducing overall performance. The developed model represents an advancement in RFC system-level optimization by enabling analysis of a broader and more tightly coupled design space than previous considerations. While convergence behavior and computational cost remain challenges, the methods introduced improve solvability and allow inclusion of additional design variables with minimal loss of physical fidelity. However, the numerical results should not be interpreted as definitive design recommendations, as the model includes simplifying assumptions and omits several higher-order effects. Future work should extend this framework by incorporating additional subsystems and loss mechanisms, such as thermal management, parasitic power consumption, and reactant losses, to improve fidelity and ensure more representative design conclusions.

Electrochemistry↗

Optimizing SRF Gun Cavity Profiles in a Genetic Algorithm Framework

Automation of DC photoinjector designs using a genetic algorithm (GA) based optimization is an accepted practice in accelerator physics. Allowing the gun cavity field profile shape to be varied can extend the utility of this optimization methodology to superconducting and normal conducting radio frequency (SRF/RF) gun based injectors. Finding optimal field and cavity geometry configurations can provide guidance for cavity design choices and verify existing designs. We have considered two approaches for varying the electric field profile. The first is to determine the optimal field profile shape that should be used independent of the cavity geometry, and the other is to vary the geometry of the gun cavity structure to produce an optimal field profile. The first method can provide a theoretical optimal and can illuminate where possible gains can be made in field shaping. The second method can produce more realistically achievable designs that can be compared to existing designs. In this paper, we discuss the design and implementation for these two methods for generating field profiles for SRF/RF guns in a GA based injector optimization scheme and provide preliminary results.

43 PARTICLE ACCELERATORS↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Digital Twin for Optimizing Real-time Economy of the Integrated Energy Systems

Economic and safe operation of integrated energy systems (IES) requires real-time optimization (RTO) of the control and actions conducted on each system component. In this regard, digital twins (DTs), which consist of a physical system, a virtual system, and the data communication that occurs between the two, are essential for effective RTO. Through the data warehouse, the virtual system is constantly updated with real-time data from the physical system, and functions as the model in the optimization framework. The reduced-order model of the dynamic process model in the virtual system is used in the optimization framework. The optimization results are then returned, via the data warehouse, as control actions to the physical system. This work demonstrates the software capabilities of DT assets for an IES in the context of preparing a DT for an experimental system comprised of Idaho National Laboratory (INL)’s Thermal Energy Delivery System and battery system. For the virtual demonstration, the DTs encompass (1) a physical system, including the Modelica models of the Thermal Energy Delivery System and the battery system; (2) virtual optimization via the Optimization of Real-Time Capacity Allocation (ORCA) platform; and (3) the open-source data warehouse software DeepLynx. This work assesses the performance of ORCA, which utilizes a reduced-order model built using the Risk Analysis Virtual Environment (RAVEN) and trained on the Modelica models and real-time data pipeline through the graph database hosted in DeepLynx. The proposed optimization workflow will be an RTO model based on DTs and the data they generate.

25 ENERGY STORAGE↗

On the use of genetic algorithm to optimize industrial assets lifecycle management under safety and budget constraints

The purpose of this paper is to describe the method and tool dedicated to optimize investments planning for industrial assets. These investments may either be preventive maintenance tasks, asset enhancements or logistic investments such as spare parts purchases. The two methodological points to investigate in such an issue are: 1. The measure of the profitability of a portfolio of investments 2. The selection and planning of an optimal set of investments 3. The measure of the risk of a portfolio of investments The measure of the profitability of a set of investments in the IPOP tool is synthesised in the Net Present Value indicator. The NPV is the sum of the differences of discounted cash flows (direct costs, forced outages...) between the situations with and without a given investment. These cash flows are calculated through a pseudo-Markov reliability model representing independently the components of the industrial asset and the spare parts inventories. The component model has been widely discussed over the years but the spare part model is a new one based on some approximations that will be discussed. This model, referred as the NPV function, takes for input an investments portfolio and gives its NPV. The second issue is to optimize the NPV. If all investments were independent, this optimization would be an easy calculation, unfortunately there are two sources of dependency. The first one is introduced by the spare part model, as if components are indeed independent in their reliability model, the fact that several components use the same inventory induces a dependency. The second dependency comes from economic, technical or logistic constraints, such as a global maintenance budget limit or a safety requirement limiting the residual risk of failure of a component or group of component, making the aggregation of individual optimum not necessary feasible. The algorithm used to solve such a difficult optimization problem is a genetic algorithm. After a description of the features of the software a test case is presented showing the influence of the optimization algorithm parameters on its efficiency to find an optimal investments planning. (authors)

97 MATHEMATICS AND COMPUTING↗

Multi-objective optimization of a PCHE-type intermediate heat exchanger using genetic algorithms

For the advanced nuclear reactor systems and power conversion units, it is important to optimize the design of intermediate heat exchangers (IHXs) which transfer heat from the primary loop to the secondary or intermediate loop. For a multi-objective optimization problem, a printed circuit heat exchanger-type IHX with zigzag and S-shaped fin channels is selected to be optimized in terms of both the total cost and the heat exchanger thermal effectiveness using genetic algorithms. A computer code is developed to search a set of optimized designs of the zigzag channel geometry. It is found that among the Pareto-optimal solutions, the total cost is approximately linearly related to the thermal effectiveness between 88 and 95% while it rises rapidly after the effectiveness exceeds 95%. An optimal flow channel diameter is also determined through the optimization. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Optimization of a dry, mixed nuclear fuel storage array for nuclear criticality safety - 14339

A dry storage array of used nuclear fuel at the Idaho National Laboratory contains a mixture of more than twenty different types of research and test reactor fuels. Significant neutronic interaction occurs between fuel canisters within this large storage arrangement of 636 fuel storage canisters. Nuclear criticality safety is maintained primarily by moderation control and through control of neutron interaction and leakage provided by the credited geometry. Over the nearly forty years of operation the collected fuels are now arranged in a configuration that does not minimize the system neutron multiplication factor (k{sub eff}). This creates a concern since the entire remaining facility storage capacity cannot be utilized without exceeding the system minimum subcritical state (k{sub safe}) for ensuring nuclear criticality safety. This work determines a more optimal arrangement for the stored fuels with a goal to minimize the system k{sub eff}, but also with a minimum of potential fuel canister relocation movements. The ultimate goal is to establish a solution for this multiple-objective optimization problem by finding the Pareto Front for maximum k{sub eff} reduction versus the number of canister relocations. The process first required additional analysis of the array by Monte-Carlo neutron transport codes (specifically, MCNP) to gain a greater understanding of the interaction characteristics of the disparate fuel types. Some stored fuels are composed of primarily metallic and oxide components that provide very little inherent moderation, while other fuel types contain graphite or zirconium-hydride which can contribute a significant amount of moderation. These factors cause a complex relationship within a fuel arrangement with respect to thermal utilization and axial leakage probability. The new MCNP analysis was utilized to develop a simplified spreadsheet-based empirical model which simulates the array k{sub eff} result. This empirical model was benchmarked against additional MCNP calculations for various arrangements and then employed in the optimization analysis. A Tabu metaheuristic and stochastic approximation optimization was applied to the empirical model with the optimization function to minimize the array k{sub eff}. The optimization algorithm interrogated the empirical model to determine the optimal rearrangement for up to sixty canister movements. The Pareto Front was found, which shows that a limited number of canister relocation movements could allow the existing thirty-one empty array positions to be filled with common research reactor fuels while also yielding a reduction in the overall array k{sub eff} relative to the current arrangement. This will impart an improvement in the facility utilization while also offering an enhancement in the safety margin. The reduction in array reactivity has been confirmed by a final set of MCNP calculations with the proposed new arrangements. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Particle Swarm Optimisation for group structure optimization for radiotherapy shielding

Neutron transport simulations are ubiquitous in nuclear engineering because they allow one to model experimental systems and render a model platform for easy perturbation of experimental designs. In addition, simulations allow one to gain experimental insight without actually having to go through the trouble of building a physical experiment. Neutron transport simulations can be stochastic or deterministic based. Stochastic neutron transport simulations are typically simulated using the Monte Carlo method and yield very accurate solutions but are computationally expensive, while deterministic methods are typically faster but can be less accurate. Here we focus on optimizing the accuracy of deterministic neutron transport simulations for radiotherapy simulations. Deterministic neutron transport requires discretization of angle, energy, and space to appropriately analyze the system one is trying to model. Discretization of energy is challenging because of the highly variable neutron flux at certain neutron energies. Improper discretization of energy in the transport model can lead to erroneous results and therefore inaccurate interpretations of the solution. In this study, we evaluate Particle Swarm Optimization (PSO) as a mechanism for selecting optimal group structures for radiotherapy shielding. We tested the particle swarm optimization algorithm on radiotherapy shielding problems using Los Alamos National Laboratory's (LANL) main deterministic transport code PARTISN. Results show that the optimized energy group structures generated from the optimization algorithm outperformed LANL's standard energy group structures, and therefore demonstrate utility in using PSO to expedite computation times due to the increased accuracy obtained with a smaller but optimized group structure. (authors)

43 PARTICLE ACCELERATORS↗

Asynchronously parallel optimization solver for finding multiple minima

This paper proposes and analyzes an asynchronously parallel optimization algorithm for finding multiple, high-quality minima of nonlinear optimization problems. Our multistart algorithm considers all previously evaluated points when determining where to start or continue a local optimization run. Theoretical results show that, under certain assumptions, the algorithm almost surely starts a finite number of local optimization runs and identifies, or has a single local optimization run converging to, every minimum. The algorithm is applicable to general optimization settings, but our numerical results focus on the case when derivatives are unavailable. In numerical tests, a PYTHON implementation of the algorithm is shown to yield good approximations of many minima (including a global minimum), and this ability scales well with additional resources. Our implementation’s time to solution is shown also to scale well even when the time to evaluate the function evaluation is highly variable.

97 MATHEMATICS AND COMPUTING↗