Papers › Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices
Tensor rank bounds and explicit QTT representations for the inverses of circulant matrices
Lev Vysotsky, Maxim Rakhuba
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we are concerned with the inversion of circulant matrices and their quantized tensor-train (QTT) structure. In particular, we show that the inverse of a complex circulant matrix A, generated by the first column of the form (a₀,…,aₘ₋₁,0,…,0,a₋ₙ,…, a₋₁)^⊤ admits a QTT representation with the QTT ranks bounded by (m+n). Under certain assumptions on the entries of A, we also derive an explicit QTT representation of A⁻¹. The latter can be used, for instance, to overcome stability issues arising when numerically solving differential equations with periodic boundary conditions in the QTT format.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections