{"id":"https://openalex.org/W2055913665","doi":"https://doi.org/10.1137/110836067","title":"A New Truncation Strategy for the Higher-Order Singular Value Decomposition","display_name":"A New Truncation Strategy for the Higher-Order Singular Value Decomposition","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2055913665","doi":"https://doi.org/10.1137/110836067","mag":"2055913665"},"language":"en","primary_location":{"id":"doi:10.1137/110836067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110836067","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/337210","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047646325","display_name":"Nick Vannieuwenhoven","orcid":"https://orcid.org/0000-0001-5692-4163"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Nick Vannieuwenhoven","raw_affiliation_strings":["nick.vannieuwenhoven@cs.kleuven.be and raf.vandebril@cs.kleuven.be and karl.meerbergen@cs.kleuven.be#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"nick.vannieuwenhoven@cs.kleuven.be and raf.vandebril@cs.kleuven.be and karl.meerbergen@cs.kleuven.be#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039999347","display_name":"Raf Vandebril","orcid":"https://orcid.org/0000-0003-2119-8696"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Raf Vandebril","raw_affiliation_strings":["Numerical Approximation and Linear Algebra Group, Department of Computer Science, KU Leuven, Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Numerical Approximation and Linear Algebra Group, Department of Computer Science, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079388991","display_name":"Karl Meerbergen","orcid":"https://orcid.org/0000-0002-1508-0248"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Karl Meerbergen","raw_affiliation_strings":["Numerical Approximation and Linear Algebra Group, Department of Computer Science, KU Leuven, Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Numerical Approximation and Linear Algebra Group, Department of Computer Science, KU Leuven, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047646325"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":2.4615,"has_fulltext":false,"cited_by_count":289,"citation_normalized_percentile":{"value":0.85714286,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"34","issue":"2","first_page":"A1027","last_page":"A1052"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9900000095367432,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.6883413791656494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6859151124954224},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.5815080404281616},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5802688598632812},{"id":"https://openalex.org/keywords/truncation-error","display_name":"Truncation error","score":0.5049198269844055},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4878232777118683},{"id":"https://openalex.org/keywords/tucker-decomposition","display_name":"Tucker decomposition","score":0.47389736771583557},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39211517572402954},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3832704424858093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33516785502433777},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.27347415685653687},{"id":"https://openalex.org/keywords/multilinear-map","display_name":"Multilinear map","score":0.1526889204978943},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1048249900341034},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07772141695022583}],"concepts":[{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.6883413791656494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6859151124954224},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.5815080404281616},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5802688598632812},{"id":"https://openalex.org/C104942944","wikidata":"https://www.wikidata.org/wiki/Q3434686","display_name":"Truncation error","level":2,"score":0.5049198269844055},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4878232777118683},{"id":"https://openalex.org/C42704193","wikidata":"https://www.wikidata.org/wiki/Q7851097","display_name":"Tucker decomposition","level":4,"score":0.47389736771583557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39211517572402954},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3832704424858093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33516785502433777},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.27347415685653687},{"id":"https://openalex.org/C84392682","wikidata":"https://www.wikidata.org/wiki/Q1952404","display_name":"Multilinear map","level":2,"score":0.1526889204978943},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1048249900341034},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07772141695022583},{"id":"https://openalex.org/C2986737658","wikidata":"https://www.wikidata.org/wiki/Q30103009","display_name":"Tensor decomposition","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110836067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110836067","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/337210","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/337210","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing, vol. 34 (2), Art.No. 2, (A1027-A1052)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/337210","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/337210","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing, vol. 34 (2), Art.No. 2, (A1027-A1052)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W49160414","https://openalex.org/W1480928214","https://openalex.org/W1489840835","https://openalex.org/W1506342804","https://openalex.org/W1547113838","https://openalex.org/W1563653928","https://openalex.org/W1653830272","https://openalex.org/W1760551737","https://openalex.org/W1775346971","https://openalex.org/W1963826206","https://openalex.org/W1964650132","https://openalex.org/W1981745143","https://openalex.org/W1991042426","https://openalex.org/W1993482030","https://openalex.org/W1995406764","https://openalex.org/W2002598080","https://openalex.org/W2013912476","https://openalex.org/W2018282388","https://openalex.org/W2021514353","https://openalex.org/W2021958990","https://openalex.org/W2024165284","https://openalex.org/W2024182011","https://openalex.org/W2024986448","https://openalex.org/W2031702140","https://openalex.org/W2036226226","https://openalex.org/W2036718271","https://openalex.org/W2037271374","https://openalex.org/W2038198231","https://openalex.org/W2039001924","https://openalex.org/W2039748980","https://openalex.org/W2050838977","https://openalex.org/W2051013112","https://openalex.org/W2059959502","https://openalex.org/W2060225944","https://openalex.org/W2073389244","https://openalex.org/W2074624752","https://openalex.org/W2076214866","https://openalex.org/W2076459794","https://openalex.org/W2088025933","https://openalex.org/W2088837947","https://openalex.org/W2090799283","https://openalex.org/W2092647425","https://openalex.org/W2099694394","https://openalex.org/W2103560185","https://openalex.org/W2104803220","https://openalex.org/W2108207327","https://openalex.org/W2111363262","https://openalex.org/W2120077398","https://openalex.org/W2130426352","https://openalex.org/W2131691213","https://openalex.org/W2132267493","https://openalex.org/W2149183719","https://openalex.org/W2153763188","https://openalex.org/W2156477073","https://openalex.org/W2160551639","https://openalex.org/W2160664759","https://openalex.org/W2167143366","https://openalex.org/W2167372553","https://openalex.org/W2169751456","https://openalex.org/W2330159389","https://openalex.org/W2522330017","https://openalex.org/W2798909945"],"related_works":["https://openalex.org/W2040666836","https://openalex.org/W2238041693","https://openalex.org/W2112774109","https://openalex.org/W125347959","https://openalex.org/W1990789772","https://openalex.org/W138907054","https://openalex.org/W2536422707","https://openalex.org/W24145419","https://openalex.org/W2044869171","https://openalex.org/W2073514592"],"abstract_inverted_index":{"We":[0,200],"present":[1,201],"an":[2,17,202],"alternative":[3],"strategy":[4,34],"for":[5,16,35],"truncating":[6],"the":[7,36,43,58,62,69,75,83,88,110,118,125,134,151,156,166,173,197,205,231],"higher-order":[8,46,94],"singular":[9,47],"value":[10,48],"decomposition":[11,20,49,52,70],"(T-HOSVD).":[12],"An":[13],"error":[14],"expression":[15],"approximate":[18],"Tucker":[19],"with":[21],"orthogonal":[22,95],"factor":[23,130,145,225],"matrices":[24],"is":[25],"presented,":[26,81],"leading":[27],"us":[28],"to":[29,41,67,100,215],"propose":[30],"a":[31,102,129,143,181,185,223],"novel":[32],"truncation":[33],"HOSVD,":[37],"which":[38],"we":[39],"refer":[40],"as":[42],"sequentially":[44],"truncated":[45],"(ST-HOSVD).":[50],"This":[51],"retains":[53],"several":[54],"favorable":[55],"properties":[56],"of":[57,64,85,104,106,131,138,146,175,184,211,226],"T-HOSVD,":[59,92],"while":[60,123,162,228],"reducing":[61],"number":[63],"operations":[65],"required":[66],"compute":[68],"and":[71,93,154,159],"practically":[72],"always":[73],"improving":[74,230],"approximation":[76,112],"error.":[77,168],"Three":[78],"applications":[79],"are":[80,98],"demonstrating":[82],"effectiveness":[84,174],"ST-HOSVD.":[86],"In":[87,133,189],"first":[89],"application,":[90,136],"ST-HOSVD,":[91,221],"iteration":[96],"(HOOI)":[97],"employed":[99],"compress":[101],"database":[103],"images":[105],"faces.":[107],"On":[108],"average,":[109],"ST-HOSVD":[111,141,176,192],"was":[113,213],"only":[114],"$0.1\\%$":[115],"worse":[116],"than":[117],"optimum":[119],"computed":[120],"by":[121,128,220],"HOOI,":[122],"cutting":[124],"execution":[126],"time":[127,158],"$20$.":[132],"second":[135],"classification":[137,157,167],"handwritten":[139],"digits,":[140],"achieved":[142],"speedup":[144,224],"$50$":[147],"over":[148,217],"T-HOSVD":[149,212],"during":[150],"training":[152],"phase,":[153],"reduced":[155,214],"storage":[160],"costs,":[161],"not":[163],"significantly":[164],"affecting":[165],"The":[169],"third":[170],"application":[171],"demonstrates":[172],"in":[177],"compressing":[178],"results":[179],"from":[180],"numerical":[182],"simulation":[183],"partial":[186],"differential":[187],"equation.":[188],"such":[190],"problems,":[191],"inevitably":[193],"can":[194],"greatly":[195],"improve":[196],"running":[198],"time.":[199],"example":[203],"wherein":[204],"2":[206],"hour":[207],"$45$":[208],"minute":[209,219],"calculation":[210],"just":[216],"one":[218],"representing":[222],"$133$,":[227],"even":[229],"memory":[232],"consumption.":[233]},"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":31},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":26},{"year":2022,"cited_by_count":34},{"year":2021,"cited_by_count":40},{"year":2020,"cited_by_count":27},{"year":2019,"cited_by_count":26},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-10T08:33:47.465468","created_date":"2025-10-10T00:00:00"}