{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:43:22Z","timestamp":1787330602622,"version":"build-2736575974"},"reference-count":46,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100010784","name":"Banco Santander","doi-asserted-by":"publisher","award":["21.SI01.64658"],"award-info":[{"award-number":["21.SI01.64658"]}],"id":[{"id":"10.13039\/100010784","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2017-83816-P"],"award-info":[{"award-number":["MTM2017-83816-P"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2017-90682-REDT"],"award-info":[{"award-number":["MTM2017-90682-REDT"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p>We prove the existence of an open set of $n_1\\times n_2 \\times n_3$ tensors of rank $r$ for which popular and efficient algorithms for computing tensor rank decompositions based on a reduction to a linear matrix pencil, typically followed by a generalized eigendecomposition, are arbitrarily numerically forward unstable. Our analysis shows that this problem is caused by the fact that the condition number of tensor rank decomposition can be much larger for $n_1 \\times n_2 \\times 2$ tensors than for the $n_1\\times n_2 \\times n_3$ input tensor. Moreover, we present a lower bound for the limiting distribution of the condition number of random tensor rank decompositions of third-order tensors. The numerical experiments illustrate that for random tensor rank decompositions one should anticipate a loss of precision of a few digits.<\/jats:p>","DOI":"10.1137\/18m1200531","type":"journal-article","created":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T11:44:09Z","timestamp":1560426249000},"page":"739-773","source":"Crossref","is-referenced-by-count":24,"title":["Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable"],"prefix":"10.1137","volume":"40","author":[{"given":"Carlos","family":"Beltr\u00e1n","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Breiding","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5692-4163","authenticated-orcid":true,"given":"Nick","family":"Vannieuwenhoven","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2019,6,13]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"E. Angelini, C. Bocci, and L. Chiantini,\n                      Real identifiability vs. complex identifiability\n                      , Linear Multilinear Algebra, (2017), pp. 1-11,https:\/\/doi.org\/10.1080\/03081087.2017.1347137.","DOI":"10.1080\/03081087.2017.1347137"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"M. F. Atiyah and I. G. MacDonald,\n                      Introduction to Commutative Algebra\n                      , Addison-Wesley Series in Mathematics, Addison-Wesley, Boston, 1969,https:\/\/doi.org\/10.1201\/9780429493638.","DOI":"10.1201\/9780429493638"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"L. Blum, F. Cucker, M. Shub, and S. Smale,\n                      Complexity and Real Computation\n                      , Springer-Verlag, New York, 1998,https:\/\/doi.org\/10.1007\/978-1-4612-0701-6.","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"J. Bochnak, M. Coste, and M. Roy,\n                      Real Algebraic Geometry\n                      , Springer-Verlag, New York, 1998.","DOI":"10.1007\/978-3-662-03718-8"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1137\/17M1142880"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"P. Breiding and N. Vannieuwenhoven,\n                      On the average condition number of tensor rank decompositions\n                      , preprint,arXiv:1801.01673, 2018.","DOI":"10.1137\/17M1142880"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009113"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser, M. Clausen, and M. A. Shokrollahi,\n                      Algebraic Complexity Theory\n                      , Grundlehren der mathematischen Wissenshaften 315, Springer, Berlin, 1997,https:\/\/doi.org\/10.1007\/978-3-662-03338-8.","DOI":"10.1007\/978-3-662-03338-8"},{"key":"atypb9","doi-asserted-by":"crossref","unstructured":"P. B\u00fcrgisser and F. Cucker,\n                      Condition: The Geometry of Numerical Algorithms\n                      , Grundlehren der mathematischen Wissenschaften 349, Springer, Berlin, 2013,https:\/\/doi.org\/10.1007\/978-3-642-38896-5.","DOI":"10.1007\/978-3-642-38896-5"},{"key":"atypb10","first-page":"1837","volume":"14","author":"Cai T.","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1112\/S0024610706022630"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/110829180"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/140961389"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/16M1090132"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(94)90029-9"},{"key":"atypb16","unstructured":"P. Comon and C. Jutten,\n                      Handbook of Blind Source Separation: Independent Component Analysis and Applications\n                      , Elsevier, New York, 2010."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/130916084"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.10.019"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(00)00117-9"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"W. H. Greub,\n                      Multilinear Algebra\n                      , Springer-Verlag, New York, 1978,https:\/\/doi.org\/10.1007\/978-1-4613-9425-9.","DOI":"10.1007\/978-1-4613-9425-9"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"W. Hackbusch,\n                      Tensor Spaces and Numerical Tensor Calculus\n                      , Springer Series in Computational Mathematics 42, Springer-Verlag, New York, 2012,https:\/\/doi.org\/10.1007\/978-3-642-28027-6.","DOI":"10.1007\/978-3-642-28027-6"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"J. Harris,\n                      Algebraic Geometry, A First Course\n                      , Graduate Text in Mathematics 133, Springer-Verlag, New York, 1992,https:\/\/doi.org\/10.1007\/978-1-4757-2189-8.","DOI":"10.1007\/978-1-4757-2189-8_11"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"J. Hauenstein, L. Oeding, G. Ottaviani, and A. Sommese,\n                      Homotopy techniques for tensor decomposition and perfect identifiability\n                      , J. Reine Angew. Math. (2016),https:\/\/doi.org\/10.1515\/crelle-2016-0067.","DOI":"10.1515\/crelle-2016-0067"},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"N. J. Higham,\n                      Accuracy and Stability of Numerical Algorithms\n                      , 2nd ed. SIAM, Philadelphia, 1996,https:\/\/doi.org\/10.1137\/1.9780898718027.","DOI":"10.1137\/1.9780898718027"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"P. M. Kroonenberg,\n                      Applied Multiway Data Analysis\n                      , Wiley Series in Probability and Statistics, John Wiley & Sons, Hoboken, NJ, 2008,https:\/\/doi.org\/10.1002\/9780470238004.","DOI":"10.1002\/9780470238004"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"J. M. Landsberg,\n                      Tensors: Geometry and Applications\n                      , Graduate Studies in Mathematics 128, AMS, Providence, RI, 2012,https:\/\/doi.org\/10.1090\/gsm\/128.","DOI":"10.1090\/gsm\/128"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"J. M. Lee,\n                      Introduction to Smooth Manifolds\n                      , 2nd ed., Graduate Texts in Mathematics 218, Springer-Verlag, New York, 2013,https:\/\/doi.org\/10.1007\/978-0-387-21752-9.","DOI":"10.1007\/978-1-4419-9982-5_1"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/0614071"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1021\/ac00289a052"},{"key":"atypb36","doi-asserted-by":"crossref","unstructured":"P. Petersen,\n                      Riemannian Geometry\n                      , 2nd ed., Graduate Texts in Mathematics 171, Springer, New York, 2006,https:\/\/doi.org\/10.1007\/978-0-387-29403-2.","DOI":"10.1007\/978-0-387-29403-2"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/16M1063708"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1137\/0703023"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1180040105"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293598"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"atypb42","doi-asserted-by":"crossref","unstructured":"A. Smilde, R. Bro, and P. Geladi,\n                      Multi-way Analysis: Applications in the Chemical Sciences\n                      , John Wiley & Sons, Hoboken, NJ, 2004.","DOI":"10.1002\/0470012110"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.08.014"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1137\/110836067"},{"key":"atypb46","unstructured":"N. Vervliet, O. Debals, L. Sorber, M. Van Barel, and L. De Lathauwer,\n                      Tensorlab v3.0\n                      , March 2016,http:\/\/www.tensorlab.net."}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/18M1200531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:15:13Z","timestamp":1787328913000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/18M1200531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1137\/18M1200531"],"URL":"https:\/\/doi.org\/10.1137\/18m1200531","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}