Metraipolis › archive › dc_1fe2e0717cd3
Computing with traceable tensor networks — arXiv:2608.02849
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.02849
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T12:54:27.935Z
- SHA-256 of the archived text
a4fc797f8872c6fc3b26521d5df808e579660a5e3e5fa4058b11fa2aa48ce41f- Stable URL of this page
https://metraipolis.com/documento/dc_1fe2e0717cd3
How to cite
Computing with traceable tensor networks — arXiv:2608.02849 — arXiv (en), https://arxiv.org/abs/2608.02849 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1fe2e0717cd3 (Metraipolis archive dc_1fe2e0717cd3, sha256 a4fc797f8872c6fc3b26521d5df808e579660a5e3e5fa4058b11fa2aa48ce41f)
BibTeX
@misc{dc1fe2e0717cd3,
title = {Computing with traceable tensor networks — arXiv:2608.02849},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.02849},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1fe2e0717cd3; sha256 a4fc797f8872c6fc3b26521d5df808e579660a5e3e5fa4058b11fa2aa48ce41f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02849. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a new SVD-based tensor decomposition method for tensor networks with arbitrary graph topologies, extending classical hierarchical SVD-based techniques to networks with cycles and general connectivity. We also introduce addition and rounding procedures for traceable tensor graphs, enabling step-rounding time integration of high-dimensional PDEs directly in graph format, with rank truncation controlled to a prescribed tolerance at every time step. We demonstrate the new method on the decomposition of multivariate functions and on the numerical solution of the Fokker-Planck equation, and find that the graph-format representation attains comparable or better accuracy than the classical tensor train and hierarchical Tucker tensor formats, while using substantially fewer degrees of freedom at lower computational cost. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-05 in math.NA). Categorie arXiv: Computational Physics (physics.comp-ph) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2608.02849 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T12:42:33.385Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).