{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,4]],"date-time":"2026-11-04T20:09:00Z","timestamp":1793822940187,"version":"4.6.1"},"reference-count":63,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>We present an alternative strategy for truncating the higher-order singular value decomposition (T-HOSVD). An error expression for an approximate Tucker decomposition with orthogonal factor matrices is presented, leading us to propose a novel truncation strategy for the HOSVD, which we refer to as the sequentially truncated higher-order singular value decomposition (ST-HOSVD). This decomposition retains several favorable properties of the T-HOSVD, while reducing the number of operations required to compute the decomposition and practically always improving the approximation error. Three applications are presented, demonstrating the effectiveness of ST-HOSVD. In the first application, ST-HOSVD, T-HOSVD, and higher-order orthogonal iteration (HOOI) are employed to compress a database of images of faces. On average, the ST-HOSVD approximation was only $0.1\\%$ worse than the optimum computed by HOOI, while cutting the execution time by a factor of $20$. In the second application, classification of handwritten digits, ST-HOSVD achieved a speedup factor of $50$ over T-HOSVD during the training phase, and reduced the classification time and storage costs, while not significantly affecting the classification error. The third application demonstrates the effectiveness of ST-HOSVD in compressing results from a numerical simulation of a partial differential equation. In such problems, ST-HOSVD inevitably can greatly improve the running time. We present an example wherein the 2 hour $45$ minute calculation of T-HOSVD was reduced to just over one minute by ST-HOSVD, representing a speedup factor of $133$, while even improving the memory consumption.<\/jats:p>","DOI":"10.1137\/110836067","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T18:20:42Z","timestamp":1333477242000},"page":"A1027-A1052","source":"Crossref","is-referenced-by-count":257,"title":["A New Truncation Strategy for the Higher-Order Singular Value Decomposition"],"prefix":"10.1137","volume":"34","author":[{"given":"Nick","family":"Vannieuwenhoven","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Raf","family":"Vandebril","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karl","family":"Meerbergen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2012,4,3]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"E. Anderson, Z. Bai, C. Bischof, S. Blackford, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, and D. Sorensen,\n                      LAPACK Users' Guide, Third Edition\n                      , SIAM, Philadelphia, PA, 1999.","DOI":"10.1137\/1.9780898719604"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00010-0"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1145\/1186785.1186794"},{"key":"R4","unstructured":"B. Bader and T. Kolda,\n                      MATLAB Tensor Toolbox Version $2.4$\n                      , Mar. 2010, current version available online at http:\/\/www.sandia.gov\/~tgkdda\/TensorToolbox\/."},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1080\/00268976.2010.523713"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(98)00011-2"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/070711621"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/060661569"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.910956"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898346995"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2004.01.016"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/06066518X"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"J. W. Demmel,\n                      Applied Numerical Linear Algebra\n                      , SIAM, Philadelphia, PA, 1997.","DOI":"10.1137\/1.9781611971446"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1137\/070688316"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(01)00140-X"},{"key":"R17","unstructured":"G. Golub and C. Van Loan,\n                      Matrix Computations\n                      , 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996."},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/090764189"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.917929"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.03.007"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-009-9094-9"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.06.006"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/090764827"},{"key":"R25","first-page":"337","volume":"42","author":"Ishteva M.","year":"2008","journal-title":"Int. J. Pure Appl. Math."},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-008-9251-2"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.2478\/cmam-2006-0010"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801387413"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293599"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(03)00085-2"},{"key":"R32","doi-asserted-by":"crossref","unstructured":"C. Liu, J. Zhou, and K. He,\n                      Image compression based on truncated HOSVD\n                      , in Proceedings of the International Conference on Information Engineering and Computer Science, IEEE Press, Piscataway, NJ, 2009, pp. 1\u20134.","DOI":"10.1109\/ICIECS.2009.5366618"},{"key":"R33","unstructured":"N. Liu, B. Zhang, J. Yan, Z. Chen, W. Liu, F. Bai, and L. Chien,\n                      Text representation: From vector to tensor\n                      , Proceedings of the IEEE International Conference on Data Mining, J. Han, B. W. Wah, V. Raghavan, X. Wu, and R. Rastogi, eds., IEEE Computer Society, Los Alamitos, CA, 2005, pp. 725\u2013728."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"X. Liu, L. De Lathauwer, F. Janssens, and B. De Moor,\n                      Hybrid clustering of multiple information sources via HOSVD\n                      , in Advances in Neural Networks - ISNN 2010, L. Zhang, B.L. Lu, and J. Kwok, eds., Lecture Notes in Comput. Sci. 6064, Springer, Berlin, Heidelberg, 2010, pp. 337\u2013345.","DOI":"10.1007\/978-3-642-13318-3_42"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2009.12.003"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1016\/j.specom.2010.08.007"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1109\/TSA.2005.858055"},{"key":"R38","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2005.12.016"},{"key":"R39","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.863112"},{"key":"R40","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709146104"},{"key":"R41","doi-asserted-by":"crossref","unstructured":"L. Omberg, J. Meyerson, K. Kobayashi, L. Drury, J. Diffley, and O. Alter,\n                      Global effects of DNA replication and DNA replication origin activity on eukaryotic gene expression\n                      , Molec. Systems Biol., 5 (2009), 312.","DOI":"10.1038\/msb.2009.70"},{"key":"R42","doi-asserted-by":"crossref","unstructured":"I. V. Oseledets,\n                      Tensor-train decomposition\n                      , SIAM J. Sci. Comput., 33 (2011), pp. 2295\u20132317.","DOI":"10.1137\/090752286"},{"key":"R43","doi-asserted-by":"publisher","DOI":"10.1137\/090748330"},{"key":"R44","doi-asserted-by":"publisher","DOI":"10.1134\/S1064562409040036"},{"key":"R45","doi-asserted-by":"publisher","DOI":"10.1002\/nla.453"},{"key":"R46","unstructured":"Y. Saad,\n                      Numerical Methods for Large Eigenvalue Problems\n                      , Manchester University Press, Manchester, UK, 1992."},{"key":"R47","doi-asserted-by":"crossref","unstructured":"Y. Saad,\n                      Iterative Methods for Sparse Linear Systems, Second Edition,\n                      SIAM, Philadelphia, PA, 2003.","DOI":"10.1137\/1.9780898718003"},{"key":"R48","doi-asserted-by":"crossref","unstructured":"F. Samaria and A. Harter,\n                      Parameterisation of a stochastic model for human face identification\n                      , in Proceedings of the Second IEEE Workshop on Applications of Computer Vision, IEEE Press, Piscataway, NJ, pp. 138\u2013142.","DOI":"10.1109\/ACV.1994.341300"},{"key":"R49","unstructured":"B. Savas,\n                      Analyses and Tests of Handwritten Digit Recognition Algorithms\n                      , examensarbete (Master's thesis), Department of Mathematics, Tekniska H\u00f6gskolan i Link\u00f6ping, Link\u00f6ping, Sweden, 2003."},{"key":"R50","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.08.004"},{"key":"R51","doi-asserted-by":"publisher","DOI":"10.1137\/090763172"},{"key":"R52","doi-asserted-by":"crossref","unstructured":"J.T. Sun, H.J. Zeng, H. Liu, Y. Lu, and Z. Chen,\n                      CubeSVD: A novel approach to personalized web search\n                      , in Proceedings of the 14th international conference on World Wide Web (WWW '05), ACM, New York, 2005, pp. 382\u2013390.","DOI":"10.1145\/1060745.1060803"},{"key":"R53","doi-asserted-by":"crossref","unstructured":"P. Symeonidis, A. Nanopoulos, and Y. Manolopoulos,\n                      Tag recommendations based on tensor dimensionality reduction\n                      , in Proceedings of the 2008 ACM Conference on Recommender Systems, New York, 2008, ACM, New York, 2008, pp. 43\u201350.","DOI":"10.1145\/1454008.1454017"},{"key":"R54","unstructured":"L. Tucker,\n                      Implications of factor analysis of three-way matrices for measurement of change\n                      , in Problems in Measuring Change, C. Harris, ed., University of Wisconsin Press, Madison, WI, 1963, pp. 122\u2013137."},{"key":"R55","unstructured":"L. Tucker,\n                      The extension of factor analysis to three-dimensional matrices\n                      , in Contributions to Mathematical Psychology, H. Gulliksen and N. Frederiksen, eds., Holt, Rinehardt, & Winston, New York, 1964, pp. 110\u2013127."},{"key":"R56","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"R57","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00393-9"},{"key":"R58","unstructured":"N. Vannieuwenhoven, R. Vandebril, and K. Meerbergen,\n                      On the Truncated Multilinear Singular Value Decomposition\n                      , Technical Report TW589, Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium, 2011."},{"key":"R59","doi-asserted-by":"crossref","unstructured":"M. Vasilescu and D. Terzopoulos,\n                      Multilinear image analysis for facial recognition\n                      , in Proceedings of the 16th International Conference on Pattern Recognition, IEEE Computer Society, Los Alamitos, CA, 2002, Vol. 2, pp. 511\u2013514.","DOI":"10.1109\/ICPR.2002.1048350"},{"key":"R60","first-page":"93","volume":"2","author":"Vasilescu M.","year":"2003","journal-title":"IEEE Computer Soc. Conf. Computer Vision and Pattern Recognition"},{"key":"R61","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015725"},{"key":"R62","doi-asserted-by":"crossref","unstructured":"H. Wang and N. Ahuja,\n                      Facial expression decomposition\n                      , in Proceedings of the Ninth IEEE International Conference on Computer Vision., 2003, Vol. 2, pp. 958\u2013965.","DOI":"10.1109\/ICCV.2003.1238452"},{"key":"R63","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899352045"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/110836067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:50:05Z","timestamp":1787331005000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/110836067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1137\/110836067"],"URL":"https:\/\/doi.org\/10.1137\/110836067","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"value":"1064-8275","type":"print"},{"value":"1095-7197","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}