Three decompositions of symmetric tensors have similar condition numbers

DOI10.1016/J.LAA.2023.01.020MaRDI QIDQ2689155zbMATH OpenOpenAlexFDO

Authors Nick Dewaele, Paul Breiding, Nick Vannieuwenhoven

Publication date 9 March 2023

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

condition numbercanonical polyadic decompositionWaring decomposition

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Numerical computation of matrix norms, conditioning, scaling (65F35) Sensitivity analysis for optimization problems on manifolds (49Q12) Local Riemannian geometry (53B20) Computational aspects in algebraic geometry (14Qxx)

Recommendations

• The condition number of many tensor decompositions is invariant under Tucker compression
• Condition numbers for the tensor rank decomposition
• Symmetric tensor decomposition
• On the average condition number of tensor rank decompositions
• The average condition number of most tensor rank decomposition problems is infinite

Cites work

• scientific article; zbMATH DE number 5968745 (Why is no real title available?)
• scientific article; zbMATH DE number 773851 (Why is no real title available?)
• A Multilinear Singular Value Decomposition
• A Theory of Condition
• A counterexample to Comon's conjecture
• Effective criteria for specific identifiability of tensors and forms
• Julia: a fresh approach to numerical computing
• Minimality and uniqueness for decompositions of specific ternary forms
• Remarks on the symmetric rank of symmetric tensors
• Symmetric Tensors and Symmetric Tensor Rank
• Tensor decompositions for learning latent variable models
• The condition number of join decompositions
• The structured condition number of a differentiable map between matrix manifolds, with applications

Cited in

(7)

• Pencil-based algorithms for tensor rank decomposition are not stable
• The condition number of join decompositions
• The condition number of many tensor decompositions is invariant under Tucker compression
• Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
• Three decompositions of symmetric tensors have similar condition numbers
• The average condition number of most tensor rank decomposition problems is infinite
• Tensor and its Tucker core: the invariance relationships.

Describes a project that uses

Uses Software

• Julia

This page was built for publication: Three decompositions of symmetric tensors have similar condition numbers

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