{"id":"https://openalex.org/W1981367360","doi":"https://doi.org/10.1137/s0895479897317788","title":"Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices","display_name":"Scalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1981367360","doi":"https://doi.org/10.1137/s0895479897317788","mag":"1981367360"},"language":"en","primary_location":{"id":"doi:10.1137/s0895479897317788","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479897317788","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/A5035800721","display_name":"A.C.N. van Duin","orcid":null},"institutions":[{"id":"https://openalex.org/I121797337","display_name":"Leiden University","ror":"https://ror.org/027bh9e22","country_code":"NL","type":"education","lineage":["https://openalex.org/I121797337"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Arno C. N. van Duin","raw_affiliation_strings":["Leiden University"],"affiliations":[{"raw_affiliation_string":"Leiden University","institution_ids":["https://openalex.org/I121797337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035800721"],"corresponding_institution_ids":["https://openalex.org/I121797337"],"apc_list":null,"apc_paid":null,"fwci":1.4652,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.80513211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"20","issue":"4","first_page":"987","last_page":"1006"},"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/T10739","display_name":"Electromagnetic Scattering and Analysis","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9715999960899353,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/preconditioner","display_name":"Preconditioner","score":0.9282053709030151},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7605137825012207},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.6376887559890747},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.6340909004211426},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5303999185562134},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5222997665405273},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5180683135986328},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.5051704049110413},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4990227222442627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4900780916213989},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.486331045627594},{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.43826061487197876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43345049023628235},{"id":"https://openalex.org/keywords/cost-efficiency","display_name":"Cost efficiency","score":0.4120672941207886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3892882466316223},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3810029625892639},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3768356442451477},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.3748423457145691},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.3217669129371643},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.205246239900589},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.1082538366317749}],"concepts":[{"id":"https://openalex.org/C167431342","wikidata":"https://www.wikidata.org/wiki/Q1754327","display_name":"Preconditioner","level":3,"score":0.9282053709030151},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7605137825012207},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.6376887559890747},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.6340909004211426},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5303999185562134},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5222997665405273},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5180683135986328},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.5051704049110413},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4990227222442627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4900780916213989},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.486331045627594},{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.43826061487197876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43345049023628235},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.4120672941207886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3892882466316223},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3810029625892639},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3768356442451477},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.3748423457145691},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3217669129371643},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.205246239900589},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.1082538366317749},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/s0895479897317788","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895479897317788","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.47.5320","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.5320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.wi.leidenuniv.nl/home/arno/iiic.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W43165114","https://openalex.org/W1483773184","https://openalex.org/W1986652366","https://openalex.org/W1992208469","https://openalex.org/W1993274656","https://openalex.org/W1994805693","https://openalex.org/W2009215380","https://openalex.org/W2016168728","https://openalex.org/W2021810545","https://openalex.org/W2036603155","https://openalex.org/W2038516134","https://openalex.org/W2039704521","https://openalex.org/W2078311192","https://openalex.org/W2079361963","https://openalex.org/W2085259167","https://openalex.org/W2089099677","https://openalex.org/W2095420020","https://openalex.org/W2125720043","https://openalex.org/W2140153041","https://openalex.org/W2147542748","https://openalex.org/W2154590891","https://openalex.org/W2155216327","https://openalex.org/W2164374667"],"related_works":["https://openalex.org/W2078637543","https://openalex.org/W2381435995","https://openalex.org/W2063952346","https://openalex.org/W1987177655","https://openalex.org/W2584547575","https://openalex.org/W2809896915","https://openalex.org/W1482750774","https://openalex.org/W2966631139","https://openalex.org/W1592639845","https://openalex.org/W2146296113"],"abstract_inverted_index":{"In":[0],"this":[1,35,48,56],"paper":[2],"an":[3],"approach":[4,14,36],"is":[5],"proposed":[6],"for":[7],"preconditioning":[8,26,41],"large":[9],"general":[10],"sparse":[11],"matrices.":[12],"This":[13],"combines":[15],"the":[16,19,25,40,44,59,76],"scalability":[17],"of":[18,21,28,46,65,75],"application":[20],"explicit":[22],"preconditioners":[23],"with":[24,68],"efficiency":[27,42],"incomplete":[29,78],"factorizations.":[30],"Several":[31],"algorithms":[32],"resulting":[33],"from":[34],"are":[37,50],"presented.":[38],"Both":[39],"and":[43],"cost":[45],"applying":[47],"preconditioner":[49],"tested.":[51],"The":[52],"experiments":[53],"indicate":[54],"that":[55,74],"technique":[57],"offers":[58],"ability":[60],"to":[61,73],"make":[62],"efficient":[63],"use":[64],"parallel":[66],"computers":[67],"a":[69],"convergence":[70],"rate":[71],"comparable":[72],"underlying":[77],"factorization.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}