.png){kind=icon}
.png){kind=icon}
Return
Efficient randomized algorithms for block tensor-tensor multiplication
.png){kind=icon}
PRE
AI
DOI：10.1007/s40314-026-03887-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We first present a random sampling algorithm framework for block tensor-tensor multiplication, i.e., block t-product. Then, the winner-take-all principle is introduced to the framework to reduce variance. We obtain the optimal sampling criteria as well as the corresponding error bounds. Numerical results demonstrate the feasibility and efficiency of our methods.
Keywords:
Random sampling
Block tensor-tensor multiplication
Winner-take-all
Optimal sampling
Journal
C
IF:
2.5
Papers:
38
Citations:
0