Abstract
We show that a best rank one approximation to a real symmetric tensor, which in principle can be nonsymmetric, can be chosen symmetric. Furthermore, a symmetric best rank one approximation to a symmetric tensor is unique if the tensor does not lie on a certain real algebraic variety.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chen B, He S, Li Z, Zhang S. Maximum block improvement and polynomial optimization. SIAM J Optim, 2012, 22: 87–107
Defant A, Floret K. Tensor Norms and Operator Ideals. Amsterdam: North-Holland, 1993
Friedland S. Inverse eigenvalue problems. Linear Algebra Appl, 1977, 17: 15–51
Friedland S. Variation of tensor powers and spectra. Linear Multilinear Algebra, 1982, 12: 81–98
Friedland S, Robbin J, Sylvester J. On the crossing rule. Comm Pure Appl Math, 1984, 37: 19–37
Golub G H, Van Loan C F. Matrix Computation. 3rd ed. Baltimore: John Hopkins Univ Press, 1996
Kolda T G. On the best rank-k approximation of a symmetric tensor. Householder, 2011
Lim L -H. Singular values and eigenvalues of tensors: a variational approach. In: Proc IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, (CAMSAP ’05), 1. 2005, 129–132
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Friedland, S. Best rank one approximation of real symmetric tensors can be chosen symmetric. Front. Math. China 8, 19–40 (2013). https://doi.org/10.1007/s11464-012-0262-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11464-012-0262-x