2020
DOI: 10.48550/arxiv.2004.01463
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Interpolation of Dense and Sparse Rational Functions and other Improvements in $\texttt{FireFly}$

Jonas Klappert,
Sven Yannick Klein,
Fabian Lange

Abstract: We present the main improvements and new features in version 2.0 of the open-source C++ library FireFly for the interpolation of rational functions. This includes algorithmic improvements, e.g. a hybrid algorithm for dense and sparse rational functions and an algorithm to identify and remove univariate factors. The new version is applied to a Feynman-integral reduction to showcase the runtime improvements achieved. Moreover, FireFly now supports parallelization with MPI and offers new tools like a parser for e… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
18
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 16 publications
(18 citation statements)
references
References 53 publications
0
18
0
Order By: Relevance
“…[49]. The analytical results for the amplitude are obtained by interpolating the finite-field samples using the library FireFly [51]. We refer the reader to ref.…”
Section: ∼ Fmentioning
confidence: 99%
“…[49]. The analytical results for the amplitude are obtained by interpolating the finite-field samples using the library FireFly [51]. We refer the reader to ref.…”
Section: ∼ Fmentioning
confidence: 99%
“…In this work we follow an alternative strategy for the evaluation of the coefficients G e are then passed to the FireFly library [82] in order to reconstruct the exact analytical expressions for the coefficients G (n) e . We have created an automated framework which is designed to calculate simultaneously multiple amplitudes (that have the same kinematics) following the finite-field evaluation approach just described.…”
Section: Reduction To Pentagon Functionsmentioning
confidence: 99%
“…Many packages have been developed [6][7][8] based on Laporta's algorithm [9] that implement the method of reduction to MI via IBP relations. Nevertheless, the procedure of reduction still remains a difficult problem from a computational point of view for families with many loops and/or many kinematic invariants, leading to the search for new methods [10][11][12][13][14][15][16][17][18]. The method of DE lived through a revolution in recent years with the introduction of the concept of universally transcendental and pure functions and the so-called canonical form of the DE [19].…”
Section: Itroductionmentioning
confidence: 99%