{"id":"https://openalex.org/W2073620958","doi":"https://doi.org/10.1142/s0129053393000232","title":"AN EVALUATION OF LEFT-LOOKING, RIGHT-LOOKING AND MULTIFRONTAL APPROACHES TO SPARSE CHOLESKY FACTORIZATION ON HIERARCHICAL-MEMORY MACHINES","display_name":"AN EVALUATION OF LEFT-LOOKING, RIGHT-LOOKING AND MULTIFRONTAL APPROACHES TO SPARSE CHOLESKY FACTORIZATION ON HIERARCHICAL-MEMORY MACHINES","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2073620958","doi":"https://doi.org/10.1142/s0129053393000232","mag":"2073620958"},"language":"en","primary_location":{"id":"doi:10.1142/s0129053393000232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053393000232","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed 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/A5111499524","display_name":"Edward Rothberg","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"EDWARD ROTHBERG","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102095475","display_name":"Anoop Gupta","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"ANOOP GUPTA","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5649,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.83048753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"05","issue":"04","first_page":"537","last_page":"593"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9966999888420105,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9384772777557373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7980146408081055},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.7459716796875},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6188209056854248},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6040714383125305},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.573278546333313},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5554265379905701},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5435857176780701},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.5248620510101318},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.47087156772613525},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.42180904746055603},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40723833441734314},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.35787802934646606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3576352298259735},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10427436232566833}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9384772777557373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7980146408081055},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.7459716796875},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6188209056854248},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6040714383125305},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.573278546333313},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5554265379905701},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5435857176780701},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.5248620510101318},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.47087156772613525},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.42180904746055603},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40723833441734314},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.35787802934646606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3576352298259735},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10427436232566833},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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/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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129053393000232","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129053393000232","pdf_url":null,"source":{"id":"https://openalex.org/S112418432","display_name":"International Journal of High Speed Computing","issn_l":"0129-0533","issn":["0129-0533"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of High Speed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1981885118","https://openalex.org/W1982838361","https://openalex.org/W2004924114","https://openalex.org/W2045325210","https://openalex.org/W2049945015","https://openalex.org/W2063675347","https://openalex.org/W2065600791","https://openalex.org/W2086648616","https://openalex.org/W2089898547","https://openalex.org/W2092629477","https://openalex.org/W2094542090","https://openalex.org/W2098220211","https://openalex.org/W2147542748","https://openalex.org/W2152617854"],"related_works":["https://openalex.org/W2078637543","https://openalex.org/W2381435995","https://openalex.org/W3022256543","https://openalex.org/W898189783","https://openalex.org/W1977632218","https://openalex.org/W1987177655","https://openalex.org/W1509943448","https://openalex.org/W2526784484","https://openalex.org/W4246966070","https://openalex.org/W2127144731"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,35,52],"present":[4],"a":[5,12,84,117],"comprehensive":[6],"analysis":[7],"of":[8,11,14,56,58,65,87,119,128,135,153,170,185,217],"the":[9,32,49,54,72,88,100,107,115,132,136,151,186,201,214,222],"performance":[10,162,168,212],"variety":[13],"sparse":[15,42,80,108],"Cholesky":[16,81,109],"factorization":[17,82],"methods":[18,24,177,190],"on":[19,71,163,179,192],"hierarchical-memory":[20,164],"machines.":[21,165],"We":[22,90,125,141,166,197],"investigate":[23],"that":[25,94,130,143,145,181,194,200],"vary":[26,69],"along":[27],"two":[28,171],"different":[29,38,63],"axes.":[30],"Along":[31,48],"first":[33,91],"axis,":[34,51],"consider":[36,53,92,126],"three":[37,173],"high-level":[39,60],"approaches":[40,61],"to":[41,138,159,172,189,220],"factorization:":[43],"left-looking,":[44],"right-looking":[45],"and":[46],"multifrontal.":[47],"second":[50],"implementation":[55],"each":[57],"these":[59],"using":[62],"sets":[64,127],"primitives.":[66],"The":[67],"primitives":[68,93,104,129,144,180,193,218],"based":[70,178,191],"structures":[73,148],"they":[74],"manipulate.":[75],"One":[76],"important":[77,112,210],"structure":[78,113,134,188],"in":[79],"is":[83,114,208],"single":[85,96],"column":[86],"matrix.":[89],"manipulate":[95,146,195],"columns.":[97,196],"These":[98],"are":[99],"most":[101],"commonly":[102],"used":[103,219],"for":[105,211],"expressing":[106],"computation.":[110],"Another":[111],"supernode,":[116],"set":[118,216],"columns":[120],"with":[121],"identical":[122],"non-zero":[123],"structures.":[124],"exploit":[131],"supernodal":[133,187],"matrix":[137],"varying":[139],"degrees.":[140],"find":[142,199],"larger":[147],"greatly":[149],"increase":[150],"amount":[152],"exploitable":[154],"data":[155],"reuse,":[156],"thus":[157],"leading":[158],"dramatically":[160],"higher":[161],"observe":[167],"increases":[169],"times":[174],"when":[175],"comparing":[176],"make":[182],"extensive":[183],"use":[184],"also":[198],"overall":[202],"approach":[203],"(left-looking,":[204],"right-looking,":[205],"or":[206],"multifrontal)":[207],"less":[209],"than":[213],"particular":[215],"implement":[221],"approach.":[223]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}