Chebyshev polynomial approximations with adaptive sampling solve canonical differential equations for Feynman integrals, demonstrated to be stable and competitive for two-loop five-point cases in double precision.
Chopping a Chebyshev Series
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is "rounded" to a prescribed precision by constructing a Chebyshev series and chopping it at an appropriate point. Designing a chopping algorithm with the right properties proves to be a surprisingly complex and interesting problem. We describe the chopping algorithm introduced in Chebfun Version 5.3 in 2015 after many years of discussion and the considerations that led to this design.
fields
hep-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Chebyshev Approximations of Feynman Integrals for Collider Physics
Chebyshev polynomial approximations with adaptive sampling solve canonical differential equations for Feynman integrals, demonstrated to be stable and competitive for two-loop five-point cases in double precision.