{"id":"https://openalex.org/W2099093654","doi":"https://doi.org/10.1137/s1064827500376193","title":"A Scalable Parallel Algorithm for Incomplete Factor Preconditioning","display_name":"A Scalable Parallel Algorithm for Incomplete Factor Preconditioning","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2099093654","doi":"https://doi.org/10.1137/s1064827500376193","mag":"2099093654"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827500376193","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827500376193","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/A5078876685","display_name":"David Hysom","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Hysom","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alex Pothen","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078876685"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3122,"has_fulltext":false,"cited_by_count":148,"citation_normalized_percentile":{"value":0.97533583,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"22","issue":"6","first_page":"2194","last_page":"2215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9973000288009644,"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/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/scalability","display_name":"Scalability","score":0.6938350796699524},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.642113208770752},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.6072834134101868},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5859382748603821},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5818250179290771},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.569089949131012},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5608000159263611},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4513857960700989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4251159429550171},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.0856783390045166}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6938350796699524},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.642113208770752},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.6072834134101868},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5859382748603821},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5818250179290771},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.569089949131012},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608000159263611},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4513857960700989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4251159429550171},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.0856783390045166},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s1064827500376193","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827500376193","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.330.6177","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.6177","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/apothen/parallelILU2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.331.2465","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.331.2465","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/apothen/parallelILU2-1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.7293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.7293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.odu.edu/~pothen/Papers/parallelILU2.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":30,"referenced_works":["https://openalex.org/W18468166","https://openalex.org/W26068137","https://openalex.org/W112736606","https://openalex.org/W1506342804","https://openalex.org/W1546004968","https://openalex.org/W1552224009","https://openalex.org/W1560263223","https://openalex.org/W1967448401","https://openalex.org/W1970450084","https://openalex.org/W1974421439","https://openalex.org/W1977631509","https://openalex.org/W1978170862","https://openalex.org/W1986822694","https://openalex.org/W1992208469","https://openalex.org/W2007556185","https://openalex.org/W2012556326","https://openalex.org/W2013336356","https://openalex.org/W2037724338","https://openalex.org/W2048255281","https://openalex.org/W2060914320","https://openalex.org/W2064448556","https://openalex.org/W2087046932","https://openalex.org/W2089341221","https://openalex.org/W2098862161","https://openalex.org/W2106618443","https://openalex.org/W2115072666","https://openalex.org/W2154851099","https://openalex.org/W2155216327","https://openalex.org/W2164374667","https://openalex.org/W2490922465"],"related_works":["https://openalex.org/W2389214306","https://openalex.org/W2965083567","https://openalex.org/W2070865675","https://openalex.org/W4212854884","https://openalex.org/W1970073092","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2054653010","https://openalex.org/W2997503669","https://openalex.org/W2070426974"],"abstract_inverted_index":{"We":[0,41],"describe":[1],"a":[2,14,23],"parallel":[3,62],"algorithm":[4,12,53],"for":[5,64,93],"computing":[6],"incomplete":[7],"factor":[8],"(ILU)":[9],"preconditioners.":[10],"The":[11,78],"attains":[13],"high":[15],"degree":[16],"of":[17,90,100],"parallelism":[18],"through":[19,43,48],"graph":[20],"partitioning":[21],"and":[22,30,47],"two-level":[24],"ordering":[25],"strategy.":[26],"Both":[27],"the":[28,31,84,88,98],"subdomains":[29],"nodes":[32],"within":[33],"each":[34],"subdomain":[35],"are":[36],"ordered":[37],"to":[38,68,75,97],"preserve":[39],"concurrency.":[40],"show":[42],"an":[44],"algorithmic":[45],"analysis":[46],"computational":[49],"results":[50,57],"that":[51,87],"this":[52],"is":[54,95],"scalable.":[55],"Experimental":[56],"include":[58],"timings":[59],"on":[60,73],"three":[61],"platforms":[63],"problems":[65],"with":[66],"up":[67,74],"20":[69],"million":[70],"unknowns":[71],"running":[72],"216":[76],"processors.":[77,101],"resulting":[79],"preconditioned":[80],"Krylov":[81],"solvers":[82],"have":[83],"desirable":[85],"property":[86],"number":[89,99],"iterations":[91],"required":[92],"convergence":[94],"insensitive":[96]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":15}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}