{"id":"https://openalex.org/W2029976675","doi":"https://doi.org/10.1137/120861242","title":"A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap","display_name":"A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2029976675","doi":"https://doi.org/10.1137/120861242","mag":"2029976675"},"language":"en","primary_location":{"id":"doi:10.1137/120861242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120861242","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089653045","display_name":"Seher Acer","orcid":"https://orcid.org/0000-0003-3951-3930"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Seher Acer","raw_affiliation_strings":["Computer Engineering Department, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083968418","display_name":"Enver Kayaaslan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Enver Kayaaslan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5087435011","display_name":"Cevdet Aykanat","orcid":"https://orcid.org/0000-0002-4559-1321"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Cevdet Aykanat","raw_affiliation_strings":["Computer Engineering Department, Bilkent University, Ankara, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Bilkent University, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1318,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80879961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"35","issue":"1","first_page":"C99","last_page":"C121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9968000054359436,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9955000281333923,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9921000003814697,"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/solver","display_name":"Solver","score":0.654695987701416},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.6352880597114563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5450705289840698},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5199876427650452},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.49604329466819763},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45371872186660767},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4521321654319763},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38085228204727173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.369019478559494},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34898805618286133},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2464166283607483},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.07853963971138}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.654695987701416},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.6352880597114563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5450705289840698},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5199876427650452},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.49604329466819763},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45371872186660767},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4521321654319763},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38085228204727173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.369019478559494},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34898805618286133},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2464166283607483},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.07853963971138},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/120861242","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120861242","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.310.7400","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.7400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bilkent.edu.tr/~aykanat/SIAM-2013.pdf","raw_type":"text"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/21000","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/21000","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1006694381","display_name":null,"funder_award_id":"FP7-261557","funder_id":"https://openalex.org/F4320321047","funder_display_name":"Partnership for Advanced Computing in Europe AISBL"},{"id":"https://openalex.org/G1852493472","display_name":null,"funder_award_id":"RI-211528","funder_id":"https://openalex.org/F4320321047","funder_display_name":"Partnership for Advanced Computing in Europe AISBL"},{"id":"https://openalex.org/G5749144054","display_name":null,"funder_award_id":"261557","funder_id":"https://openalex.org/F4320321047","funder_display_name":"Partnership for Advanced Computing in Europe AISBL"}],"funders":[{"id":"https://openalex.org/F4320321047","display_name":"Partnership for Advanced Computing in Europe AISBL","ror":"https://ror.org/038j4hz26"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1977642111","https://openalex.org/W1996121616","https://openalex.org/W1996309908","https://openalex.org/W2030118642","https://openalex.org/W2050028993","https://openalex.org/W2059946383","https://openalex.org/W2063058202","https://openalex.org/W2093992309","https://openalex.org/W2103660617","https://openalex.org/W2107533093","https://openalex.org/W2142184646","https://openalex.org/W2147507978","https://openalex.org/W2169776311","https://openalex.org/W4206369538","https://openalex.org/W4233258545"],"related_works":["https://openalex.org/W1996309908","https://openalex.org/W3143157309","https://openalex.org/W1835164773","https://openalex.org/W2044854887","https://openalex.org/W2117611406","https://openalex.org/W2791743570","https://openalex.org/W2035661922","https://openalex.org/W2612097338","https://openalex.org/W2118953734","https://openalex.org/W2531174872","https://openalex.org/W2898686011","https://openalex.org/W2085459897","https://openalex.org/W506101","https://openalex.org/W190413104","https://openalex.org/W2072884723","https://openalex.org/W2109343271","https://openalex.org/W2030118642","https://openalex.org/W2071738326","https://openalex.org/W2951616729","https://openalex.org/W1781620280"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,23,30,71,85,99,107,116,152,165,168],"problem":[3,20,59],"of":[4,25,29,70,162,167],"symmetrically":[5],"permuting":[6],"a":[7,12,35,61,67,124,130,159],"square":[8],"sparse":[9,50],"matrix":[10],"into":[11],"block":[13,38],"diagonal":[14],"form":[15],"with":[16,129],"overlap.":[17],"This":[18],"permutation":[19,58],"arises":[21],"in":[22,151],"parallelization":[24],"an":[26],"explicit":[27],"formulation":[28],"multiplicative":[31],"Schwarz":[32],"preconditioner":[33],"and":[34,148],"more":[36],"recent":[37],"overlapping":[39],"banded":[40],"linear":[41,51],"solver":[42],"as":[43,45,60,84],"well":[44],"its":[46],"application":[47],"to":[48,55,83,97],"general":[49],"systems.":[52],"In":[53],"order":[54],"formulate":[56],"this":[57,120],"graph":[62,73,92],"theoretical":[63],"problem,":[64,79],"we":[65,103,122],"define":[66],"constrained":[68],"version":[69],"multiway":[72],"partitioning":[74,93],"by":[75],"vertex":[76,132],"separator":[77],"(GPVS)":[78],"which":[80],"is":[81],"referred":[82],"ordered":[86],"GPVS":[87,139],"(oGPVS)":[88],"problem.":[89,101,118],"However,":[90],"existing":[91,137],"tools":[94,140],"are":[95],"unable":[96],"solve":[98],"oGPVS":[100,117],"So,":[102],"also":[104],"show":[105],"how":[106],"recursive":[108,153],"bipartitioning":[109,126,154],"framework":[110],"can":[111,145],"be":[112,146],"utilized":[113,150],"for":[114],"solving":[115],"For":[119],"purpose,":[121],"propose":[123],"left-to-right":[125],"approach":[127],"together":[128],"novel":[131],"fixation":[133],"scheme":[134],"so":[135],"that":[136,141],"2-way":[138],"support":[142],"fixed":[143],"vertices":[144],"effectively":[147],"efficiently":[149],"framework.":[155],"Experimental":[156],"results":[157],"on":[158],"wide":[160],"range":[161],"matrices":[163],"confirm":[164],"validity":[166],"proposed":[169],"approach.":[170]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}