{"id":"https://openalex.org/W2504586482","doi":"https://doi.org/10.1137/16m1085413","title":"Hierarchical Approximate Proper Orthogonal Decomposition","display_name":"Hierarchical Approximate Proper Orthogonal Decomposition","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2504586482","doi":"https://doi.org/10.1137/16m1085413","mag":"2504586482"},"language":"en","primary_location":{"id":"doi:10.1137/16m1085413","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1085413","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1607.05210","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christian Himpe","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christian Himpe","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Tobias Leibner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tobias Leibner","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Stephan Rave","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stephan Rave","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3048,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.88121869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"40","issue":"5","first_page":"A3267","last_page":"A3292"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.9635000228881836,"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"}},"topics":[{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.9635000228881836,"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"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.006500000134110451,"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.0024999999441206455,"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/proper-orthogonal-decomposition","display_name":"Proper orthogonal decomposition","score":0.7572000026702881},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6152999997138977},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.59170001745224},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5446000099182129},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5166000127792358},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4876999855041504},{"id":"https://openalex.org/keywords/point-of-delivery","display_name":"Point of delivery","score":0.4860999882221222},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46070000529289246}],"concepts":[{"id":"https://openalex.org/C2984998066","wikidata":"https://www.wikidata.org/wiki/Q105037988","display_name":"Proper orthogonal decomposition","level":3,"score":0.7572000026702881},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7085000276565552},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6152999997138977},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.59170001745224},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5446000099182129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5306000113487244},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5166000127792358},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4876999855041504},{"id":"https://openalex.org/C137776501","wikidata":"https://www.wikidata.org/wiki/Q7208270","display_name":"Point of delivery","level":2,"score":0.4860999882221222},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46070000529289246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.424699991941452},{"id":"https://openalex.org/C144986985","wikidata":"https://www.wikidata.org/wiki/Q871236","display_name":"Hierarchical database model","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4007999897003174},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3395000100135803},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.31060001254081726},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30649998784065247},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2971999943256378},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27869999408721924},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.25279998779296875}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1085413","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1085413","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:arXiv.org:1607.05210","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.05210","pdf_url":"https://arxiv.org/pdf/1607.05210","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1607.05210","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1607.05210","pdf_url":"https://arxiv.org/pdf/1607.05210","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4213669165","display_name":null,"funder_award_id":"FF-2015-07","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5613914020","display_name":null,"funder_award_id":"0324019B","funder_id":"https://openalex.org/F4320323803","funder_display_name":"Bundesministerium f\u00fcr Wirtschaft und Energie"},{"id":"https://openalex.org/G6993206844","display_name":null,"funder_award_id":"05M13PMA","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"},{"id":"https://openalex.org/F4320323803","display_name":"Bundesministerium f\u00fcr Wirtschaft und Energie","ror":"https://ror.org/02vgg2808"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1261010427","https://openalex.org/W1633869374","https://openalex.org/W1844174069","https://openalex.org/W1965229672","https://openalex.org/W1970576574","https://openalex.org/W1997870068","https://openalex.org/W2017745440","https://openalex.org/W2028961914","https://openalex.org/W2040387238","https://openalex.org/W2060059568","https://openalex.org/W2071576089","https://openalex.org/W2116464458","https://openalex.org/W2117756735","https://openalex.org/W2131347209","https://openalex.org/W2140839682","https://openalex.org/W2154249783","https://openalex.org/W2167434086","https://openalex.org/W2182850465","https://openalex.org/W2230918517","https://openalex.org/W2270314036","https://openalex.org/W2276712392","https://openalex.org/W2546500126","https://openalex.org/W2553418869"],"related_works":[],"abstract_inverted_index":{"Proper":[0],"Orthogonal":[1],"Decomposition":[2],"(POD)":[3],"is":[4],"a":[5,42,63,67],"widely":[6],"used":[7],"technique":[8],"for":[9,95],"the":[10,33,83,117],"construction":[11],"of":[12,27,56,65,70,119],"low-dimensional":[13],"approximation":[14],"spaces":[15],"from":[16],"high-dimensional":[17],"input":[18,28,71],"data.":[19],"For":[20],"large-scale":[21],"applications":[22],"and":[23,122],"an":[24,48],"increasing":[25],"number":[26,69],"data":[29],"vectors,":[30],"however,":[31],"computing":[32],"POD":[34,50,64,92,107],"often":[35],"becomes":[36],"prohibitively":[37],"expensive.":[38],"This":[39],"work":[40],"presents":[41],"general,":[43],"easy-to-implement":[44],"approach":[45],"to":[46,80],"compute":[47],"approximate":[49,91],"based":[51],"on":[52],"arbitrary":[53],"tree":[54,74],"hierarchies":[55],"worker":[57,61],"nodes,":[58],"where":[59],"each":[60],"computes":[62],"only":[66],"small":[68],"vectors.":[72],"The":[73],"hierarchy":[75],"can":[76],"be":[77],"freely":[78],"adapted":[79],"optimally":[81],"suit":[82],"available":[84],"computational":[85],"resources.":[86],"In":[87],"particular,":[88],"this":[89],"hierarchical":[90],"(HAPOD)":[93],"allows":[94],"both":[96],"simple":[97],"parallelization":[98],"with":[99],"low":[100],"communication":[101],"overhead,":[102],"as":[103,105],"well":[104],"incremental":[106],"computation":[108],"under":[109],"constrained":[110],"memory":[111],"capacities.":[112],"Rigorous":[113],"error":[114],"estimates":[115],"ensure":[116],"reliability":[118],"our":[120],"approach,":[121],"extensive":[123],"numerical":[124],"examples":[125],"underline":[126],"its":[127],"performance.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2016-08-23T00:00:00"}
