Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ehrlacher et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: