EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

An efficient algorithm for path recovery from signature tensors

Leonard Schmitz

Linear Algebra and its Applications · 2027-01 · 753 · 524-545

DOI: 10.1016/j.laa.2026.10.016 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Linear Algebra and its Applications, 2027-01. Verfasst von Leonard Schmitz. Die Arbeit nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Deutsche Forschungsgemeinschaft.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this recovery problem and improves upon current approaches by an order of magnitude. It relies on generalized normal forms and stabilizers of group actions via matrix-tensor congruence. We apply randomized transformation techniques that avoid the task of solving nonlinear polynomial systems associated to degenerate paths, and accompany our methods with an efficient implementation in the computer algebra system OSCAR.

Förderung

  • Deutsche Forschungsgemeinschaft

Zitieren

APA

Schmitz, L. (2027). An efficient algorithm for path recovery from signature tensors. Linear Algebra and its Applications, 753, 524-545. https://doi.org/10.1016/j.laa.2026.10.016

Vancouver

Schmitz L. An efficient algorithm for path recovery from signature tensors. Linear Algebra and its Applications. 2027;753:524-545. doi:10.1016/j.laa.2026.10.016

BibTeX
@article{Schmitz2027,
  author = {Schmitz, Leonard},
  title = {An efficient algorithm for path recovery from signature tensors},
  journal = {Linear Algebra and its Applications},
  year = {2027},
  volume = {753},
  pages = {524--545},
  doi = {10.1016/j.laa.2026.10.016}
}
Kostenlos starten →