{"id":"https://openalex.org/W2051800546","doi":"https://doi.org/10.1137/0913067","title":"Highly Parallel Sparse Cholesky Factorization","display_name":"Highly Parallel Sparse Cholesky Factorization","publication_year":1992,"publication_date":"1992-09-01","ids":{"openalex":"https://openalex.org/W2051800546","doi":"https://doi.org/10.1137/0913067","mag":"2051800546"},"language":"en","primary_location":{"id":"doi:10.1137/0913067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0913067","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 and Statistical Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ntrs.nasa.gov/api/citations/19910023533/downloads/19910023533.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108223550","display_name":"John R. Gilbert","orcid":null},"institutions":[{"id":"https://openalex.org/I173498003","display_name":"Palo Alto Research Center","ror":"https://ror.org/0529fxt39","country_code":"US","type":"facility","lineage":["https://openalex.org/I173498003","https://openalex.org/I4210132870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"John R. Gilbert","raw_affiliation_strings":["Xerox Palo Alto Research Center CA United States"],"affiliations":[{"raw_affiliation_string":"Xerox Palo Alto Research Center CA United States","institution_ids":["https://openalex.org/I173498003"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030605442","display_name":"Robert Schreiber","orcid":"https://orcid.org/0000-0002-3057-5820"},"institutions":[{"id":"https://openalex.org/I143663144","display_name":"Research Institute for Advanced Computer Science","ror":"https://ror.org/022qmyy53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1329765538","https://openalex.org/I143663144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Schreiber","raw_affiliation_strings":["Research Inst. for Advanced Computer Science Moffett Field, CA United States"],"affiliations":[{"raw_affiliation_string":"Research Inst. for Advanced Computer Science Moffett Field, CA United States","institution_ids":["https://openalex.org/I143663144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108223550"],"corresponding_institution_ids":["https://openalex.org/I173498003"],"apc_list":null,"apc_paid":null,"fwci":6.2357,"has_fulltext":true,"cited_by_count":74,"citation_normalized_percentile":{"value":0.97061657,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"5","first_page":"1151","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.996999979019165,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.786250114440918},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7549388408660889},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.7536203861236572},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6975197792053223},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.6328744292259216},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6265305876731873},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5789666771888733},{"id":"https://openalex.org/keywords/vectorization","display_name":"Vectorization (mathematics)","score":0.5332915782928467},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.4966166615486145},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4639652967453003},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.4605833888053894},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4539399743080139},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45130854845046997},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.4468008875846863},{"id":"https://openalex.org/keywords/parallel-programming-model","display_name":"Parallel programming model","score":0.4274030327796936},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.40060853958129883},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.23757490515708923}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.786250114440918},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7549388408660889},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.7536203861236572},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6975197792053223},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.6328744292259216},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6265305876731873},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5789666771888733},{"id":"https://openalex.org/C41681595","wikidata":"https://www.wikidata.org/wiki/Q7917855","display_name":"Vectorization (mathematics)","level":2,"score":0.5332915782928467},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.4966166615486145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4639652967453003},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.4605833888053894},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4539399743080139},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45130854845046997},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.4468008875846863},{"id":"https://openalex.org/C137364921","wikidata":"https://www.wikidata.org/wiki/Q27929394","display_name":"Parallel programming model","level":3,"score":0.4274030327796936},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.40060853958129883},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.23757490515708923},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0913067","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0913067","pdf_url":null,"source":{"id":"https://openalex.org/S4210181992","display_name":"SIAM Journal on Scientific and Statistical Computing","issn_l":"0196-5204","issn":["0196-5204","2168-3417"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 and Statistical Computing","raw_type":"journal-article"},{"id":"pmh:oai:casi.ntrs.nasa.gov:19910023533","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19910023533","pdf_url":"https://ntrs.nasa.gov/api/citations/19910023533/downloads/19910023533.pdf","source":{"id":"https://openalex.org/S4306402118","display_name":"NASA Technical Reports Server (NASA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1305493378","host_organization_name":"NASA Headquarters","host_organization_lineage":["https://openalex.org/I1305493378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"NASA-CR-188875"}],"best_oa_location":{"id":"pmh:oai:casi.ntrs.nasa.gov:19910023533","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19910023533","pdf_url":"https://ntrs.nasa.gov/api/citations/19910023533/downloads/19910023533.pdf","source":{"id":"https://openalex.org/S4306402118","display_name":"NASA Technical Reports Server (NASA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1305493378","host_organization_name":"NASA Headquarters","host_organization_lineage":["https://openalex.org/I1305493378"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"NASA-CR-188875"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320318328","display_name":"Universities Space Research Association","ror":"https://ror.org/043pgqy52"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2051800546.pdf","grobid_xml":"https://content.openalex.org/works/W2051800546.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W7720001","https://openalex.org/W1510015875","https://openalex.org/W1859840346","https://openalex.org/W1907411463","https://openalex.org/W1973310391","https://openalex.org/W1981885118","https://openalex.org/W1990764500","https://openalex.org/W2003249877","https://openalex.org/W2007903522","https://openalex.org/W2022842990","https://openalex.org/W2026930830","https://openalex.org/W2045325210","https://openalex.org/W2055434708","https://openalex.org/W2063675347","https://openalex.org/W2072122885","https://openalex.org/W2077309453","https://openalex.org/W2086119402","https://openalex.org/W2089898547","https://openalex.org/W2114282885","https://openalex.org/W2125720043","https://openalex.org/W2128084896","https://openalex.org/W2137541800","https://openalex.org/W4249812622","https://openalex.org/W4300432187"],"related_works":["https://openalex.org/W2078637543","https://openalex.org/W2381435995","https://openalex.org/W1987177655","https://openalex.org/W3022256543","https://openalex.org/W898189783","https://openalex.org/W1977632218","https://openalex.org/W2584547575","https://openalex.org/W1974421439","https://openalex.org/W2019527453","https://openalex.org/W2397810771"],"abstract_inverted_index":{"This":[0],"paper":[1,59],"develops":[2],"and":[3,151],"compares":[4],"several":[5,80],"fine-grained":[6,95],"parallel":[7,133],"algorithms":[8,44,175],"to":[9,42,51,106,139,153,168],"compute":[10],"the":[11,23,47,52,56,109,118],"Cholesky":[12],"factorization":[13,120],"of":[14,55,88,108,163],"a":[15,26,72,85,94,130,177],"sparse":[16,100,143],"matrix.":[17],"The":[18,67,90,99],"experimental":[19,161],"implementations":[20],"are":[21],"on":[22,61,84],"Connection":[24],"Machine,":[25],"distributed-memory":[27],"SIMD":[28],"machine":[29],"whose":[30,76],"programming":[31],"model":[32,147],"conceptually":[33],"supplies":[34],"one":[35],"processor":[36],"per":[37],"data":[38,132],"element.":[39],"In":[40],"contrast":[41],"special-purpose":[43],"in":[45,171],"which":[46],"matrix":[48],"structure":[49,54],"conforms":[50],"connection":[53],"machine,":[57],"this":[58],"focuses":[60],"matrices":[62],"with":[63,160],"arbitrary":[64],"sparsity":[65],"structure.":[66],"most":[68],"promising":[69],"alternative":[70,174],"is":[71,93,127,148,165],"supernodal,":[73],"multifrontal":[74],"algorithm":[75],"inner":[77],"loop":[78],"performs":[79],"dense":[81,110,119],"factorizations":[82],"simultaneously":[83],"two-dimensional":[86],"grid":[87],"processors.":[89],"key":[91],"subroutine":[92],"parallel,":[96],"dense-factorization":[97],"algorithm.":[98],"code":[101],"attains":[102],"execution":[103],"rates":[104],"comparable":[105],"those":[107],"subroutine.":[111],"Although":[112],"at":[113],"present":[114],"architectural":[115],"limitations":[116],"prevent":[117],"from":[121],"realizing":[122],"its":[123],"potential":[124],"efficiency,":[125],"it":[126],"concluded":[128],"that":[129],"regular":[131],"architecture":[134],"can":[135],"be":[136,169],"used":[137,152],"efficiently":[138],"solve":[140],"arbitrarily":[141],"structured":[142],"problems.":[144],"A":[145],"performance":[146],"also":[149],"presented":[150],"analyze":[154],"these":[155],"algorithms.":[156],"Asymptotic":[157],"analysis":[158],"combined":[159],"measurement":[162],"parameters":[164],"accurate":[166],"enough":[167],"useful":[170],"choosing":[172],"among":[173],"for":[176],"complicated":[178],"problem.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"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":1},{"year":2018,"cited_by_count":3},{"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":2}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}