.png){kind=icon}
.png){kind=icon}
Return
ADAPTIVE HIERARCHICAL SUBTENSOR PARTITIONING FOR TENSOR COMPRESSION
.png){kind=icon}
OA
AI
DOI：10.1137/19M128689X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work a numerical method is proposed to compress a tensor by constructing a piecewise tensor approximation. This is constructed by partitioning a tensor into subtensors and by constructing a low-rank tensor approximation (in a given format) in each subtensor. Neither the partition nor the ranks are fixed a priori, but, instead, they are obtained in order to fulfill a prescribed accuracy and optimize the storage. Some numerical experiments are proposed to illustrate the method.
Keywords:
tensors
compression
CP and Tucker formats
HOSVD
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W