{"id":"https://openalex.org/W4416611575","doi":"https://doi.org/10.1137/25m1764487","title":"An Additive Two-Level Parallel Variant of the DMRG Algorithm with Coarse-Space Correction","display_name":"An Additive Two-Level Parallel Variant of the DMRG Algorithm with Coarse-Space Correction","publication_year":2026,"publication_date":"2026-05-07","ids":{"openalex":"https://openalex.org/W4416611575","doi":"https://doi.org/10.1137/25m1764487"},"language":"en","primary_location":{"id":"doi:10.1137/25m1764487","is_oa":false,"landing_page_url":"https://doi.org/10.1137/25m1764487","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","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2505.23429","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040521001","display_name":"Laura Grigori","orcid":"https://orcid.org/0000-0002-5880-1076"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Laura Grigori","raw_affiliation_strings":["PSI Center for Scientific Computing, Theory, and Data, 5232 Villigen PSI, Switzerland and Institute of Mathematics, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), 1015 Lausanne, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PSI Center for Scientific Computing, Theory, and Data, 5232 Villigen PSI, Switzerland and Institute of Mathematics, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), 1015 Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101631409","display_name":"Muhammad Hassan","orcid":"https://orcid.org/0000-0002-7582-6670"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Muhammad Hassan","raw_affiliation_strings":["PSI Center for Scientific Computing, Theory, and Data, 5232 Villigen PSI, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-7582-6670","affiliations":[{"raw_affiliation_string":"PSI Center for Scientific Computing, Theory, and Data, 5232 Villigen PSI, Switzerland","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01754386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":"3","first_page":"A1312","last_page":"A1337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.4104999899864197,"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.4104999899864197,"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/T11471","display_name":"Block Copolymer Self-Assembly","score":0.14110000431537628,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.048900000751018524,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/density-matrix-renormalization-group","display_name":"Density matrix renormalization group","score":0.7181000113487244},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6966999769210815},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5979999899864197},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5187000036239624},{"id":"https://openalex.org/keywords/domain-decomposition-methods","display_name":"Domain decomposition methods","score":0.5073000192642212},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4521999955177307},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.43540000915527344},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4250999987125397}],"concepts":[{"id":"https://openalex.org/C29547527","wikidata":"https://www.wikidata.org/wiki/Q5259335","display_name":"Density matrix renormalization group","level":3,"score":0.7181000113487244},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6966999769210815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6747999787330627},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5979999899864197},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5187000036239624},{"id":"https://openalex.org/C198880260","wikidata":"https://www.wikidata.org/wiki/Q5289813","display_name":"Domain decomposition methods","level":3,"score":0.5073000192642212},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48730000853538513},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4521999955177307},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.43540000915527344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4250999987125397},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4250999987125397},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4235000014305115},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.3813999891281128},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.3723999857902527},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3529999852180481},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3077999949455261},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.30239999294281006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.298799991607666},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.263700008392334}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/25m1764487","is_oa":false,"landing_page_url":"https://doi.org/10.1137/25m1764487","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:2505.23429","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.23429","pdf_url":"https://arxiv.org/pdf/2505.23429","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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"},{"id":"doi:10.48550/arxiv.2505.23429","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.23429","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2505.23429","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2505.23429","pdf_url":"https://arxiv.org/pdf/2505.23429","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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/G6617287496","display_name":null,"funder_award_id":"810367","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G7683707404","display_name":null,"funder_award_id":"810367","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416611575.pdf","grobid_xml":"https://content.openalex.org/works/W4416611575.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"density":[1],"matrix":[2],"renormalization":[3],"group":[4],"(DMRG)":[5],"algorithm":[6,51],"is":[7,26,72,84],"a":[8,46,59,64],"popular":[9],"alternating":[10],"minimization":[11,56,97],"scheme":[12],"for":[13],"solving":[14],"high-dimensional":[15],"optimization":[16],"problems":[17],"in":[18,34,108],"the":[19,80,95,100,103,119],"tensor":[20],"train":[21],"format.":[22],"Classical":[23],"DMRG,":[24],"however,":[25],"based":[27],"on":[28,37,89,112],"sequential":[29],"minimization,":[30],"which":[31,71],"raises":[32],"challenges":[33],"its":[35],"implementation":[36,88],"parallel":[38,128],"computing":[39],"architectures.":[40],"To":[41],"overcome":[42],"this,":[43],"we":[44],"propose":[45],"novel":[47],"additive":[48,76],"two-level":[49],"DMRG":[50],"that":[52,118],"combines":[53],"independent,":[54],"local":[55,96],"steps":[57,98],"with":[58],"global":[60],"update":[61],"step":[62],"using":[63],"subsequent":[65],"coarse-space":[66,104],"minimization.":[67],"Our":[68],"proposed":[69],"algorithm,":[70],"directly":[73],"inspired":[74],"by":[75],"Schwarz":[77],"methods":[78],"from":[79],"domain":[81],"decomposition":[82],"literature,":[83],"particularly":[85],"amenable":[86],"to":[87],"parallel,":[90],"distributed":[91],"architectures":[92],"since":[93],"both":[94],"and":[99],"construction":[101],"of":[102],"can":[105],"be":[106],"performed":[107],"parallel.":[109],"Numerical":[110],"experiments":[111],"strongly":[113],"correlated":[114],"molecular":[115],"systems":[116],"demonstrate":[117],"method":[120],"achieves":[121],"competitive":[122],"convergence":[123],"rates":[124],"while":[125],"achieving":[126],"significant":[127],"speedups.":[129]},"counts_by_year":[],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}