{"id":"https://openalex.org/W7095150320","doi":null,"title":"Hierarchical Tucker Format","display_name":"Hierarchical Tucker Format","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095150320"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.2230","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.2230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mis.mpg.de/preprints/2010/preprint2010_57.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095150320"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jonas Ballani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Jonas Ballani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Lars Grasedyck","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Lars Grasedyck","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Melanie Kluge","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Melanie Kluge","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9990000128746033,"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.9990000128746033,"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tensor-approximation","display_name":"tensor approximation","score":0.6940000057220459},{"id":"https://openalex.org/keywords/higher-order-tensors","display_name":"higher-order tensors","score":0.7559999823570251},{"id":"https://openalex.org/keywords/storage-complexity","display_name":"storage complexity","score":0.7419999837875366},{"id":"https://openalex.org/keywords/tensor-reconstruction","display_name":"tensor reconstruction","score":0.5649999976158142},{"id":"https://openalex.org/keywords/error-bounds","display_name":"error bounds","score":0.953000009059906},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.550000011920929}],"concepts":[{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.7404999732971191},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6410999894142151},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5371999740600586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5156000256538391},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.45419999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43689998984336853},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.429500013589859},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38339999318122864},{"id":"https://openalex.org/C51255310","wikidata":"https://www.wikidata.org/wiki/Q1163016","display_name":"Tensor product","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37369999289512634},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.36169999837875366},{"id":"https://openalex.org/C158158286","wikidata":"https://www.wikidata.org/wiki/Q9009080","display_name":"Invariants of tensors","level":3,"score":0.35839998722076416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3199000060558319},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31630000472068787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3066999912261963},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.27379998564720154},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.26669999957084656},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.260699987411499},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.432.2230","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.432.2230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mis.mpg.de/preprints/2010/preprint2010_57.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1967538125","https://openalex.org/W330778925","https://openalex.org/W2038198231","https://openalex.org/W2076028636","https://openalex.org/W1979098872","https://openalex.org/W2303179439","https://openalex.org/W2610645496","https://openalex.org/W2096699795","https://openalex.org/W7047753964","https://openalex.org/W6888059943"],"abstract_inverted_index":{"We":[0],"derive":[1,106],"and":[2,30,57,128,139],"analyse":[3],"a":[4,23,38,47,60,68,154],"scheme":[5],"for":[6,153],"the":[7,18,27,34,43,71,97,113,119,136,150],"approximation":[8,66],"of":[9,26,46,83,115,118,125],"order":[10,137],"d":[11,78,88,138],"tensors":[12,95,104],"A":[13],"\u2208":[14],"R":[15],"n\u00d7\u00b7\u00b7\u00b7\u00d7n":[16],"in":[17,49,70,74,96],"hierarchical":[19],"(H-)":[20],"Tucker":[21,28],"format,":[22],"dimension-multilevel":[24],"variant":[25],"format":[29,51,73,99],"strongly":[31],"related":[32],"to":[33,67,135],"TT":[35],"format.":[36],"For":[37,102],"fixed":[39],"rank":[40,151],"parameter":[41,152],"k,":[42],"storage":[44],"complexity":[45],"tensor":[48,69],"H-Tucker":[50,72,98],"is":[52],"O(dk":[53,75],"3":[54,86],"+":[55,77,87],"dnk)":[56],"we":[58,105,140],"present":[59],"(heuristic)":[61],"algorithm":[62],"that":[63,109,146],"finds":[64],"an":[65,143],"4":[76],"log(d)nk":[79,89],"2)":[80],"by":[81,121],"inspection":[82],"only":[84],"dk":[85],"2":[90],"entries.":[91],"Under":[92],"mild":[93],"assumptions,":[94],"are":[100,110],"reconstructed.":[101],"general":[103],"error":[107],"bounds":[108],"based":[111],"on":[112],"approximability":[114],"matrices":[116],"(matricizations":[117],"tensor)":[120],"few":[122],"outer":[123],"products":[124],"its":[126],"rows":[127],"columns.":[129],"The":[130],"construction":[131],"parallelizes":[132],"with":[133],"respect":[134],"also":[141],"propose":[142],"adaptive":[144],"approach":[145],"aims":[147],"at":[148],"finding":[149],"given":[155],"target":[156],"accuracy":[157],"\u03b5":[158],"automatically.":[159]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095150320","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}
