Tensor networks enable tunable, objective compression of 1D fluid data with lossless reconstruction at high bond dimension and efficient in-compressed-space operations like periodic convolution.
and Khoromskij, Boris N
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.
citing papers explorer
-
A fast tree algorithm for multi-component coagulation equation
A tree algorithm reduces multi-component coagulation complexity from O(N^{2d}) to O(d N^d log N) by grouping similar interactions and matches direct-method results in tests with analytic solutions.