SEARCH · Search NASA

Results for “speed optimization”

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

SourceResearch connectionFrom yearThrough year

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

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Modeling and Optimization of a Rotating Packed Bed Contactor with a Tetraamine-Appended Metal−Organic Framework for CO 2 Capture

A potential contactor technology for sorbent-based CO 2 capture is the rotating packed bed that contains separate sections for continuous adsorption and desorption. A heat exchanger can be embedded to remove heat in the adsorption section and add heat in the desorption section. In this work, we develop a two-dimensional (2D) model of a rotating packed bed for use in CO 2 capture applications. Mass and energy balances for the model are developed based on a Ljungström-type air preheater, which accounts for the counter-current axial flow of gas phases in separate sections of the bed and the rotation of a solid sorbent, which cycles between adsorption and desorption sections. The sorbent used for this analysis is the tetraamine-appended metal−organic framework Mg 2 (dobpdc)(3−4− 3), chosen for its stability and affinity for CO 2 at low partial pressures, such as those from a natural gas power plant source. An optimization problem is solved that considers the trade-off between maximizing the productivity of the bed and minimizing energy consumption. Maximum productivity and minimum energy are found to be 8.53 kg/h/m 3 and 3.84 MJ/kg, respectively, when these objectives are optimized independently. It is observed that the flue gas pressure and bed rotational speed are the desired operating variables to vary for model-based design of experiments to reduce uncertainty in parameter estimation, as these two variables yielded the most information content based on the Fisher information matrix.

20 FOSSIL-FUELED POWER PLANTS↗

DOE OSTI2024

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

System and method for high dynamic range waveform digitization

Diverse applications from particle physics experiments to lidar are driving cost and current reduction in giga-hertz sampling rate high-resolution data conversion. Multiple imagers captures a single pixel of data and require processing at very high speed. High-bandwidth high-rate signal sampling, analog-to-digital conversion, and transfer of large amounts of data to a digital data acquisition block are required in such systems. Dynamic range, power consumption, and transfer of high-speed, high-bit width data are key implementation challenges. Data acquisition architectures optimized for specific requirements of such systems may facilitate system implementation and reduce overall system cost.

Mostafanezhad, Isar↗

DOE OSTI2023

Comparing the Performance of Julia on CPUs versus GPUs and Julia-MPI versus Fortran-MPI: a case study with MPAS-Ocean (Version 7.1)

Abstract. Some programming languages are easy to develop at the cost of slow execution, while others are fast at runtime but much more difficult to write. Julia is a programming language that aims to be the best of both worlds – a development and production language at the same time. To test Julia's utility in scientific high-performance computing (HPC), we built an unstructured-mesh shallow water model in Julia and compared it against an established Fortran-MPI ocean model, the Model for Prediction Across Scales–Ocean (MPAS-Ocean), as well as a Python shallow water code. Three versions of the Julia shallow water code were created: for single-core CPU, graphics processing unit (GPU), and Message Passing Interface (MPI) CPU clusters. Comparing identical simulations revealed that our first version of the Julia model was 13 times faster than Python using NumPy, where both used an unthreaded single-core CPU. Further Julia optimizations, including static typing and removing implicit memory allocations, provided an additional 10–20× speed-up of the single-core CPU Julia model. The GPU-accelerated Julia code was almost identical in terms of performance to the MPI parallelized code on 64 processes, an unexpected result for such different architectures. Parallelized Julia-MPI performance was identical to Fortran-MPI MPAS-Ocean for low processor counts and ranges from 2× faster to 2× slower for higher processor counts. Our experience is that Julia development is fast and convenient for prototyping but that Julia requires further investment and expertise to be competitive with compiled codes. We provide advice on Julia code optimization for HPC systems.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

An indirect approach to optimize the reaction rates of thermal NO formation for diesel engines

With stringent emission regulations, it has become more important for modern diesel engine manufacturers to accurately predict engine-out nitrogen oxide (NO x ) emissions across a wide range of operating conditions. Thermal NO is the major source of engine-out NO x in modern diesel engines. For thermal NO formation, several earlier studies have recommended the forward and reverse reaction rate coefficients of the rate-limiting reaction (O + N 2 ⇌ NO + N). However, due to deficiencies in sub-models and inadequacies of reduced chemical mechanisms to represent diesel combustion, these recommended values more often than not need to be adjusted in reduced order combustion models to accurately predict engine-out NO x . Hence, in this work a systematic and computationally efficient approach has been proposed to streamline the process of determining the optimum reaction rate coefficients. Here, to develop the optimization approach, four different production diesel engines with different operating conditions in terms of speed, load, and exhaust-gas recirculation have been considered. Numerical simulations have been performed using a detailed zero-dimensional velocity-composition-frequency transported probability density function (0D-VCF-tPDF) model that uses hundreds of notional particles to capture in-cylinder stratification. Four different combinations of hydrocarbon and NO x chemical mechanisms were used to represent chemistry. It was found that for the rate-limiting reaction, the pre-exponent factors (A f1 , A r1 ) and activation energies (E A,f1 , E A,r1 ) of the forward and reverse reaction rates follow a linear band in A f1 - E A,f1 and A r1 - E A,r1 space where predicted engine-out NO x match the measured values closely. By encompassing such bands from different engines and considering constraints on activation energies, a reduced search domain of pre-exponent factors and activation energies was constructed that is expected to be applicable to any diesel engine. Eventually, computationally efficient three-line and one-line search approaches were proposed to determine the optimum values of the pre-exponent factors and activation energies that led to a minimum error between measured and predicted engine-out NO x . Finally, these three-line and one-line NO x optimization approaches were applied to a fifth production diesel engine for which the 0D-VCF-tPDF model showed a very good predictive performance in terms of predicting peak pressure, 50% burn rate, and engine-out NO x when compared to measured and 3D-CFD values.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2025

Machine learning-driven design and self-sensing capabilities of automotive bumper lattices for adaptive impact response

We present a novel approach to design an automotive bumper energy absorber using carbon fiber reinforced polymer composites, optimized to meet conflicting performance requirements for two distinct impact scenarios. The design must satisfy both a low-speed (2.5 mph) pendulum intrusion test, simulating vehicle-to-vehicle collisions, and a high-speed (25 mph) leg flexion test, replicating pedestrian impacts. These tests demand opposing deformation characteristics: high flexibility (deformation < 85 mm) for the former and high stiffness (deformation < 22 mm) for the latter. To address these contradictory requirements, we developed a machine learning (ML) framework for inverse optimization of lattice designs and material selection. Unlike traditional iterative design processes, our ML model directly outputs optimal design parameters and material choices based on target performance inputs. The energy absorber was fabricated using advanced additive manufacturing techniques, including extrusion deposition and digital light processing. The integration of carbon fibers provides multifunctionality to the bumper structure, enabling self-sensing capabilities through changes in electrical resistivity under compression. This electrical response demonstrates high repeatability under multiple cycles at 2% compression and exhibits distinct signatures during crack formation under high deformation. This research offers adaptive performance through innovative design methodologies and smart material integration. The approach has potential applications in various fields requiring adaptive energy absorption and real-time structural health monitoring.

Chawla, Komal [ORNL] (ORCID:0000000190327565)↗

DOE OSTI2022

A process optimization framework for laser direct energy deposition: Densification, microstructure, and mechanical properties of an Fe-Cr alloy

Laser Direct Energy Deposition (DED) is a metal additive manufacturing technique with the ability to fabricate large and complex parts through deposition of metal powders. However, achieving high-density parts and targeted build heights using DED can be challenging due to the large number of highly sensitive process variables. This work proposes a robust fabrication parameter optimization framework to generate process maps for primary parameters in DED, including laser power, scan speed, mass flow rate, hatch spacing, and layer height. Simple single-track experiments were utilized to map out the parameter space, and a combination of geometric criteria for hatch spacing and layer height were proposed to determine parameter sets that achieve both targeted build heights and mitigate porosity formation. Using this framework, specimens with >99 % density and consistent mechanical properties were successfully fabricated over a wide range of process parameters for an Fe-9wt.%Cr (Fe9Cr) alloy, a surrogate for radiation damage-resistant reduced activation ferritic/martensitic (RAFM) steels. Processing these materials using DED is of particular interest in the development of plasma facing components for nuclear fusion applications. The microstructure and mechanical properties of as-printed Fe9Cr were characterized using optical and electron microscopy, X-ray diffraction, and uniaxial tensile tests. As-printed Fe9Cr displayed ~25 % elongation and ultimate tensile strengths of up to 475 MPa which is comparable to similar wrought alloys. Finally, the proposed framework will allow for accelerated DED parameter optimization for novel alloy systems, as well as open the possibility for local microstructure control while simultaneously mitigating defect formation.

42 ENGINEERING↗

DOE OSTI2026

Medium- and Heavy-Duty Truck Duty Cycles

This dataset provides second-by-second duty cycle data for Class 6 and Class 8 diesel trucks in Texas, including key vehicle metrics, engine-related data, and GPS data (excluding GPS latitude and longitude to ensure confidentiality). The data were collected via tablets installed on the trucks and organized into daily datasets, each associated with a unique vehicle ID and date. There are 12 daily datasets for Class 6 diesel trucks (three unique vehicle IDs) and 43 daily datasets for Class 8 diesel trucks (six unique vehicle IDs). The units associated with each column are included in the name. The engine performance data include columns such as engine speed, engine percent torque, and engine fuel rate. Road grade (%/100) was estimated using the GPS altitude and wheel-based vehicle speed, which is used as an input for FASTSim. Cumulative distance was also calculated using the wheel-based vehicle speed. Additional columns include: - Engine Speed (RPM): Removed inaccurate readings and used to calculate angular velocity (radians/second). - Torque (N·m): Calculated using engine percent torque, nominal friction percent torque, and engine reference torque values (those columns were removed from dataset), then normalized to express as torque (%). - Flywheel Power (%): Calculated using the angular velocity and torque (in kW), then normalized as a percentage of the maximum value. - Engine Fuel Rate (%) and Torque (%): Both metrics were normalized by dividing by their respective maximum values within each dataset to express them as percentages. The datasets were analyzed to assess the energy impact of various driving behaviors, simulate energy efficiency, and recommend optimal routes for diesel trucks using NLR’s tool called RouteE. For driver coaching, factors like speed and acceleration limits were considered, and idle periods were reduced (assuming the engine was off during idling) to adjust each drive cycle. These adjusted drive cycles were then simulated in FASTSim to evaluate their effect on fleet energy consumption and estimate potential energy savings. The original cycles are available for download on this page ![image](CoVaR_Image_for_Data_Page_Kenworth_Truck.jpg)

1Hz↗

DOE OSTI2022

Physics-informed Bayesian machine learning case study: Integral blade rotors

This paper provides a physics-informed Bayesian machine learning (PIBML) description and case study. The PIBML approach applies three physics-based models to establish the initial beliefs before testing to determine the probability of milling stability (or prior). These include: receptance coupling substructure analysis (RCSA) prediction for the tool tip frequency response functions; finite element software prediction of the mechanistic force model coefficients; and a spindle speed-dependent power law model for process damping. Testing was then performed to identify optimal stable machining conditions using an expected improvement in material removal rate criterion. The prior probability of stability was updated using the test results to determine the posterior probability of stability. The test results were compared to the parameter recommendations provided by the endmill manufacturer. A demonstration integral blade rotor was machined at the optimal stable machining conditions for 304 stainless steel and 6061-T6 aluminum. Finally, the disagreement between manufacturer recommendations and milling performance in both materials tested emphasizes the need for broad implementation of PIBML approaches to increase machining productivity and efficiency.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Accelerating GNNs on GPU Sparse Tensor Cores through N:M Sparsity-Oriented Graph Reordering

Recent advancements in GPU hardware support have introduced the capability to leverage N:M sparse patterns for substantial performance gains. Graphs in Graph Neural Networks (GNNs) are typically sparse, but the sparsity is often irregular, not conforming to such sparse patterns. In this paper, we propose a novel graph reordering algorithm, the first of its kind, to reshape irregular graph data into the N:M structured sparse pattern at the tile level, allowing linear-algebra-based graph operations in GNNs to benefit from the N:M sparse hardware. The optimization is lossless, maintaining the accuracy of GNN. It can remove 98-100\% violations of the N:M sparse patterns at the vector level, and increase the proportion of conforming graphs in SuiteSparse collection from 5-9\% to 88.7-93.5\%. On A100 GPUs, the optimization accelerates Sparse Matrix Matrix (SpMM) by up to 43X (2.3X -- 7.5X on average) and speeds up the key graph operations in GNNs on real graphs by as much as 8.6X (3.5X on average).

artificial intelligence, graph neural networks↗

DOE OSTI2020

Rapid generation of optimal generalized Monkhorst-Pack grids

In this report computational modeling of the properties of crystalline materials has become an increasingly important aspect of materials research, consuming hundreds of millions of CPU-hours at scientific computing centers around the world each year, if not more. A routine operation in such calculations is the evaluation of integrals over the Brillouin zone. We have previously demonstrated that performing such integrals using generalized Monkhorst-Pack k-point grids can roughly double the speed of these calculations relative to the widely-used traditional Monkhorst-Pack grids. However the generation of optimal generalized Monkhorst-Pack grids is not implemented in most software packages due to the computational cost and difficulty of identifying the best grids. To address this problem, we present new algorithms that allow rapid generation of optimal generalized Monkhorst-Pack grids on the fly. We demonstrate that the grids generated by these algorithms are on average significantly more efficient than those generated using existing algorithms across a range of grid densities. For grids that correspond to a real-space supercell with at least 50 Å between lattice points, which is sufficient to converge density functional theory calculations within 1 meV/atom for nearly all materials, our algorithm finds optimized grids in an average of 0.19 s on a single processing core. To facilitate the widespread adoption of this approach, we present new open-source tools including a library designed for integration with third-party software packages.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that effectively leverage the complementary strengths of deterministic algorithms and QC techniques to overcome combinatorial complexity for solving large-scale mixed-integer programming problems. Four applications, namely the molecular conformation problem, job-shop scheduling problem, manufacturing cell formation problem, and the vehicle routing problem, are specifically addressed. Large-scale instances of these application problems across multiple scales ranging from molecular design to logistics optimization are computationally challenging for deterministic optimization algorithms on classical computers. To address the computational challenges, hybrid QC-based algorithms are proposed and extensive computational experimental results are presented to demonstrate their applicability and efficiency. The proposed QC-based solution strategies enjoy high computational efficiency in terms of solution quality and computation time, by utilizing the unique features of both classical and quantum computers.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Benchmarking and Fidelity Response Theory of High-Fidelity Rydberg Entangling Gates

The fidelity of entangling operations is a key figure of merit in quantum information processing, especially in the context of quantum error correction. High-fidelity entangling gates in neutral atoms have seen remarkable advancement recently. A full understanding of error sources and their respective contributions to gate infidelity will enable the prediction of fundamental limits on quantum gates in neutral atom platforms with realistic experimental constraints. In this work, we implement the time-optimal Rydberg controlled-Z (CZ) gate, design a circuit to benchmark its fidelity, and achieve a fidelity, averaged over symmetric input states, of 0.9971 ( 5 ) , downward corrected for leakage error, which together with our recent work [Nature 634, 321–327 (2024)] forms a new state of the art for neutral atoms. The remaining infidelity is explained by an error model, consistent with our experimental results over a range of gate speeds, with varying contributions from different error sources. Further, we develop a fidelity response theory to efficiently predict infidelity from laser noise with nontrivial power spectral densities and derive scaling laws of infidelity with gate speed. Besides its capability of predicting gate fidelity, we also utilize the fidelity response theory to compare and optimize gate protocols, to learn laser frequency noise, and to study the noise response for quantum simulation tasks. Finally, we predict that a CZ gate fidelity of ≳ 0.999 is feasible with realistic experimental upgrades. Published by the American Physical Society 2025

Tsai, Richard Bing-Shiun (ORCID:0000000286758677)↗

DOE OSTI2025

Large Scale Bilevel Optimization for N-K SCOPF Using Adversarial Robustness

Ensuring a secure dispatch against multiple simultaneous outages has long been desired to maintain grid security in the presence of severe events, such as extreme weather phenomena. Traditionally denoted as N-k security constrained optimal power flow (N-k SCOPF), this problem is intractable to solve due to its size being combinatorial in the number of simultaneous outages and due to the non-convex nature of the AC network constraints. This hinders the use of N-k SCOPF for operating realistic-scale systems. In this paper, we introduce a methodology to scalably solve an AC-feasible dispatch that improves security over k simultaneous outages. Our methodology poses N-k SCOPF as a bilevel optimization problem and solves it using an adversarial robustness approach. We develop new efficient methods to solve each level of the bilevel optimization by employing knowledge of the physics of the underlying system. This yields significant improvements in speed and convergence that enable us to address the N-k SCOPF problem at scale. We demonstrate the effectiveness of our method by conducting a comprehensive analysis of an N-3 SCOPF for a 500-bus network. Furthermore, we emphasize the ability of our physics-driven techniques to handle larger systems by successfully scaling up to 12,000 buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Wake steering optimization under uncertainty

Turbines in wind power plants experience significant power losses when wakes from upstream turbines affect the energy production of downstream turbines. A promising plant-level control strategy to reduce these losses is wake steering, where upstream turbines are yawed to direct wakes away from downstream turbines. However, there are significant uncertainties in many aspects of the wake steering problem. For example, infield sensors do not give perfect information, and inflow to the plant is complex and difficult to forecast with available information, even over short time periods. Here, we formulate and solve an optimization under uncertainty (OUU) problem for determining optimal plant-level wake steering strategies in the presence of independent uncertainties in the direction, speed, turbulence intensity, and shear of the incoming wind, as well as in turbine yaw positions. The OUU wake steering strategy is first examined for a two-turbine test case to explore the impacts of different types of inflow uncertainties, and it is then demonstrated for a more realistic 11-turbine wind power plant. Of the sources of uncertainty considered, we find that wake steering strategies are most sensitive to uncertainties in the wind speed and direction. When maximizing expected power production, the OUU strategy also tends to favor smaller yaw angles, which have been shown in previous work to reduce turbine loading. Ultimately, the plant-level wake steering strategy formulated using an OUU approach yields 0.48?% more expected annual energy production for the 11-turbine wind plant than a strategy that neglects uncertainty when considering stochastic inputs. Thus, not only does the present OUU strategy produce more power in realistic conditions, but it also reduces risk by prescribing strategies that call for less extreme yaw angles.

17 WIND ENERGY↗

DOE OSTI2024

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗

DOE OSTI2022

Accelerating cosmological inference with Gaussian processes and neural networks – an application to LSST Y1 weak lensing and galaxy clustering

ABSTRACT Studying the impact of systematic effects, optimizing survey strategies, assessing tensions between different probes and exploring synergies of different data sets require a large number of simulated likelihood analyses, each of which cost thousands of CPU hours. In this paper, we present a method to accelerate cosmological inference using emulators based on Gaussian process regression and neural networks. We iteratively acquire training samples in regions of high posterior probability which enables accurate emulation of data vectors even in high dimensional parameter spaces. We showcase the performance of our emulator with a simulated 3×2 point analysis of LSST-Y1 with realistic theoretical and systematics modelling. We show that our emulator leads to high-fidelity posterior contours, with an order of magnitude speed-up. Most importantly, the trained emulator can be re-used for extremely fast impact and optimization studies. We demonstrate this feature by studying baryonic physics effects in LSST-Y1 3×2 point analyses where each one of our MCMC runs takes approximately 5 min. This technique enables future cosmological analyses to map out the science return as a function of analysis choices and survey strategy.

Astronomy & Astrophysics↗