On the average condition number of tensor rank decompositions

DOI10.1093/imanum/drz026zbMath1466.15027arXiv1801.01673OpenAlexW2806002326WikidataQ127958374 ScholiaQ127958374MaRDI QIDQ5857334

Paul Breiding, Nick Vannieuwenhoven

Publication date: 31 March 2021

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.01673

zbMATH Keywords

condition numberill-posed problemsaverage complexitycondition number theoremtensor rank decompositioninverse distance to ill-posedness

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35) Multilinear algebra, tensor calculus (15A69)

Related Items (4)

Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Unnamed Item ⋮ From Computation to Comparison of Tensor Decompositions

This page was built for publication: On the average condition number of tensor rank decompositions