{"id":"https://openalex.org/W3093305795","doi":"https://doi.org/10.1137/20m1373475","title":"Hierarchical Orthogonal Factorization: Sparse Square Matrices","display_name":"Hierarchical Orthogonal Factorization: Sparse Square Matrices","publication_year":2022,"publication_date":"2022-01-24","ids":{"openalex":"https://openalex.org/W3093305795","doi":"https://doi.org/10.1137/20m1373475","mag":"3093305795"},"language":"en","primary_location":{"id":"doi:10.1137/20m1373475","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1373475","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090912313","display_name":"Abeynaya Gnanasekaran","orcid":"https://orcid.org/0000-0001-7088-9261"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abeynaya Gnanasekaran","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-7088-9261","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061822097","display_name":"Eric Darve","orcid":"https://orcid.org/0000-0002-1938-3836"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eric Darve","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1938-3836","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5747,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66579573,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"43","issue":"1","first_page":"94","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998000264167786,"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/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9836999773979187,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9708999991416931,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.7242690324783325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.62718266248703},{"id":"https://openalex.org/keywords/square","display_name":"Square (algebra)","score":0.4935969114303589},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.48976802825927734},{"id":"https://openalex.org/keywords/subject","display_name":"Subject (documents)","score":0.4779531955718994},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4677659869194031},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4375301003456116},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.34924787282943726},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30539804697036743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2831319272518158},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14645642042160034},{"id":"https://openalex.org/keywords/library-science","display_name":"Library science","score":0.13852322101593018},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08526027202606201}],"concepts":[{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7242690324783325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.62718266248703},{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.4935969114303589},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.48976802825927734},{"id":"https://openalex.org/C2777855551","wikidata":"https://www.wikidata.org/wiki/Q12310021","display_name":"Subject (documents)","level":2,"score":0.4779531955718994},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4677659869194031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4375301003456116},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.34924787282943726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30539804697036743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2831319272518158},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14645642042160034},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.13852322101593018},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08526027202606201},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1373475","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1373475","pdf_url":null,"source":{"id":"https://openalex.org/S16958353","display_name":"SIAM Journal on Matrix Analysis and Applications","issn_l":"0895-4798","issn":["0895-4798","1095-7162"],"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 Matrix Analysis and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3980782865","display_name":"THE THOUSAND-FOLD INCREASE IN COMPUTATIONAL CAPABILITIES EXPECTED OVER THE NEXT DECADE WILL CHANGE THE WAY IN WHICH BOTH ENGINEERING AND SCIENTIFIC DISCOVERY ARE PURSUED. BUT WE WILL ONLY BE ABLE TO ACHIEVE SUCH NEW METHODS OF SCIENTIFIC INQUIRY IF WE ARE ABLE TO HARNESS THE POWER OF FUTURE SUPERCOMPUTERS FOR  AMONG OTHER AREAS  COMPLEX NAVIER-STOKES COMPUTATIONS OF TURBULENT FLUID FLOW USING SCALABLE PRECONDITIONERS AND SOLVERS THAT DO NOT EXIST TODAY. THE YET-TO-BE-DETERMINED ARCHITECTURES OF EXASCALE SYSTEMS ARE EXPECTED TO BE RADICALLY DIFFERENT FROM EXISTING SYSTEMS. ALTHOUGH WE DO NOT KNOW WHAT THESE COMPUTERS MAY LOOK LIKE  ONE CAN IDENTIFY COMMON CHARACTERISTICS OF THESE EXASCALE SYSTEMS THAT WILL REQUIRE SERIOUS RETHINKING OF TODAY'S SOLVERS FOR LARGE-SCALE TURBULENT FLOW SIMULATIONS. THE ARCHITECTURAL FEATURES THAT ARE THE MOST SALIENT TO THE DESIGN  IMPLEMENTATION  AND DEPLOYMENT OF SCALABLE AND EFFICIENT SOLVERS FOR PARALLEL  HIGH-PERFORMANCE SCIENTIFIC COMPUTING INCLUDE THE FOLLOWING: (A) EXTREME PARALLELISM -- ESTIMATES OF 2 TO 3 ORDERS OF MAGNITUDE OF PARALLELISM OVER TODAY'S LEVELS WILL REQUIRE SOLVERS TO PAY PARTICULAR ATTENTION TO AMDAHL'S LAW AND NEW WAYS OF ACHIEVING NEAR-PERFECT LOAD BALANCE  MOST LIKELY IN A DYNAMIC FASHION  (B) DATA PLACEMENT AND MOVEMENT -- OPTIMIZING DATA PLACEMENT AND MOVEMENT WILL BE KEY TO PERFORMANCE  AS WELL AS A PRIMARY WAY FOR SOLVERS TO REDUCE POWER CONSUMPTION  A MAJOR CONCERN IN FUTURE ARCHITECTURES  (C) HETEROGENEOUS ARCHITECTURES -- HETEROGENEITY WILL BE NEEDED TO MEET THE POWER REQUIREMENTS OF EXASCALE SYSTEMS; BUT LITTLE HAS BEEN DONE TO DEVELOP PORTABLE  HYBRID SOLVERS THAT CAN RUN ACROSS DIFFERENT TYPES OF ARCHITECTURES WITH COMPLEX MEMORY HIERARCHIES  AND (D) RESILIENCE -- THE NUMBER OF FAILURES IS EXPECTED TO INCREASE WITH CONCURRENCY  REQUIRING SOLVERS THAT CAN RUN THROUGH OR DETECT AND RECOVER FROM FAULTS. IN THIS PROPOSAL  WE OFFER A PLAN TO IMPROVE ON THE STATE OF THE ART FOR PRECONDITIONED ITERATIVE SOLVERS FOR CFD WITH THE FOLLOWING KEY INGREDIENTS: 1. DEVELOP A PROMISING CLASS OF PRECONDITIONERS BASED ON LOW-RANK COMPRESSION AND HIERARCHICAL MATRICES AND EMBED THEM INTO AN APPROACH BASED ON NESTED DISSECTION AND MULTIFRONTAL ELIMINATION. 2. DEVELOP PIPELINED S-STEP COMMUNICATION-HIDING AND COMMUNICATION-REDUCING STRATEGIES FOR ITERATIVE KRYLOV SOLVERS THAT WILL BE PRECONDITIONED TO ENABLE SCALABILITY AT VERY LARGE NUMBERS OF PROCESSING CORES AND IN HETEROGENEOUS COMPUTING ARCHITECTURES. 3. PROTOTYPE THIS NEW CLASS OF SCALABLE  PRECONDITIONED SOLVERS USING TWO ADVANCED PROGRAMMING APPROACHES INCLUDING LEGION/ REGENT AND QTHREADS  AND DEMONSTRATE SCALABILITY IN THE LARGEST COMPUTATIONAL RESOURCES THAT WE HAVE ACCESS TO DURING THE PERIOD OF EXECUTION. 4. DEMONSTRATE OUR SOLVER STRATEGIES IN THE OPEN-SOURCE SU2 DISCONTINUOUS-GALERKIN FEM HIGHER-ORDER SOLVER FOR LES AND WMLES SOLUTIONS AND DEMONSTRATE APPLICABILITY OF OUR SOLVER APPROACH TO PROBLEMS OF ORDER HIGHER THAN P=3. 5. DEMONSTRATE LARGE-SCALE SYSTEM ALGORITHMIC SCALABILITY IN O(N LN N^P)  AND GUARANTEED CONVERGENCE OF ITERATIVE METHODS IN O(1) STEPS WITH O(N LN N^P) PRECONDITIONER COST. THE RESULT WILL BE A NEW PRECONDITIONED SOLVER APPROACH FOR THE NAVIER-STOKES EQUATIONS THAT WILL BE AVAILABLE IN THE OPEN-SOURCE AND THAT COULD BE INCORPORATED INTO NASA TOOLS IN THE FUTURE. THE SOLVER WILL DEMONSTRATE  IN THE CONTEXT OF THE SU2 DG-FEM HIGHER-ORDER SOLVER  ALGORITHMIC SCALABILITY AND ROBUSTNESS OF NAVIER-STOKES LES AND WMLES SIMULATIONS.","funder_award_id":"80NSSC18M0152","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"}],"funders":[{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W1559275088","https://openalex.org/W1584753249","https://openalex.org/W1768849904","https://openalex.org/W1959955997","https://openalex.org/W1971285640","https://openalex.org/W1977631509","https://openalex.org/W1979889135","https://openalex.org/W1981745143","https://openalex.org/W2013336356","https://openalex.org/W2013901196","https://openalex.org/W2018419001","https://openalex.org/W2018850201","https://openalex.org/W2026930830","https://openalex.org/W2027532376","https://openalex.org/W2035080386","https://openalex.org/W2036564429","https://openalex.org/W2044557804","https://openalex.org/W2058331587","https://openalex.org/W2062970737","https://openalex.org/W2070232376","https://openalex.org/W2075490698","https://openalex.org/W2077309453","https://openalex.org/W2083206954","https://openalex.org/W2089437293","https://openalex.org/W2106150226","https://openalex.org/W2118341515","https://openalex.org/W2122137889","https://openalex.org/W2127927798","https://openalex.org/W2132820941","https://openalex.org/W2137541800","https://openalex.org/W2140153041","https://openalex.org/W2142184646","https://openalex.org/W2164374667","https://openalex.org/W2204644860","https://openalex.org/W2316564661","https://openalex.org/W2566608457","https://openalex.org/W2583532684","https://openalex.org/W2766227949","https://openalex.org/W2950678188","https://openalex.org/W2955079859","https://openalex.org/W2963082950","https://openalex.org/W2963897711","https://openalex.org/W2995553094","https://openalex.org/W3014600398","https://openalex.org/W3015747620","https://openalex.org/W3022111729","https://openalex.org/W3039986651","https://openalex.org/W3105305791","https://openalex.org/W4213388818"],"related_works":["https://openalex.org/W2794559785","https://openalex.org/W3102623159","https://openalex.org/W2950281908","https://openalex.org/W1754499339","https://openalex.org/W2013873776","https://openalex.org/W2152992791","https://openalex.org/W2583828359","https://openalex.org/W2963117165","https://openalex.org/W1973739845","https://openalex.org/W119752240"],"abstract_inverted_index":{"Related":[0],"DatabasesWeb":[1],"of":[2],"Science":[3],"You":[4],"must":[5],"be":[6],"logged":[7],"in":[8],"with":[9],"an":[10],"active":[11],"subscription":[12],"to":[13],"view":[14],"this.Article":[15],"DataHistorySubmitted:":[16],"14":[17],"October":[18],"2020Accepted:":[19],"21":[20],"September":[21],"2021Published":[22],"online:":[23],"24":[24],"January":[25],"2022KeywordsHouseholder":[26],"reflections,":[27],"low-rank,":[28],"nested":[29],"dissection,":[30],"hierarchical":[31],"factorization,":[32],"sparse":[33],"linear":[34],"solverAMS":[35],"Subject":[36],"Headings65F05,":[37],"65F08,":[38],"65F25,":[39],"65F50,":[40],"65Y20Publication":[41],"DataISSN":[42],"(print):":[43],"0895-4798ISSN":[44],"(online):":[45],"1095-7162Publisher:":[46],"Society":[47],"for":[48],"Industrial":[49],"and":[50],"Applied":[51],"MathematicsCODEN:":[52],"sjmael":[53]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}