# On the rank-one approximation of symmetric tensors

@article{OHara2011OnTR, title={On the rank-one approximation of symmetric tensors}, author={Michael J. O'Hara}, journal={arXiv: Computation}, year={2011} }

The problem of symmetric rank-one approximation of symmetric tensors is important in Independent Components Analysis, also known as Blind Source Separation, as well as polynomial optimization. We analyze the symmetric rank-one approximation problem for symmetric tensors and derive several perturbation results. Given a symmetric rank-one tensor obscured by noise, we provide bounds on the accuracy of the best symmetric rank-one approximation for recovering the original rank-one structure, and we…

## References

SHOWING 1-8 OF 8 REFERENCES

On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors

- MathematicsSIAM J. Matrix Anal. Appl.
- 2002

It is shown that a symmetric version of the above method converges under assumptions of convexity (or concavity) for the functional induced by the tensor in question, assumptions that are very often satisfied in practical applications.

Z-eigenvalue methods for a global polynomial optimization problem

- Computer ScienceMath. Program.
- 2009

This paper proposes some Z-eigenvalue methods for solving the problem of the best rank-one approximation to higher order tensors, and proposes a direct orthogonal transformation Z- eigenvalue method for this problem in the case of order three and dimension three.

Shifted Power Method for Computing Tensor Eigenpairs

- Computer ScienceSIAM J. Matrix Anal. Appl.
- 2011

A shifted symmetric higher-order power method (SS-HOPM), which it is shown is guaranteed to converge to a tensor eigenpair, and a fixed point analysis is used to characterize exactly which eigenpairs can and cannot be found by the method.

Rank-One Approximation to High Order Tensors

- Computer ScienceSIAM J. Matrix Anal. Appl.
- 2001

The singular value decomposition has been extensively used in engineering and statistical applications and certain properties of this decomposition are investigated as well as numerical algorithms.

On the successive supersymmetric rank‐1 decomposition of higher‐order supersymmetric tensors

- Computer ScienceNumer. Linear Algebra Appl.
- 2007

It is shown that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetry tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices.

Singular values and eigenvalues of tensors: a variational approach

- Mathematics1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2005.
- 2005

We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix…