{"id":"https://openalex.org/W1979889135","doi":"https://doi.org/10.1137/080720395","title":"Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization","display_name":"Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1979889135","doi":"https://doi.org/10.1137/080720395","mag":"1979889135"},"language":"en","primary_location":{"id":"doi:10.1137/080720395","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080720395","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://inria.hal.science/inria-00271394","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laura Grigori","raw_affiliation_strings":["laura.grigori@inria.fr and sidonfack@gmail.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"laura.grigori@inria.fr and sidonfack@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042681205","display_name":"Erik G. Boman","orcid":"https://orcid.org/0000-0003-2216-5546"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erik G. Boman","raw_affiliation_strings":["egboman@sandia.gov#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"egboman@sandia.gov#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022982824","display_name":"Simplice Donfack","orcid":null},"institutions":[{"id":"https://openalex.org/I4210161954","display_name":"D\u00e9partement d'Informatique","ror":"https://ror.org/05y6rqs46","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I2746051580","https://openalex.org/I29607241","https://openalex.org/I4210159245","https://openalex.org/I4210161954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Simplice Donfack","raw_affiliation_strings":["D\u00e9partement d'Informatique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'Informatique","institution_ids":["https://openalex.org/I4210161954"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069178025","display_name":"Timothy A. Davis","orcid":"https://orcid.org/0000-0001-7614-6899"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Timothy A. Davis","raw_affiliation_strings":["davis@cise.ufl.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"davis@cise.ufl.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9425,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90913094,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"6","first_page":"3426","last_page":"3446"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976000189781189,"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/hypergraph","display_name":"Hypergraph","score":0.8796248435974121},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5494682788848877},{"id":"https://openalex.org/keywords/gaussian-elimination","display_name":"Gaussian elimination","score":0.5088450908660889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49454185366630554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47812071442604065},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.4741850793361664},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.47145137190818787},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.44985780119895935},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43508633971214294},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.42973971366882324},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38120901584625244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22324690222740173}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8796248435974121},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5494682788848877},{"id":"https://openalex.org/C126312332","wikidata":"https://www.wikidata.org/wiki/Q2658","display_name":"Gaussian elimination","level":3,"score":0.5088450908660889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49454185366630554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47812071442604065},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4741850793361664},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.47145137190818787},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.44985780119895935},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43508633971214294},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.42973971366882324},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38120901584625244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22324690222740173},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/080720395","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080720395","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:CiteSeerX.psu:10.1.1.116.4694","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4694","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sandia.gov/~egboman/papers/HUND.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.8929","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.8929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cise.ufl.edu/~davis/techreports/hund.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.304.6231","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.304.6231","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sandia.gov/~egboman/papers/HUND.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.591.2338","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.2338","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.archives-ouvertes.fr/docs/00/27/65/49/PDF/RR-6520.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00271394v3","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00271394","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Technical Report] RR-6520, INRIA. 2008","raw_type":"Reports"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00271394v3","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00271394","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Technical Report] RR-6520, INRIA. 2008","raw_type":"Reports"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1499138327","https://openalex.org/W1520511539","https://openalex.org/W1584753249","https://openalex.org/W1966461475","https://openalex.org/W1988221401","https://openalex.org/W1991452943","https://openalex.org/W1996309908","https://openalex.org/W2014730252","https://openalex.org/W2018338919","https://openalex.org/W2020561008","https://openalex.org/W2026725148","https://openalex.org/W2027566319","https://openalex.org/W2035080386","https://openalex.org/W2038205735","https://openalex.org/W2051917325","https://openalex.org/W2053266474","https://openalex.org/W2064762577","https://openalex.org/W2068683191","https://openalex.org/W2069849438","https://openalex.org/W2070232376","https://openalex.org/W2070571481","https://openalex.org/W2072197890","https://openalex.org/W2078174680","https://openalex.org/W2082222857","https://openalex.org/W2086648616","https://openalex.org/W2087830284","https://openalex.org/W2089024363","https://openalex.org/W2113679823","https://openalex.org/W2118953734","https://openalex.org/W2127927798","https://openalex.org/W2137541800","https://openalex.org/W2141331848","https://openalex.org/W2142184646","https://openalex.org/W2163501979","https://openalex.org/W2165211988","https://openalex.org/W2173979015","https://openalex.org/W2788317989","https://openalex.org/W3104001151"],"related_works":["https://openalex.org/W3019763240","https://openalex.org/W3166438828","https://openalex.org/W3209968583","https://openalex.org/W2581587767","https://openalex.org/W52723941","https://openalex.org/W4205180559","https://openalex.org/W2023930998","https://openalex.org/W2111577575","https://openalex.org/W2108520826","https://openalex.org/W2208179417"],"abstract_inverted_index":{"In":[0],"this":[1,179],"paper":[2],"we":[3,110],"discuss":[4],"a":[5,27,51,209],"hypergraph-based":[6],"unsymmetric":[7,192,240],"nested":[8,90,95,103],"dissection":[9,91,96,104],"(HUND)":[10],"ordering":[11],"for":[12,60],"reducing":[13],"the":[14,31,43,46,73,84,89,106,113,120,164,214,219,224,231],"fill-in":[15],"incurred":[16],"during":[17],"Gaussian":[18,62],"elimination.":[19],"It":[20,25,39,57],"has":[21],"several":[22],"important":[23],"properties.":[24],"takes":[26,40],"global":[28],"perspective":[29],"of":[30,45,127,229],"entire":[32],"matrix,":[33],"as":[34],"opposed":[35],"to":[36,53,78,101,161,197,223],"local":[37,153],"heuristics.":[38],"into":[41],"account":[42],"asymmetry":[44],"input":[47],"matrix":[48,107,115,123],"by":[49,88,140],"using":[50],"hypergraph":[52,94,144],"represent":[54],"its":[55],"structure.":[56],"is":[58,70,98,132,218],"suitable":[59],"performing":[61],"elimination":[63],"in":[64,129,178,213,234],"parallel,":[65],"with":[66,190,238],"partial":[67,79],"pivoting.":[68],"This":[69],"possible":[71],"because":[72],"row":[74],"permutations":[75],"performed":[76],"due":[77],"pivoting":[80],"do":[81],"not":[82],"destroy":[83],"column":[85,156],"separators":[86],"identified":[87],"approach.":[92],"The":[93,125,203],"approach":[97,131,196],"essentially":[99],"equivalent":[100],"graph":[102],"on":[105,183,236],"$A^{T}A$,":[108],"but":[109],"need":[111],"only":[112],"original":[114],"A":[116],"and":[117,135,186],"never":[118],"form":[119],"usually":[121],"denser":[122],"$A^{T}A$.":[124],"usage":[126],"hypergraphs":[128],"our":[130,195],"fairly":[133],"standard,":[134],"HUND":[136],"can":[137,175],"be":[138,176],"implemented":[139],"calling":[141],"an":[142],"existing":[143],"partitioner":[145],"that":[146,206,216],"uses":[147,152],"recursive":[148],"bisection.":[149],"Our":[150],"implementation":[151],"reordering":[154,201,211],"constrained":[155],"approximate":[157],"minimum":[158],"degree":[159],"(CCOLAMD)":[160],"further":[162],"improve":[163],"ordering.":[165],"We":[166],"also":[167],"explain":[168],"how":[169],"weighted":[170],"matching":[171],"(HSL":[172],"routine":[173],"MC64)":[174],"used":[177],"context.":[180],"Experimental":[181],"results":[182,204],"27":[184],"medium":[185],"large":[187],"size":[188],"matrices":[189,237],"highly":[191,239],"structures":[193],"compare":[194],"four":[198],"other":[199,232],"well-known":[200],"algorithms.":[202],"show":[205],"it":[207,217],"provides":[208],"robust":[210],"algorithm,":[212],"sense":[215],"best":[220,225],"or":[221],"close":[222],"(often":[226],"within":[227],"10%)":[228],"all":[230],"methods,":[233],"particular":[235],"structures.":[241]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}