A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (Q2161453): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.aml.2022.108252 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.AML.2022.108252 / rank | |||
Normal rank | |||
Latest revision as of 07:40, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition |
scientific article |
Statements
A fast sketching-based algorithm for rank-\((L,L,1)\) block term decomposition (English)
0 references
4 August 2022
0 references
block term decomposition
0 references
randomized algorithm
0 references
tensor sketching
0 references
high-order data processing
0 references
0 references
0 references
0 references
0 references
0 references
