Efficient CP rounding using alternating least squares with QR decomposition (Q7238937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8196719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient CP rounding using alternating least squares with QR decomposition |
scientific article; zbMATH DE number 8196719 |
Statements
Efficient CP rounding using alternating least squares with QR decomposition (English)
0 references
8 May 2026
0 references
canonical polyadic tesnor decomposition
0 references
CANDECOMP/PARAFAC
0 references
tensors
0 references
multilinear algebra
0 references
numerical stability
0 references
0 references
