A GPU port of the Zippel sparse polynomial reconstruction algorithm is reported to run up to 14.5x faster than a CPU implementation on large Feynman integral reduction problems.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
hep-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
GPU Implementation of Zippel Method for Feynman Integral Reconstruction
A GPU port of the Zippel sparse polynomial reconstruction algorithm is reported to run up to 14.5x faster than a CPU implementation on large Feynman integral reduction problems.