Search NASA⌕ Search

SEARCH · Search NASA

Results for “approximation”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2025

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Sparse Cholesky factorization for solving nonlinear PDEs via Gaussian processes

In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered considerable interest due to their flexibility, robust theoretical guarantees, and close ties to traditional methods. They can transform the solving of general nonlinear PDEs into solving quadratic optimization problems with nonlinear, PDE-induced constraints. However, the complexity bottleneck lies in computing with dense kernel matrices obtained from pointwise evaluations of the covariance kernel, and its partial derivatives, a result of the PDE constraint and for which fast algorithms are scarce. The primary goal of this paper is to provide a near-linear complexity algorithm for working with such kernel matrices. We present a sparse Cholesky factorization algorithm for these matrices based on the near-sparsity of the Cholesky factor under a novel ordering of pointwise and derivative measurements. The near-sparsity is rigorously justified by directly connecting the factor to GP regression and exponential decay of basis functions in numerical homogenization. We then employ the Vecchia approximation of GPs, which is optimal in the Kullback-Leibler divergence, to compute the approximate factor. This enables us to compute ϵ-approximate inverse Cholesky factors of the kernel matrices with complexity O(N log d (N/ϵ)) in space and O(N log 2d (N/ϵ)) in time. We integrate sparse Cholesky factorizations into optimization algorithms to obtain fast solvers of the nonlinear PDE. We numerically illustrate our algorithm’s near-linear space/time complexity for a broad class of nonlinear PDEs such as the nonlinear elliptic, Burgers, and Monge-Ampère equations. In summary, we provide a fast, scalable, and accurate method for solving general PDEs with GPs and kernel methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Synthesis of Zeolites LiX and LiAgX

In this work, we produced approximately 50 grams of zeolite LiX and 50 grams of zeolite LiAgX from commercially available zeolite X. The production of the two specialized zeolite phases was accomplished via a series of ion exchange steps followed by washing, drying, and calcining to produce the final materials. The ion exchange was confirmed by several methods including inductively-coupled plasma emission spectroscopy of exchange solution aliquots, gravimetric analysis, energy dispersive x-ray spectroscopy, and X-ray diffraction. We synthesized approximately 115 grams of zeolite LiX in a large-scale production step after completing a proof-of-concept experiment demonstrating the methodology. The production of zeolite LiX from zeolite X yielded an ion exchange (Li + →Na + ) of approximately 82%. The production of zeolite LiAgX from the previously synthesized zeolite LiX was targeted to exchange approximately 20% of the Li + ions with Ag + ions. We first performed a proof-of-concept experiment demonstrating the reaction pathway and selectivity of the Ag + ion, and then performed a large-scale synthesis of zeolite LiAgX using approximately 50 grams of the zeolite LiX. Our final exchange percentage of silver into the zeolite LiX matrix was approximately 20.8%.

36 MATERIALS SCIENCE↗
DOE OSTI2024

High-Fidelity and High-Performance Computational Simulations for Rapid Design Optimization of Sulfur Thermal Energy Storage

Industrial process heating (IPH) accounts for approximately 70% of US manufacturing energy use and is primarily produced by fossil fuel combustion. Approximately 1500 TWht (approximately 60%) of IPH demand is in the temperature range of 100-300. Industrial applications in this temperature range include drying, hydrothermal processing, thermal enhanced oil recovery, food and beverage, bioethanol production, etc. Cost-effective thermal energy storage (TES) that increases the utilization of waste and renewable heat (solar, geothermal, etc.) could provide significant energy savings and reliable heat sources, decrease emissions, and increase US manufacturing competitiveness through reductions in fuel consumption. TES development has historically been dominated by technologies suitable for deployment with concentrating solar power (CSP). State-of-the-art thermal storage deployed commercially with power tower CSP plants uses a 60%/40% NaNO3/KNO3 molten salt and operates between temperatures of approximately 280 degrees Celsius and 570 degrees Celsius using a two-tank configuration. However, these nitrate salts are unsuitable for operation outside of this temperature range due to a high freezing point of approximately 220 degrees Celsius, and limits on high-temperature salt stability and corrosion resistance of containment alloys. Other materials being investigated for TES include those based on: (1) sensible energy storage (various molten salt compositions, inert solid particles, rocks or pebble beds, sulfur, water, concrete, graphite, etc.), (2) latent energy storage in materials that undergo solid-liquid phase change at relevant temperatures (organic materials for low-temperature applications, inorganic salts and/or metals for high-temperature applications), or (3) thermochemical energy storage (hydrides, hydroxides, carbonates, metal oxides, etc.). The application temperature and challenges pertaining to storage material and/or containment cost, energy density, long-term thermal and cyclic stability, and charge/discharge heat transfer effectiveness drive material selection for a given IPH or electricity generation application. Sulfur is a cheap commodity at $80/ton compared to $1100 - 1300/ton for conventional salts. When using a metric of storage cost per kWh, sulfur costs around 2-3 $/kWh. Previous sulfur TES development focused on high temperature (>600 degrees) concentrated solar power applications with sulfur encapsulated in pipes and flow of gaseous HTF (air) in the shell side. However, for lower-temperature IPH applications in the range of approximately 100-300 degrees Celsius Element 16 adopted a compact and scalable TES design with molten sulfur in the shell and HTF pipes submerged in the molten sulfur bath. The low-cost molten sulfur TES for dispatchable IPH has deployment potential for broad applications. The spatial and temporal evolution of the HTF and sulfur temperature is critical to the TES system performance, and thus detailed modeling can improve understanding of the performance and facilitate design improvements. Using high performance computing and computational fluid dynamics (CFD) a low-cost molten sulfur thermal energy storage (TES) system for industrial process heating (IPH) applications was developed. The unique challenges in CFD modeling of sulfur TES are the sharp property changes of sulfur relevant to the working temperatures. Above 159, liquid sulfur undergoes polymerization, and the viscosity of sulfur rapidly increases by several orders of magnitude between 159 degrees Celsius and 188 degrees Celsius, followed by a decrease in viscosity beyond 188 degrees Celsius due to thermal bound dissociation. In addition, various concentrations of H2S impurities can also modify sulfur viscosity. This numerical challenge is especially relevant to transient simulation of the sulfur TES charging and discharging processes as the extreme property variations limit the applicability of traditional heat transfer correlations. Transient CFD simulations including the temperature-dependent sulfur properties and geometric complexity of the TES design were used to predict the effect of natural convection during charging and discharging on the heat transfer process, sulfur temperature uniformity, charge/discharge rates, and performance of the storage devices. The CFD model was validated with experimental results for a full charge and discharge cycle. The work will show 3D and 2D simulation comparisons aimed to facilitate rapid design iterations and a machine learning based design optimization approach.

CFD↗
DOE OSTI2025

Excited-State Densities from Time-Dependent Density Functional Response Theory

While the variational principle for excited-state energies leads to a route to obtaining excited-state densities from time-dependent density functional theory, relatively little attention has been paid to the quality of the resulting densities in real space obtained with different exchange-correlation functional approximations or how nonadiabatic approximations developed for energies of states of double-excitation character perform for their densities. Here we derive an expression directly in real space for the excited-state density, which includes the case of nonadiabatic kernels and consequently is able, for the first time, to yield densities of states of double-excitation character. Under some well-defined simplifications, we compare the performance of the local-density approximation and exact-exchange approximation, which are in a sense at the opposite extremes of the fundamental functional approximations, on local and charge-transfer excitations in one-dimensional model systems and show that the dressed Time-Dependent Density Functional Theory (TDDFT) approach gives good densities of double excitations.

approximation↗
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Mechanical characterization of fine-grain dispersion-strengthened tungsten as a plasma facing material

Field-Assisted Sintering Technology (FAST) was used to produce fine-grained, dispersion-strengthened tungsten (W) materials. Investigated materials 4138, 4353, and 4355 composed of 3 wt% ZrC sintered at 1800 °C, 5 wt% ZrC sintered at 1800 °C, and 3 wt% ZrC sintered at 2000 °C, respectively. They were compared against ITER-grade W. A series of mechanical and thermal property testing and microstructure studies were conducted to study them as a potential plasma facing material (PFM) for fusion reactors. Hardness testing showed that manufacturing conditions substantially altered hardness. Material 4355 had an average HV10 value of 497.2 ± 16.8, slightly higher than ITER-grade at 378.5 ± 40.3. However, material 4353 was substantially higher with an HV10 value of 738.9 ± 31.7 over the investigated temperature range. Electron Backscatter Diffraction (EBSD) analysis showed that FAST produced substantially smaller grains than the hot-rolled ITER-grade W material, offering notable control over grain size. Materials 4353 and 4355 had grain sizes of 0.44 ± 0.20 µm and 3.67 ± 0.89 µm, respectively, whereas ITER-grade 27.14 ± 19.76 µm at room temperature. The fine grain structures showed no net coarsening after 1 hr. anneals up to 1800 °C, several hundred degrees above the 1100 – 1500 °C recrystallization range reported for conventional W. Inverse application of the Zener pinning relationship to the measured grain sizes indicates that these two FAST sintering conditions produce markedly different effective dispersoid populations, with effective particle diameters of approximately 90 nm at a peak sintering temperature of 1800 °C and approximately 460 nm at 2000 °C, respectively. This result demonstrates that the FAST thermal condition itself, and not the nominal ZrC content alone, governs the pinning effectiveness of the dispersion. Thermal diffusivity measurements support this finding independently. Materials of identical composition sintered at different temperatures differ by approximately 19% in measured thermal diffusivity with statistically indistinguishable density, while materials of different composition and sintering temperature converge to within approximately 2%. At a representative divertor heat flux of 10 MW/m², the lower thermal conductivity of the fine-grained materials corresponds to approximately 28 to 33 °C per millimeter of armor thickness relative to ITER-grade W, traded against a substantially larger margin to recrystallization-driven degradation. While high temperature tensile testing revealed likely contamination that motivates refinement of the manufacturing process, FAST-produced, fine-grained, dispersion-strengthened W offers process-controlled microstructural stability well above the operating temperatures of conventional W and supports its continued development as a PFM for economically viable commercial fusion power.

Parker, Gabe [ORNL] (ORCID:0000000190394100)↗
DOE OSTI2024

Coarse-graining Hamiltonian systems using WSINDy

Abstract Weak form equation learning and surrogate modeling has proven to be computationally efficient and robust to measurement noise in a wide range of applications including ODE, PDE, and SDE discovery, as well as in coarse-graining applications, such as homogenization and mean-field descriptions of interacting particle systems. In this work we extend this coarse-graining capability to the setting of Hamiltonian dynamics which possess approximate symmetries associated with timescale separation. A smooth $$\varepsilon$$ ε -dependent Hamiltonian vector field $$X_\varepsilon$$ X ε possesses an approximate symmetry if the limiting vector field $$X_0=\lim _{\varepsilon \rightarrow 0}X_\varepsilon$$ X 0 = lim ε → 0 X ε possesses an exact symmetry. Such approximate symmetries often lead to the existence of a Hamiltonian system of reduced dimension that may be used to efficiently capture the dynamics of the symmetry-invariant dependent variables. Deriving such reduced systems, or approximating them numerically, is an ongoing challenge. We demonstrate that WSINDy can successfully identify this reduced Hamiltonian system in the presence of large perturbations imparted in the $$\varepsilon >0$$ ε > 0 regime, while remaining robust to extrinsic noise. This is significant in part due to the nontrivial means by which such systems are derived analytically. WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields. The methodology is computationally efficient, often requiring only a single trajectory to learn the global reduced Hamiltonian, and avoiding forward solves in the learning process. In this way, we argue that weak-form equation learning is particularly well-suited for Hamiltonian coarse-graining. Using nearly-periodic Hamiltonian systems as a prototypical class of systems with approximate symmetries, we show that WSINDy robustly identifies the correct leading-order system, with dimension reduced by at least two, upon observation of the relevant degrees of freedom. While our main contribution is computational, we also provide a contribution to the literature on averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems. This provides theoretical justification for our approach as WSINDy’s computations occur at the level of Hamiltonian vector fields. We illustrate the efficacy of our proposed method using physically relevant examples, including coupled oscillator dynamics, the Hénon–Heiles system for stellar motion within a galaxy, and the dynamics of charged particles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Pueblo of Laguna Village Community Solar

The project was to install approximately 11.44 kilowatts (kW) rooftop solar photovoltaic (PV) system on the Mesita Village Community Center, an approximately 9.24 kW rooftop solar PV system on the Paguate Village Community Center, an approximately 21.56 kW rooftop solar PV system on the Paraje Village Community Center, and an approximately 11.00 kW rooftop solar PV system on the Seama Community Center, for a total of about 53.24 kW on four village community centers. The systems were expected to generate approximately 93,329 kWh annually. Installing solar PV systems on the four village community centers would have helped achieve the Pueblo of Laguna’s six energy objectives: community development (decreased utility bills, funds for other needs), economic development (training and participation in the renewable energy economy), energy reliability (future storage), community resilience (alternative sources), relationship to people and the natural world (reducing fossil fuel use), and energy sovereignty (Pueblo decision-making). Installing solar PV systems would have also met specific project goals to offset not less than 85% of each selected building’s annual electricity use, ranging from 87% to 103% of demand; save a minimum of 70% of the cost of utility bills per year for each building, ranging from 75% to 77% percent (including service charges); and would have had payback periods shorter than the estimated useful life of the project

14 SOLAR ENERGY↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2024

Surrogate Model Guided Optimization of Expensive Black-Box Multi-Objective Problems: A Posteriori Methods

Many engineering applications require the simultaneous optimization of multiple conflicting objective functions. Often, these objective functions are evaluated using highly accurate computer simulations that are computationally too expensive to be evaluated hundreds or thousands of times during optimization. Thus, the goal is to find good approximations of the Pareto front using as few of these expensive simulations as possible. Here, we describe an optimization approach based on surrogate models and diverse sampling strategies to accelerate the search for the Pareto solutions. We use a separate surrogate model for approximating each objective function and then we use the surrogate models to inform where additional expensive simulations should be run. The surrogate models are updated in an active learning framework whenever new information from the expensive simulations becomes available. The sampling strategies aim at balancing local improvements of the approximate Pareto front and global exploration to identify the extrema and fill in large gaps of the approximate Pareto front. We demonstrate on a large set of benchmark problems the effectiveness of the method for finding good approximations of the Pareto front.

MATHEMATICS AND COMPUTING↗