Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithms and theoretical developments”

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

Linac_Gen: integrating machine learning and particle-in-cell methods for enhanced beam dynamics at Fermilab

Here, we introduce Linac_Gen, a tool developed at Fermilab, which combines machine learning algorithms with Particle-in-Cell methods to advance beam dynamics in linacs. Linac_Gen employs techniques such as Random Forest, Genetic Algorithms, Support Vector Machines, and Neural Networks, achieving a tenfold increase in speed for phase-space matching in linacs over traditional methods through the use of genetic algorithms. Crucially, Linac_Gen's adept handling of 3D field maps elevates the precision and realism in simulating beam instabilities and resonances, marking a key advancement in the field. Benchmarked against established codes, Linac_Gen demonstrates not only improved efficiency and precision in beam dynamics studies but also in the design and optimization of linac systems, as evidenced in its application to Fermilab's PIP-II linac project. This work represents a notable advancement in accelerator physics, marrying ML with PIC methods to set new standards for efficiency and accuracy in accelerator design and research. Linac_Gen exemplifies a novel approach in accelerator technology, offering substantial improvements in both theoretical and practical aspects of beam dynamics.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Graph theory inspired anomaly detection at the LHC

Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an unsupervised, model-agnostic tool for anomaly detection, using the LHC Olympics dataset as a benchmark. By representing jet constituents as a graph, we introduce a method to systematically control the information available to the model through sparse graph constructions that serve as physically motivated inductive biases. Specifically, (1) we construct graph autoencoders based on locally rigid Laman graphs and globally rigid unique graphs, and (2) we explore the clustering of jet constituents into subjets to interpolate between high- and low-level input representations. We obtain the best performance, measured in terms of the Significance Improvement Characteristic curve for an intermediate level of subjet clustering and certain sparse unique graph constructions. We further investigate the role of graph connectivity in jet classification tasks. Our results demonstrate the potential of leveraging graph-theoretic insights to refine and increase the interpretability of machine learning tools for collider experiments.

Automation↗
DOE OSTI2023

Accurate prediction of carbon dioxide capture by deep eutectic solvents using quantum chemistry and a neural network

Carbon dioxide (CO 2 ) emissions from fossil fuel combustion are a significant source of greenhouse gas, contributing in a major way to global warming and climate change. Carbon dioxide capture and sequestration is gaining much attention as a potential method for controlling these greenhouse gas emissions. Among the environmentally friendly solvents, deep eutectic solvents (DESs) have demonstrated the potential capability for carbon capture. To establish a theoretical framework for DES activity, thermodynamics modeling and solubility predictions are significant factors to anticipate and understand the system behavior. Here, in this study, we combine the COSMO-RS model with machine learning techniques to predict the solubility of CO 2 in various deep eutectic solvents. A comprehensive data set was established comprising 1973 CO 2 solubility data points in 132 different DESs at a variety of temperatures, pressures, and DES molar ratios. This data set was then utilized for the further verification and development of the COSMO-RS model. The CO 2 solubility (ln(x CO 2 )) in DESs calculated with the COSMO-RS model differs significantly from the experiment with an average absolute relative deviation (AARD) of 23.4%. A multilinear regression model was developed using the COSMO-RS predicted solubility and a temperature-pressure dependent parameter, which improved the AARD to 12%. Finally, a machine learning model using COSMO-RS-derived features was developed based on an artificial neural network algorithm. The results are in excellent agreement with the experimental CO 2 solubilities, with an AARD of only 2.72%. The ML model will be a potentially useful tool for the design and selection of DESs for CO 2 capture and utilization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Multilevel Hierarchical Decomposition of Finite Element White Noise with Application to Multilevel Markov Chain Monte Carlo

In this work we develop a new hierarchical multilevel approach to generate Gaussian random field realizations in an algorithmically scalable manner that is well suited to incorporating into multilevel Markov chain Monte Carlo (MCMC) algorithms. This approach builds off of other partial differential equation (PDE) approaches for generating Gaussian random field realizations; in particular, a single field realization may be formed by solving a reaction-diffusion PDE with a spatial white noise source function as the right-hand side. While these approaches have been explored to accelerate forward uncertainty quantification tasks, e.g., multilevel Monte Carlo, the previous constructions are not directly applicable to multilevel MCMC frameworks which build fine-scale random fields in a hierarchical fashion from coarse-scale random fields. Our new hierarchical multilevel method relies on a hierarchical decomposition of the white noise source function in $L^2$ which allows us to form Gaussian random field realizations across multiple levels of discretization in a way that fits into multilevel MCMC algorithmic frameworks. After presenting our main theoretical results and numerical scaling results to showcase the utility of this new hierarchical PDE method for generating Gaussian random field realizations, this method is tested on a four-level MCMC algorithm to explore its feasibility.

algebraic multigrid↗
DOE OSTI2022

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Estimating mass-absorption cross-section of ambient black carbon aerosols: theoretical, empirical, and machine learning models

The mass-absorption cross-section of black carbon (MAC BC ) is an essential parameter to link the atmospheric concentration of black carbon (BC) with its radiative forcing. When a direct calculation of MAC BC based on observations of aerosol light absorption and BC mass concentration is impossible, we rely on modeling and simulations to estimate MAC BC , but currently, there is no consensus model that can be relied on for accurate predictions across all atmospheric environments when BC particles have different coating thicknesses. Here, we applied five MAC BC prediction models (including three light scattering theories, an empirical model based on observations of particle mass concentrations, and a machine learning model developed in our previous work) to aerosols from three Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) field campaigns. While many studies have found that increasing the complexity of the models helps to constrain biases of the estimated MAC BC , our effort is to evaluate the models based on the criteria of simplicity and accuracy. We find that our machine learning model (support vector machine for regression, SVM) generally performs well across all DOE ARM field campaign data, while the accuracy of core-shell Mie theory depends on the bias correction algorithm applied to filter-based light absorption data. Generally, the empirical model for internally-mixed particles that we considered tends to over-predict MAC BC , while Mie theory for externally-mixed particles tends to under-predict MAC BC . An examination of the influence of coating material on BC cores suggests that the performance of our current SVM model is degraded when the BC is thickly-coated (e.g., it has undergone aging and mixing with other materials in the atmosphere).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗
DOE OSTI2025

Integrating novel stellarator single-stage optimization algorithms to design the Columbia stellarator experiment

Abstract The Columbia Stellarator eXperiment (CSX), currently being designed at Columbia University, aims to test theoretical predictions related to QA plasma behavior, and to pioneer the construction of an optimized stellarator using three-dimensional, non-insulated high-temperature superconducting (NI-HTS) coils. The magnetic configuration is generated by a combination of two circular planar poloidal field (PF) coils and two 3D-shaped interlinked (IL) coils, with the possibility to add windowpane coils to enhance shaping and experimental flexibility. The PF coils and vacuum vessel are repurposed from the former Columbia Non-Neutral Torus experiment, while the IL coils will be custom-wound in-house using NI-HTS tapes. To obtain a plasma shape that meets the physics objectives with a limited number of coils, novel single-stage optimization techniques are employed, optimizing both the plasma and coils concurrently, in particular targeting a tight aspect ratio QA plasma and minimized strain on the HTS tape. Despite the increased complexity due to the expanded degrees of freedom, these methods successfully identify optimized plasma geometries that can be realized by coils meeting engineering specifications. This paper discusses the derivation of the constraints and objectives specific to CSX, and describe how two recently developed single-stage optimization methodologies are applied to the design of CSX. A set of selected configurations for CSX is then described in detail.

Baillod, A. (ORCID:0000000303529180)↗
DOE OSTI2020

A Sheaf Theoretical Approach to Uncertainty Quantification of Heterogeneous Geolocation Information

Integration of multiple, heterogeneous sensors is a challenging problem across a range of applications. Prominent among these are multi-target tracking, where one must combine observations from different sensor types in a meaningful and efficient way to track multiple targets. Because different sensors have differing error models, we seek a theoretically justified quantification of the agreement among ensembles of sensors, both overall for a sensor collection, and also at a fine-grained level specifying pairwise and multi-way interactions among sensors. We demonstrate that the theory of mathematical sheaves provides a unified answer to this need, supporting both quantitative and qualitative data. Furthermore, the theory provides algorithms to globalize data across the network of deployed sensors, and to diagnose issues when the data do not globalize cleanly. We demonstrate and illustrate the utility of sheaf-based tracking models based on experimental data of a wild population of black bears in Asheville, North Carolina. A measurement model involving four sensors deployed among the bears and the team of scientists charged with tracking their location is deployed. This provides a sheaf-based integration model which is small enough to fully interpret, but of sufficient complexity to demonstrate the sheaf’s ability to recover a holistic picture of the locations and behaviors of both individual bears and the bear-human tracking system. A statistical approach was developed in parallel for comparison, a dynamic linear model which was estimated using a Kalman filter. This approach also recovered bear and human locations and sensor accuracies. When the observations are normalized into a common coordinate system, the structure of the dynamic linear observation model recapitulates the structure of the sheaf model, demonstrating the canonicity of the sheaf-based approach. However, when the observations are not so normalized, the sheaf model still remains valid.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Proposed Analytical Methods for Determining Filter Media Properties

High Efficiency Particulate Air (HEPA) filters, commonly used in nuclear filtration applications, are an integral part of the waste management processes in nuclear plants. HEPA filters are 99.97% efficient filtration devices characterized by their high resistance to air flow, or pressure drop. From theoretical models, the initial pressure drop across a clean filter is proven to be a function of the filter media fiber diameters and porosity of the media. These filter properties are relatively difficult to obtain with traditional manual methods; therefore, there is a need to develop analytical methods to find the fiber diameter and porosity to determine the pressure drop. Typically, these values can be found by substituting a calculated representative value based upon measured values, such as equivalent fiber diameter based upon a clean pressure drop. However, these values may also be directly recorded and measured by incorporating Scanning Electron Microscope (SEM) image analysis and other measurement methods to analyze the filter media and determine its physical properties without the need for media testing. DiameterJ, an open source Java plug-in, used with ImageJ, can process images of filter media taken by an SEM to find statistical data such as mean fiber diameter and porosity. To produce the raw data, SEM images of two filter media type samples are taken and segmented in DiameterJ using the traditional and statistical region merging segmentation algorithms. Manual segmentation is necessary after the initial segmentation by the algorithms as the images tend to be too complex for the algorithms to output with the necessary accuracy. However, complications exist in the manual segmentation process as these methods can be time intensive and prone to the individual bias of the user. This in turn can skew the final mean fiber diameter result, and lead to either an over or under prediction of the pressure drop. It was also discovered that the porosity data produced by DiameterJ is inaccurate, as the SEM analyzes the three-dimensional filter media by projecting its geometry onto a plane and analyzing it as a two-dimensional binary image. Thus, the porosity is artificially inflated through the segmentation process, rendering this result incorrect. Alternatively, density determination, gravimetric analysis, and thickness testing of the filter media is collectively used to determine the filter fiber porosity. Together, the SEM image analysis and analytical lab methods produce results through direct measurements which allow for the prediction of the initial pressure drop from clean filter media without the need for prior media testing to collect pressure data. By improving upon this proposed analytical method in the future, there is potential to streamline the process of finding these filter properties into a more direct methodology for determining the pressure drop across HEPA filters.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

Development and Evaluation of Velocity Predictive Optimal Energy Management Strategies in Intelligent and Connected Hybrid Electric Vehicles

In this study, a thorough and definitive evaluation of Predictive Optimal Energy Management Strategy (POEMS) applications in connected vehicles using 10 to 20 s predicted velocity is conducted for a Hybrid Electric Vehicle (HEV). The presented methodology includes synchronous datasets gathered in Fort Collins, Colorado using a test vehicle equipped with sensors to measure ego vehicle position and motion and that of surrounding objects as well as receive Infrastructure to Vehicle (I2V) information. These datasets are utilized to compare the effect of different signal categories on prediction fidelity for different prediction horizons within a POEMS framework. Multiple artificial intelligence (AI) and machine learning (ML) algorithms use the collected data to output future vehicle velocity prediction models. The effects of different combinations of signals and different models on prediction fidelity in various prediction windows are explored. All of these combinations are ultimately addressed where the rubber meets the road: fuel economy (FE) enabled from POEMS. FE optimization is performed using Model Predictive Control (MPC) with a Dynamic Programming (DP) optimizer. FE improvements from MPC control at various prediction time horizons are compared to that of full-cycle DP. All FE results are determined using high-fidelity simulations of an Autonomie 2010 Toyota Prius model. The full-cycle DP POEMS provides the theoretical upper limit on fuel economy (FE) improvement achievable with POEMS but is not currently practical for real-world implementation. Perfect prediction MPC (PP-MPC) represents the upper limit of FE improvement practically achievable with POEMS. Real-Prediction MPC (RP-MPC) can provide nearly equivalent FE improvement when used with high-fidelity predictions. Constant-Velocity MPC (CV-MPC) uses a constant speed prediction and serves as a “null” POEMS. Results showed that RP-MPC, enabled by high-fidelity ego future speed prediction, led to significant FE improvement over baseline nearly matching that of PP-MPC.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2026

New approaches to Bayesian uncertainty quantification for Nuclear Science (Final Technical Report)

Inverse problems play a central role in experimentation and theory/data comparisons for many areas of modern Nuclear Physics (NP) and High-Energy Physics (HEP). Bayes’s Theorem is a powerful tool for solving Inverse Problems, providing conceptually transparent and unbiased constraints on theoretical parameters and their uncertainties (“Bayesian Inference”) and enabling the quantification of agreement or tension between models and data. However, analyses based on Bayesian Inference are often challenging for NP and HEP applications, either because of the large number of parameters in the problem, the high computational cost, or both. We propose a multi-institutional collaboration to develop and deploy novel Bayesian analysis tools that advance the scientific scope of a broad range of current and future NP experiments. This project brings together NP domain scientists working on several high-profile NP projects for which new, high-performance Bayesian Uncertainty Quantification (“Bayesian UQ”) methods are essential to carry out the science, and data scientists who are developing state-of-the-art methods applicable to these problems. The NP projects in this proposal comprise measurements of the mass and fundamental nature of the neutrino; study of the Quark-Gluon Plasma that filled the early universe; and mapping of natural and anthropogenic radiation environments. While these NP projects have very different scientific goals, with datasets and analysis approaches that differ significantly, they share common requirements for improving computationally intensive Bayesian analyses using advanced Machine Learning algorithms and will benefit strongly from a coherent effort to develop general solutions. This proposal brings together these projects and forefront ML-based data science algorithms to develop such general solutions. The methods developed in this project will also be more widely applicable, thereby advancing science in the larger Nuclear Physics portfolio.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Constraining the scatter in the galaxy–halo connection at Milky Way masses

In this work, we develop and implement two new methods for constraining the scatter in the relationship between galaxies and dark matter haloes. These new techniques are sensitive to the scatter at low halo masses, making them complementary to previous constraints that are dependent on clustering amplitudes or rich galaxy groups, both of which are only sensitive to more massive haloes. In both of our methods, we use a galaxy group finder to locate central galaxies in the Sloan Digital Sky Survey main galaxy sample. Our first technique uses the small-scale cross-correlation of central galaxies with all lower mass galaxies. This quantity is sensitive to the satellite fraction of low-mass galaxies, which is in turn driven by the scatter between haloes and galaxies. The second technique uses the kurtosis of the distribution of line-of-sight velocities between central galaxies and neighbouring galaxies. This quantity is sensitive to the distribution of halo masses that contain the central galaxies at fixed stellar mass. Theoretical models are constructed using peak halo circular velocity, Vpeak, as our property to connect galaxies to haloes, and all comparisons between theory and observation are made after first passing the model through the group-finding algorithm. We parametrize scatter as a lognormal distribution in M* at fixed Vpeak, σ[M*|Vpeak]. The cross-correlation technique yields a constraint of σ[M*|Vpeak] = 0.27 ± 0.05 dex at a mean Vpeak of 168 km s-1, corresponding to a scatter in log M* at fixed Mh of σ[M*|Mh] = 0.38 ± 0.06 dex at $M_\text{h}=10^{11.8}\, \text{M}_\odot$. The kurtosis technique yields σ[M*|Vpeak] = 0.30 ± 0.03 at Vpeak = 209 km s-1, corresponding to σ[M*|Mh] = 0.34 ± 0.04 at $M_\text{h}=10^{12.2}\, \text{M}_\odot$. The values of σ[M*|Mh] are significantly larger than the constraints at higher masses, in agreement with the results of hydrodynamic simulations. This increase is only partly due to the scatter between Vpeak and Mh, and it represents an increase of nearly a factor of 2 relative to the values inferred from clustering and group studies at high masses.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Parallelized domain decomposition for multi-dimensional Lagrangian random walk mass-transfer particle tracking schemes

Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work. For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗
DOE OSTI2026

Jet fragmentation function and groomed substructure of bottom quark jets in proton-proton collisions at 5.02 TeV

A measurement of the substructure of bottom quark jets (b jets) in proton-proton (pp) collisions is presented. The measurement uses data collected in pp collisions at $\sqrt{s}=5.02$ TeV, with a low number of simultaneous interactions per bunch crossing, recorded by the CMS experiment in 2017, corresponding to an integrated luminosity of 301 pb −1 . An algorithm to identify and cluster the charged decay daughters of b hadrons is developed for this analysis, which facilitates the exposure of the gluon radiation pattern of b jets using iterative Cambridge-Aachen declustering. The soft-drop-groomed jet radius, R g , and momentum balance, z g , of b quark jets are presented. These observables can be used to test perturbative quantum chromodynamics predictions that account for mass effects. Because the b hadron is partially reconstructed from its charged decay daughters, only charged particles are used for the jet substructure studies. In addition, a jet fragmentation function, z b,ch , is measured, which is defined as the distribution of the ratio of the transverse momentum (p T ) of the partially reconstructed b hadron with respect to the charged-particle component of the jet p T . The substructure variable distributions are unfolded to the charged-particle level. The b jet substructure is compared to the substructure of jets in an inclusive jet sample that is dominated by light-quark and gluon jets in order to assess the role of the b quark mass. A strong suppression of emissions at small R g values is observed for b jets when compared to inclusive jets, consistent with the dead-cone effect. The measurement is also compared with theoretical predictions from Monte Carlo event generators. This is the first substructure measurement of b jets that clusters together the b hadron decay daughters independent of the b hadron species and decay channel.

boosted jets↗
DOE OSTI2022

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗