{"id":"https://openalex.org/W2046332585","doi":"https://doi.org/10.1137/0914063","title":"Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers","display_name":"Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers","publication_year":1993,"publication_date":"1993-09-01","ids":{"openalex":"https://openalex.org/W2046332585","doi":"https://doi.org/10.1137/0914063","mag":"2046332585"},"language":"en","primary_location":{"id":"doi:10.1137/0914063","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914063","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/A5056131016","display_name":"Esmond Ng","orcid":"https://orcid.org/0000-0002-4535-6348"},"institutions":[{"id":"https://openalex.org/I139351228","display_name":"Office of Scientific and Technical Information","ror":"https://ror.org/031478740","country_code":"US","type":"government","lineage":["https://openalex.org/I1330989302","https://openalex.org/I139351228","https://openalex.org/I39565521"]},{"id":"https://openalex.org/I4210108489","display_name":"National Technical Information Service","ror":"https://ror.org/01p92hb48","country_code":"US","type":"government","lineage":["https://openalex.org/I1343035065","https://openalex.org/I4210108489"]},{"id":"https://openalex.org/I4401726780","display_name":"Martin Marietta Materials (United States)","ror":"https://ror.org/00n16p182","country_code":null,"type":"company","lineage":["https://openalex.org/I4401726780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Esmond G. Ng","raw_affiliation_strings":["MARTIN MARIETTA ENERGY SYSTEMS, INC. FOR THE UNITED STATES","Department of Commerce, 5285 Port Royal Rd, Springfield, VA 22161","Office of Scientific and Techni-cal Information, P.O. Box 62, Oak Ridge, TN 37831; prices"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MARTIN MARIETTA ENERGY SYSTEMS, INC. FOR THE UNITED STATES","institution_ids":["https://openalex.org/I4401726780"]},{"raw_affiliation_string":"Department of Commerce, 5285 Port Royal Rd, Springfield, VA 22161","institution_ids":["https://openalex.org/I4210108489"]},{"raw_affiliation_string":"Office of Scientific and Techni-cal Information, P.O. Box 62, Oak Ridge, TN 37831; prices","institution_ids":["https://openalex.org/I139351228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050129306","display_name":"Barry W. Peyton","orcid":null},"institutions":[{"id":"https://openalex.org/I139351228","display_name":"Office of Scientific and Technical Information","ror":"https://ror.org/031478740","country_code":"US","type":"government","lineage":["https://openalex.org/I1330989302","https://openalex.org/I139351228","https://openalex.org/I39565521"]},{"id":"https://openalex.org/I4210108489","display_name":"National Technical Information Service","ror":"https://ror.org/01p92hb48","country_code":"US","type":"government","lineage":["https://openalex.org/I1343035065","https://openalex.org/I4210108489"]},{"id":"https://openalex.org/I4401726780","display_name":"Martin Marietta Materials (United States)","ror":"https://ror.org/00n16p182","country_code":null,"type":"company","lineage":["https://openalex.org/I4401726780"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Barry W. Peyton","raw_affiliation_strings":["Department of Commerce, 5285 Port Royal Rd, Springfield, VA 22161","Office of Scientific and Techni-cal Information, P.O. Box 62, Oak Ridge, TN 37831; prices","MARTIN MARIETTA ENERGY SYSTEMS, INC. FOR THE UNITED STATES"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Commerce, 5285 Port Royal Rd, Springfield, VA 22161","institution_ids":["https://openalex.org/I4210108489"]},{"raw_affiliation_string":"Office of Scientific and Techni-cal Information, P.O. Box 62, Oak Ridge, TN 37831; prices","institution_ids":["https://openalex.org/I139351228"]},{"raw_affiliation_string":"MARTIN MARIETTA ENERGY SYSTEMS, INC. FOR THE UNITED STATES","institution_ids":["https://openalex.org/I4401726780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6513,"has_fulltext":false,"cited_by_count":210,"citation_normalized_percentile":{"value":0.93192541,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"14","issue":"5","first_page":"1034","last_page":"1056"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9988999962806702,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9857056140899658},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.8757531642913818},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.7462760806083679},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6836934089660645},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6067403554916382},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5806957483291626},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.5747544765472412},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5732820630073547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.533613920211792},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.43156898021698},{"id":"https://openalex.org/keywords/linear-algebra","display_name":"Linear algebra","score":0.41171568632125854},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3681935966014862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27852845191955566},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.2665437161922455}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9857056140899658},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.8757531642913818},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.7462760806083679},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836934089660645},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6067403554916382},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5806957483291626},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.5747544765472412},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5732820630073547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.533613920211792},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.43156898021698},{"id":"https://openalex.org/C139352143","wikidata":"https://www.wikidata.org/wiki/Q82571","display_name":"Linear algebra","level":2,"score":0.41171568632125854},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3681935966014862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27852845191955566},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2665437161922455},{"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/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"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/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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0914063","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0914063","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1978811976","https://openalex.org/W1981885118","https://openalex.org/W1982838361","https://openalex.org/W1996471375","https://openalex.org/W2022842990","https://openalex.org/W2026121678","https://openalex.org/W2031990962","https://openalex.org/W2036555554","https://openalex.org/W2045325210","https://openalex.org/W2046020107","https://openalex.org/W2049945015","https://openalex.org/W2063675347","https://openalex.org/W2065600791","https://openalex.org/W2080975681","https://openalex.org/W2088501249","https://openalex.org/W2089898547","https://openalex.org/W2094542090","https://openalex.org/W2147542748","https://openalex.org/W2152320213","https://openalex.org/W2152617854","https://openalex.org/W2249508874"],"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/W2397810771","https://openalex.org/W2584547575","https://openalex.org/W2019527453","https://openalex.org/W4234447426"],"abstract_inverted_index":{"As":[0],"with":[1,38],"many":[2],"other":[3],"linear":[4],"algebra":[5],"algorithms,":[6,96],"devising":[7],"a":[8,28,101,110,129],"portable":[9],"implementation":[10,141],"of":[11,22,72,120,132,139,158],"sparse":[12,81,93,104],"Cholesky":[13,94,105],"factorization":[14,66,82,95],"that":[15,64],"performs":[16],"well":[17,62],"on":[18,143],"the":[19,34,69,97,118,121,133,137,155,159],"broad":[20],"range":[21],"computer":[23],"architectures":[24],"currently":[25],"available":[26],"is":[27,61,78,148],"formidable":[29],"challenge.":[30],"Even":[31],"after":[32],"limiting":[33],"attention":[35,153],"to":[36,55,116,127,154],"machines":[37],"only":[39],"one":[40],"processor,":[41],"as":[42,83],"has":[43,87],"been":[44],"done":[45],"in":[46,109,124],"this":[47,74],"paper,":[48],"there":[49],"are":[50,68,107],"still":[51],"several":[52],"interesting":[53],"issues":[54],"consider.":[56],"For":[57],"dense":[58],"matrices,":[59],"it":[60],"known":[63],"block":[65],"algorithms":[67],"best":[70],"means":[71],"achieving":[73],"goal.":[75],"This":[76,85],"approach":[77],"taken":[79],"for":[80],"well.":[84],"paper":[86],"two":[88,92,134,160],"primary":[89],"goals.":[90],"First,":[91],"multifrontal":[98],"method":[99],"and":[100,112,126,145,162],"blocked":[102],"left-looking":[103],"method,":[106],"examined":[108],"systematic":[111],"consistent":[113],"fashion,":[114],"both":[115],"illustrate":[117],"strengths":[119],"blocking":[122],"techniques":[123,142],"general":[125],"obtain":[128],"fair":[130],"evaluation":[131],"approaches,":[135],"Second,":[136],"impact":[138],"various":[140],"time":[144],"storage":[146],"efficiency":[147],"assessed,":[149],"paying":[150],"particularly":[151],"close":[152],"work-storage":[156],"requirement":[157],"methods":[161],"their":[163],"variants.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}