Approximates large matrix multiplication via truncated SVD and circulant decompositions with O(n^2 log n) complexity and ~1% relative error, including LLM operation demonstrations.
Kar, Example codes for first order multiplication of truncated decompositions , 2025, https: //github.com/SuvenduKar/Efficient-approximations-of-matrix-multiplication
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient approximations of matrix multiplication using truncated decompositions
Approximates large matrix multiplication via truncated SVD and circulant decompositions with O(n^2 log n) complexity and ~1% relative error, including LLM operation demonstrations.