{"id":"https://openalex.org/W4414909288","doi":"https://doi.org/10.1109/cluster59342.2025.11186492","title":"Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm","display_name":"Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm","publication_year":2025,"publication_date":"2025-09-02","ids":{"openalex":"https://openalex.org/W4414909288","doi":"https://doi.org/10.1109/cluster59342.2025.11186492"},"language":"en","primary_location":{"id":"doi:10.1109/cluster59342.2025.11186492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster59342.2025.11186492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing (CLUSTER)","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/A5079862429","display_name":"Yuki Uchino","orcid":"https://orcid.org/0000-0002-5906-6624"},"institutions":[{"id":"https://openalex.org/I4210129730","display_name":"RIKEN Center for Computational Science","ror":"https://ror.org/03r519674","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210110652","https://openalex.org/I4210129730"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yuki Uchino","raw_affiliation_strings":["RIKEN Center for Computational Science,Hyogo,Japan"],"affiliations":[{"raw_affiliation_string":"RIKEN Center for Computational Science,Hyogo,Japan","institution_ids":["https://openalex.org/I4210129730"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086152822","display_name":"Toshiyuki Imamura","orcid":"https://orcid.org/0000-0003-1601-9710"},"institutions":[{"id":"https://openalex.org/I4210129730","display_name":"RIKEN Center for Computational Science","ror":"https://ror.org/03r519674","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210110652","https://openalex.org/I4210129730"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiyuki Imamura","raw_affiliation_strings":["RIKEN Center for Computational Science,Hyogo,Japan"],"affiliations":[{"raw_affiliation_string":"RIKEN Center for Computational Science,Hyogo,Japan","institution_ids":["https://openalex.org/I4210129730"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5079862429"],"corresponding_institution_ids":["https://openalex.org/I4210129730"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41716061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14347","display_name":"Big Data and Digital Economy","score":0.03720000013709068,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T14347","display_name":"Big Data and Digital Economy","score":0.03720000013709068,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.03220000118017197,"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"}},{"id":"https://openalex.org/T13731","display_name":"Advanced Computing and Algorithms","score":0.032099999487400055,"subfield":{"id":"https://openalex.org/subfields/3322","display_name":"Urban Studies"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/qr-decomposition","display_name":"QR decomposition","score":0.8709999918937683},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.7049000263214111},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5848000049591064},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.541700005531311},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5055000185966492},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4422999918460846},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.44020000100135803},{"id":"https://openalex.org/keywords/numerical-linear-algebra","display_name":"Numerical linear algebra","score":0.4185999929904938}],"concepts":[{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.8709999918937683},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7049000263214111},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6852999925613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6689000129699707},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5848000049591064},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.541700005531311},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5055000185966492},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4422999918460846},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.44020000100135803},{"id":"https://openalex.org/C163834973","wikidata":"https://www.wikidata.org/wiki/Q2004891","display_name":"Numerical linear algebra","level":3,"score":0.4185999929904938},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.36640000343322754},{"id":"https://openalex.org/C137559481","wikidata":"https://www.wikidata.org/wiki/Q1231787","display_name":"Dixon's factorization method","level":5,"score":0.3440999984741211},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.322299987077713},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C176321772","wikidata":"https://www.wikidata.org/wiki/Q1430640","display_name":"Numerical stability","level":3,"score":0.2818000018596649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2809999883174896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cluster59342.2025.11186492","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cluster59342.2025.11186492","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Cluster Computing (CLUSTER)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1971662204","https://openalex.org/W1991973947","https://openalex.org/W2001135345","https://openalex.org/W2005498993","https://openalex.org/W2021870845","https://openalex.org/W2032052535","https://openalex.org/W2039778940","https://openalex.org/W2119522963","https://openalex.org/W2157237396","https://openalex.org/W2163688235","https://openalex.org/W2982181895","https://openalex.org/W3007862902","https://openalex.org/W3022909171","https://openalex.org/W4236367156","https://openalex.org/W4312258136","https://openalex.org/W4412014884"],"related_works":[],"abstract_inverted_index":{"We":[0],"present":[1],"optimal":[2],"parallel":[3,35,49,79],"QR":[4,11,65,80],"factorization":[5,12,66,81],"algorithms":[6,50,67,82,99,108,120],"with":[7],"reduced":[8],"communication":[9,41,53,73],"overhead.":[10],"is":[13,26,42,55],"widely":[14],"applied":[15],"to":[16,71],"solve":[17],"various":[18],"problems":[19,28],"in":[20,33,48],"numerical":[21],"linear":[22],"algebra.":[23],"Our":[24],"focus":[25],"on":[27,84],"involving":[29],"dense":[30],"tall-and-skinny":[31],"matrices":[32],"large-scale":[34],"distributed":[36],"memory":[37],"systems.":[38],"Reducing":[39],"data":[40],"essential":[43],"for":[44,113],"achieving":[45],"high":[46],"performance":[47,95],"because":[51],"the":[52,59,85,92,97,106],"cost":[54],"much":[56],"greater":[57],"than":[58,123],"computation":[60],"cost.":[61],"To":[62],"date,":[63],"several":[64],"have":[68],"been":[69],"optimized":[70],"reduce":[72],"costs.":[74],"This":[75],"paper":[76],"provides":[77],"alternative":[78],"based":[83],"LU-CholeskyQR":[86],"algorithm.":[87],"Numerical":[88],"experiment":[89],"results":[90,103],"demonstrated":[91],"accuracy":[93],"and":[94,116],"of":[96,118],"developed":[98],"against":[100],"benchmarks.":[101],"The":[102],"indicate":[104],"that":[105],"new":[107],"are":[109,121],"numerically":[110],"stable":[111],"even":[112],"ill-conditioned":[114],"problems,":[115],"some":[117],"these":[119],"faster":[122],"other":[124],"conventional":[125],"algorithms.":[126]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}