Abstract: In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition. This method is based on the computation of maximal singular values and the corresponding singular vectors of matrices. We also introduce a modification for this method and the alternating least squares method, which ensures that alternating iterations will always converge to a semi-maximal point. (A critical point in several vector variables is semi-maximal if it is maximal with respect to each vector variable, while other vector variables are kept fixed.) We present several numerical examples that illustrate the computational performance of the new method in comparison to the alternating least square method.
Recommendations
- Best nonnegative rank-one approximations of tensors
- The best rank-one approximation ratio of a tensor space
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- Approximation of high-dimensional rank one tensors
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
- Rank-one approximation to high order tensors
- On the best rank-1 approximation to higher-order symmetric tensors
- scientific article; zbMATH DE number 6474941
Cites work
- A Multilinear Singular Value Decomposition
- Best rank one approximation of real symmetric tensors can be chosen symmetric
- Matrix Analysis
- Matrix iterative analysis
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Principal component analysis of three-mode data by means of alternating least squares algorithms
- Rank-one approximation to high order tensors
- Tensor Decompositions and Applications
- The number of eigenvalues of a tensor
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
Cited in
(30)- Algorithms for structure preserving best rank-one approximations of partially symmetric tensors
- Further results for \(Z\)-eigenvalue localization theorem for higher-order tensors and their applications
- Higher-order self-consistent field: efficient decoupling algorithms for finding the best rank-one approximation of higher-order tensors
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- On the global convergence of the alternating least squares method for rank-one approximation to generic tensors
- SOTT: greedy approximation of a tensor as a sum of tensor trains
- Rank-one approximation of a higher-order tensor by a Riemannian trust-region method
- Accurate low-rank approximations via a few iterations of alternating least squares
- On Best Low Rank Approximation of Positive Definite Tensors
- Unfoldings and the rank-one approximation of the tensor
- Relaxation of the rank-1 tensor approximation using different norms
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- A recursive eigenspace computation for the canonical polyadic decomposition
- Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor
- On Orthogonal Tensors and Best Rank-One Approximation Ratio
- Algebraic methods for tensor data
- Numerical computation for orthogonal low-rank approximation of tensors
- SVD-based algorithms for the best rank-1 approximation of a symmetric tensor
- SVD-based algorithms for tensor wheel decomposition
- Rank-one approximation of positive matrices based on methods of tropical mathematics
- Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor
- The spectral theory of tensors and its applications
- Approximation of high-dimensional rank one tensors
- Probabilistic bounds on best rank-1 approximation ratio
- Subtracting a best rank‐1 approximation from p × p × 2(p≥2) tensors
- A modified Newton's method for best rank-one approximation to tensors
- Spherical optimization with complex variables for computing US-eigenpairs
- Spectral norm of a symmetric tensor and its computation
- Low-rank approximation of tensors
- On the Uniqueness and Perturbation to the Best Rank-One Approximation of a Tensor
This page was built for publication: On best rank one approximation of tensors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936742)
