A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition
From MaRDI portal
Publication:5862810
DOI10.1137/21M1423026zbMath1484.15030arXiv2112.08303OpenAlexW4214731313MaRDI QIDQ5862810
Michiel Vandecappelle, Eric Evert, Lieven De Lathauwer
Publication date: 10 March 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.08303
multilinear algebratensorscanonical polyadic decompositionmultidimensional arraysgeneralized eigenvalue decomposition
Inequalities involving eigenvalues and eigenvectors (15A42) Multilinear algebra, tensor calculus (15A69) Matrix pencils (15A22)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to generate random matrices from the classical compact groups
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- Computing stable eigendecompositions of matrix pencils
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Perturbation theory for linear operators.
- Spectral norm and nuclear norm of a third order tensor
- Numerical methods for general and structured eigenvalue problems.
- Schubert Varieties and Distances between Subspaces of Different Dimensions
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
- Canonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
- On best rank one approximation of tensors
- A Decomposition for Three-Way Arrays
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- A Multilinear Singular Value Decomposition
- Tensor Deflation for CANDECOMP/PARAFAC— Part I: Alternating Subspace Update Algorithm
- The Condition Number of Join Decompositions
- Nuclear norm of higher-order tensors
- Tensor Decomposition for Signal Processing and Machine Learning
- Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable
- A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor
This page was built for publication: A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition