Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
From MaRDI portal
Publication:5232115
DOI10.1137/18M1200531zbMath1451.14170arXiv1807.04159MaRDI QIDQ5232115
Nick Vannieuwenhoven, Paul Breiding, Carlos Beltran
Publication date: 29 August 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.04159
Numerical computation of matrix norms, conditioning, scaling (65F35) Multilinear algebra, tensor calculus (15A69) Sensitivity analysis for optimization problems on manifolds (49Q12) Geometric aspects of numerical algebraic geometry (14Q65)
Related Items
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Smoothed analysis for tensor methods in unsupervised learning ⋮ Complete decomposition of symmetric tensors in linear time and polylogarithmic precision ⋮ Nonlinear algebra and applications ⋮ On Best Low Rank Approximation of Positive Definite Tensors ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ From Computation to Comparison of Tensor Decompositions ⋮ Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Component models for three-way data: An alternating least squares algorithm with optimal scaling features
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Multilinear algebra. 2nd ed
- Independent component analysis, a new concept?
- Homotopy techniques for tensor decomposition and perfect identifiability
- Condition numbers for the tensor rank decomposition
- Semialgebraic Geometry of Nonnegative Tensor Rank
- Condition
- Optimization-Based Algorithms for Tensor Decompositions: Canonical Polyadic Decomposition, Decomposition in Rank-$(L_r,L_r,1)$ Terms, and a New Generalization
- Introduction to Smooth Manifolds
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- Distributions of Angles in Random Packing on Spheres
- Tensor Spaces and Numerical Tensor Calculus
- A Decomposition for Three-Way Arrays
- Tensor rank is NP-complete
- A Multilinear Singular Value Decomposition
- The Condition Number of Join Decompositions
- Tensor Decomposition for Signal Processing and Machine Learning
- Real identifiability vs. complex identifiability
- On Generic Identifiability of 3-Tensors of Small Rank
- An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Effective Criteria for Specific Identifiability of Tensors and Forms
- Riemannian Geometry
- Applied Multiway Data Analysis
- ON THE CONCEPT OF k-SECANT ORDER OF A VARIETY
- A Theory of Condition
- On the Precision Attainable with Various Floating-Point Number Systems
