{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T18:18:43Z","timestamp":1790014723505,"version":"4.0.1"},"reference-count":21,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1316779"],"award-info":[{"award-number":["DMS-1316779"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","award":["R-146-000-236-114"],"award-info":[{"award-number":["R-146-000-236-114"]}],"id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>This paper revisits the problem of finding the best rank-1 approximation to a symmetric tensor and makes three contributions. First, in contrast to the many long and lingering arguments in the literature, it offers a straightforward justification that generically the best rank-1 approximation to a symmetric tensor is symmetric. Second, in contrast to the typical workhorse in the practice for the low-rank tensor approximation, namely, the alternating least squares (ALS) technique which improves one factor a time, this paper proposes three alternative algorithms based on the singular value decomposition (SVD) that modifies two factors a time. One step of SVD-based iteration is superior to two steps of ALS iterations. Third, it is not only proved that the generalized Rayleigh quotients generated from the three SVD-based algorithms enjoy monotone convergence, but also that the iterates themselves converge.<\/jats:p>","DOI":"10.1137\/17m1136699","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T12:09:07Z","timestamp":1530619747000},"page":"1095-1115","source":"Crossref","is-referenced-by-count":32,"title":["SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor"],"prefix":"10.1137","volume":"39","author":[{"given":"Yu","family":"Guan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moody T.","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7736-7490","authenticated-orcid":true,"given":"Delin","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.4064\/sm-7-1-36-44"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/141000658"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.06.046"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/060661569"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2570862"},{"key":"atypb6","unstructured":"M. Dana and K. D. Ikramov,\n                      On the codimension of the variety of symmetric matrices with multiple eigenvalues\n                      , Zap. Nauchn. Sem. S.Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 323 (2005), pp. 34-46, 224."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0262-x"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1878"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/11085743X"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/140975577"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801387413"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0895-0"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2007.01.008"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/100795802"},{"key":"atypb17","doi-asserted-by":"crossref","unstructured":"A. J. Sommese and C. W. Wampler, II,\n                      The Numerical Solution of Systems of Polynomials Arising in Engineering and Science\n                      , World Scientific, Hackensack, NJ, 2005.","DOI":"10.1142\/5763"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1137\/110836067"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/130938207"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899352045"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/110835335"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1136699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:36:11Z","timestamp":1787333771000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1136699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1136699"],"URL":"https:\/\/doi.org\/10.1137\/17m1136699","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}