{"id":"https://openalex.org/W2043839703","doi":"https://doi.org/10.1137/s0895479892238270","title":"A Cartesian Parallel Nested Dissection Algorithm","display_name":"A Cartesian Parallel Nested Dissection Algorithm","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W2043839703","doi":"https://doi.org/10.1137/s0895479892238270","mag":"2043839703"},"language":"en","primary_location":{"id":"doi:10.1137/s0895479892238270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479892238270","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/A5112778840","display_name":"Michael T. Heath","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael T. Heath","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5102868534","display_name":"Padma Raghavan","orcid":"https://orcid.org/0009-0002-6785-2112"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Padma Raghavan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.587,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.96480724,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"16","issue":"1","first_page":"235","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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.9983999729156494,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9962999820709229,"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/massively-parallel","display_name":"Massively parallel","score":0.6869462132453918},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.638153076171875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6201804876327515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5289140939712524},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.505938708782196},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.46481284499168396},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45840150117874146},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4211423695087433},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.4205840229988098},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.41324982047080994},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34472861886024475},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.21848058700561523}],"concepts":[{"id":"https://openalex.org/C190475519","wikidata":"https://www.wikidata.org/wiki/Q544384","display_name":"Massively parallel","level":2,"score":0.6869462132453918},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.638153076171875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6201804876327515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5289140939712524},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.505938708782196},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.46481284499168396},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45840150117874146},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4211423695087433},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.4205840229988098},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.41324982047080994},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34472861886024475},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.21848058700561523},{"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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0895479892238270","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479892238270","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.5957","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5957","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.netlib.org/lapack/lawns/lawn52.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1483143399","https://openalex.org/W1559533846","https://openalex.org/W1980758416","https://openalex.org/W1981885118","https://openalex.org/W1993274656","https://openalex.org/W2027566319","https://openalex.org/W2038643780","https://openalex.org/W2057488824","https://openalex.org/W2077309453","https://openalex.org/W2086648616","https://openalex.org/W2096159022","https://openalex.org/W2111516947","https://openalex.org/W2114030927","https://openalex.org/W2137541800","https://openalex.org/W2138521161","https://openalex.org/W2152377721","https://openalex.org/W2157211828","https://openalex.org/W2786884778"],"related_works":["https://openalex.org/W2526784484","https://openalex.org/W1509943448","https://openalex.org/W2074431240","https://openalex.org/W2061572227","https://openalex.org/W2100843445","https://openalex.org/W3149476094","https://openalex.org/W1545561241","https://openalex.org/W1987177655","https://openalex.org/W2025695688","https://openalex.org/W162008856"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,24,45,82,93,105,118],"concerned":[3],"with":[4],"the":[5,22,32,37,54,57,79,103,110,119],"distributed":[6,72,80],"parallel":[7,127,140],"computation":[8],"of":[9,21,36,53,56,78,102,125],"an":[10,99],"ordering":[11,23,111,116],"for":[12,132],"a":[13,49,123],"symmetric":[14],"positive":[15],"definite":[16],"sparse":[17,135],"matrix.":[18,38],"The":[19,62,115],"purpose":[20],"to":[25,42],"limit":[26],"fill":[27],"and":[28],"enhance":[29],"concurrency":[30],"in":[31,59,95,122],"subsequent":[33],"Cholesky":[34],"factorization":[35],"A":[39],"geometric":[40],"approach":[41],"nested":[43],"dissection":[44],"used":[46],"based":[47],"on":[48,69,89,138],"given":[50],"Cartesian":[51],"embedding":[52],"graph":[55],"matrix":[58],"Euclidean":[60],"space.":[61],"resulting":[63],"algorithm":[64,81,117],"can":[65],"be":[66],"implemented":[67],"efficiently":[68],"massively":[70,139],"parallel,":[71],"memory":[73],"computers.":[74,141],"One":[75],"unusual":[76],"feature":[77],"that":[83],"its":[84],"effectiveness":[85],"does":[86],"not":[87,106],"depend":[88],"data":[90],"locality,":[91],"which":[92],"critical":[94],"this":[96],"context,":[97],"since":[98],"appropriate":[100],"partitioning":[101],"problem":[104],"known":[107],"until":[108],"after":[109],"has":[112],"been":[113],"determined.":[114],"first":[120],"component":[121],"suite":[124],"scalable":[126],"algorithms":[128],"currently":[129],"under":[130],"development":[131],"solving":[133],"large":[134],"linear":[136],"systems":[137]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}