{"id":"https://openalex.org/W2130429187","doi":"https://doi.org/10.1109/isqed.2010.5450430","title":"Fast block-iterative domain decomposition algorithm for IR drop analysis in large power grid","display_name":"Fast block-iterative domain decomposition algorithm for IR drop analysis in large power grid","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2130429187","doi":"https://doi.org/10.1109/isqed.2010.5450430","mag":"2130429187"},"language":"en","primary_location":{"id":"doi:10.1109/isqed.2010.5450430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2010.5450430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th International Symposium on Quality Electronic Design (ISQED)","raw_type":"proceedings-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/A5069298813","display_name":"Yu Lin Zhong","orcid":"https://orcid.org/0000-0001-6741-3609"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yu Zhong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin D. F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069298813"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":4.2957,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.94716771,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"277","last_page":"283"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9948999881744385,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9948999881744385,"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/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9726999998092651,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9593999981880188,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7496521472930908},{"id":"https://openalex.org/keywords/domain-decomposition-methods","display_name":"Domain decomposition methods","score":0.7114986181259155},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6495898962020874},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.635248064994812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6183943152427673},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6134964227676392},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5697956085205078},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.531972348690033},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.4718073904514313},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.43564945459365845},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4344387948513031},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4273582100868225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1424236297607422}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7496521472930908},{"id":"https://openalex.org/C198880260","wikidata":"https://www.wikidata.org/wiki/Q5289813","display_name":"Domain decomposition methods","level":3,"score":0.7114986181259155},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6495898962020874},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.635248064994812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6183943152427673},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6134964227676392},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5697956085205078},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.531972348690033},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4718073904514313},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.43564945459365845},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4344387948513031},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4273582100868225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1424236297607422},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C135628077","wikidata":"https://www.wikidata.org/wiki/Q220184","display_name":"Finite element method","level":2,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isqed.2010.5450430","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isqed.2010.5450430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 11th International Symposium on Quality Electronic Design (ISQED)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","score":0.550000011920929,"display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W107510031","https://openalex.org/W1988562640","https://openalex.org/W2041723838","https://openalex.org/W2110295511","https://openalex.org/W2115314588","https://openalex.org/W2130464226","https://openalex.org/W2160003926","https://openalex.org/W2168747796","https://openalex.org/W4238320324"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2908130256","https://openalex.org/W3138386522","https://openalex.org/W2499279132","https://openalex.org/W2528452804","https://openalex.org/W2331939936","https://openalex.org/W2045642207"],"abstract_inverted_index":{"Due":[0],"to":[1,28,32,43,161],"the":[2,38,87,96,103,106,109,134,155,158],"extremely":[3],"large":[4,59,120],"sizes":[5],"of":[6,21,105,136,166,176],"power":[7,164,174],"grids,":[8],"IR":[9],"drop":[10],"analysis":[11,83],"has":[12,92,99],"become":[13],"a":[14,45,58,68,79,81,127,143,163,173],"computationally":[15],"challenging":[16],"problem":[17,60],"both":[18],"in":[19,75,98,117,181],"terms":[20],"runtime":[22],"and":[23,111,139],"memory":[24],"usage.":[25],"In":[26,122],"order":[27],"design":[29],"scalable":[30],"algorithms":[31],"handle":[33],"ever":[34],"increasing":[35],"power-grid":[36,82],"sizes,":[37],"most":[39],"promising":[40],"approach":[41,54,150],"is":[42],"use":[44],"\u00bfdivide-and-conquer\u00bf":[46],"strategy":[47],"such":[48],"as":[49],"domain":[50,89,146],"decomposition.":[51],"Such":[52],"an":[53],"not":[55,152],"only":[56],"decomposes":[57],"into":[61],"manageable":[62],"sub-problems,":[63],"it":[64],"also":[65],"naturally":[66],"allow":[67],"parallel":[69],"processing":[70],"solution":[71],"for":[72],"further":[73],"speedup":[74],"computation":[76],"time.":[77],"As":[78],"result,":[80],"algorithm":[84,130,159,171],"based":[85],"upon":[86],"traditional":[88],"decomposition":[90,147],"method":[91,97],"been":[93],"reported.":[94],"Unfortunately,":[95],"strong":[100],"limitation":[101],"on":[102],"size":[104],"interfaces":[107],"between":[108],"sub-problems":[110],"therefore":[112],"severely":[113],"limits":[114],"its":[115],"capability":[116],"solving":[118],"very":[119],"problems.":[121],"this":[123],"paper,":[124],"we":[125],"present":[126],"block-iterative":[128],"domain-decomposition":[129],"which":[131],"effectively":[132],"combines":[133],"advantages":[135],"direct":[137],"solvers":[138],"iterative":[140],"methods.":[141],"With":[142],"carefully":[144],"chosen":[145],"strategy,":[148],"our":[149,170],"does":[151],"suffer":[153],"from":[154],"difficulties.":[156],"While":[157],"fails":[160],"analyze":[162],"grid":[165,175],"4":[167],"millions":[168,178],"nodes,":[169],"solves":[172],"42":[177],"nodes":[179],"accurately":[180],"1.5":[182],"hours.":[183]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}