Efficient CP rounding using alternating least squares with QR decomposition

DOI10.1137/25M1742333MaRDI QIDQ7238937zbMATH OpenFDO

Authors Alex X. Zhang, Bhisham Dev Verma, Jan van Lent, Grey Ballard

Publication date 8 May 2026

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1742333

zbMATH Keywords

CANDECOMP/PARAFACcanonical polyadic tesnor decompositionmultilinear algebranumerical stabilitytensors

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Factor analysis and principal components; correspondence analysis (62H25) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25) Approximation algorithms (68W25)

Cites work

• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Computing dense tensor decompositions with optimal dimension trees
• CP decomposition for tensors via alternating least squares with QR decomposition
• Efficient MATLAB Computations with Sparse and Factored Tensors
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 3282328 (Why is no real title available?)
• Numerical operator calculus in higher dimensions
• Randomized alternating least squares for canonical tensor decompositions: application to a PDE with random data
• Tensor Decompositions and Applications
• Tensor decompositions for data science
• Tensor methods for the Boltzmann-BGK equation
• The expression of a tensor or a polyadic as a sum of products.
• Trigonometric identities and sums of separable functions

This page was built for publication: Efficient CP rounding using alternating least squares with QR decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238937)