On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
From MaRDI portal
Publication:5256539
DOI10.1137/140975577zbMath1317.65111OpenAlexW588102005MaRDI QIDQ5256539
Publication date: 18 June 2015
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140975577
tensoralgorithmnumerical exampleperturbationuniquenessbest rank-one approximationquasi-singular value
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ Riemannian Modified Polak--Ribière--Polyak Conjugate Gradient Order Reduced Model by Tensor Techniques ⋮ Z-eigenvalue localization sets for tensors and the applications in rank-one approximation and quantum entanglement ⋮ On Orthogonal Tensors and Best Rank-One Approximation Ratio ⋮ A concise proof to the spectral and nuclear norm bounds through tensor partitions ⋮ Parametric model order reduction based on parallel tensor compression
Cites Work
- Unnamed Item
- Tensor Decompositions and Applications
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- Handwritten digit classification using higher order singular value decomposition
- Singular values of a real rectangular tensor
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Structure and Perturbation Analysis of Truncated SVDs for Column-Partitioned Matrices
- Rank-One Approximation to High Order Tensors
- A Three-Way Jordan Canonical Form as Limit of Low-Rank Tensor Approximations
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part I: Basic Results and Uniqueness of One Factor Matrix
- On the Uniqueness of the Canonical Polyadic Decomposition of Third-Order Tensors---Part II: Uniqueness of the Overall Decomposition
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Subtracting a best rank-1 approximation may increase tensor rank
This page was built for publication: On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor