Algorithms for Volterra signature computation achieve O(J^2), O(J log J) via FFT, and O(J R^2) via recursion, plus a predictor-corrector scheme, all implemented in a public JAX package.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computational aspects of the Volterra Signature
Algorithms for Volterra signature computation achieve O(J^2), O(J log J) via FFT, and O(J R^2) via recursion, plus a predictor-corrector scheme, all implemented in a public JAX package.