{"id":"https://openalex.org/W7133546056","doi":"https://doi.org/10.7717/peerj-cs.3680","title":"Improving parallel hybrid solvers through block low-rank compression and adaptive threshold selection","display_name":"Improving parallel hybrid solvers through block low-rank compression and adaptive threshold selection","publication_year":2026,"publication_date":"2026-03-04","ids":{"openalex":"https://openalex.org/W7133546056","doi":"https://doi.org/10.7717/peerj-cs.3680"},"language":"en","primary_location":{"id":"doi:10.7717/peerj-cs.3680","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3680","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.7717/peerj-cs.3680","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128093179","display_name":"F. Sukru Torun","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"F. Sukru Torun","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-6662-2502","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5128093179"],"corresponding_institution_ids":[],"apc_list":{"value":1395,"currency":"USD","value_usd":1395},"apc_paid":{"value":1395,"currency":"USD","value_usd":1395},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38778027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":null,"first_page":"e3680","last_page":"e3680"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.48730000853538513,"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.48730000853538513,"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.1282999962568283,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.09319999814033508,"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/block","display_name":"Block (permutation group theory)","score":0.7278000116348267},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4821999967098236},{"id":"https://openalex.org/keywords/multigrid-method","display_name":"Multigrid method","score":0.4050000011920929},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.3955000042915344},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.38960000872612},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.36070001125335693},{"id":"https://openalex.org/keywords/compression-ratio","display_name":"Compression ratio","score":0.35510000586509705}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.760200023651123},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.7278000116348267},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45239999890327454},{"id":"https://openalex.org/C137119250","wikidata":"https://www.wikidata.org/wiki/Q1413101","display_name":"Multigrid method","level":3,"score":0.4050000011920929},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.36070001125335693},{"id":"https://openalex.org/C25797200","wikidata":"https://www.wikidata.org/wiki/Q828137","display_name":"Compression ratio","level":3,"score":0.35510000586509705},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.31790000200271606},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3057999908924103},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2994999885559082},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C74912251","wikidata":"https://www.wikidata.org/wiki/Q6815727","display_name":"Memory footprint","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.26579999923706055},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7717/peerj-cs.3680","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3680","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:01546ea25da24a28adcc0caba5fdc16e","is_oa":true,"landing_page_url":"https://doaj.org/article/01546ea25da24a28adcc0caba5fdc16e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"PeerJ Computer Science, Vol 12, p e3680 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.7717/peerj-cs.3680","is_oa":true,"landing_page_url":"https://doi.org/10.7717/peerj-cs.3680","pdf_url":null,"source":{"id":"https://openalex.org/S4210178049","display_name":"PeerJ Computer Science","issn_l":"2376-5992","issn":["2376-5992"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320104","host_organization_name":"PeerJ, Inc.","host_organization_lineage":["https://openalex.org/P4310320104"],"host_organization_lineage_names":["PeerJ, Inc."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"PeerJ Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.44619086384773254,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1483999018","https://openalex.org/W1506342804","https://openalex.org/W1518039036","https://openalex.org/W1520511539","https://openalex.org/W1559275088","https://openalex.org/W1574975351","https://openalex.org/W1978799274","https://openalex.org/W1981220107","https://openalex.org/W1982064072","https://openalex.org/W2000895477","https://openalex.org/W2005423095","https://openalex.org/W2011832776","https://openalex.org/W2013424510","https://openalex.org/W2018227046","https://openalex.org/W2023424931","https://openalex.org/W2027485220","https://openalex.org/W2027634563","https://openalex.org/W2028035197","https://openalex.org/W2030942503","https://openalex.org/W2035080386","https://openalex.org/W2040145533","https://openalex.org/W2052602889","https://openalex.org/W2060259097","https://openalex.org/W2060675257","https://openalex.org/W2063675347","https://openalex.org/W2064003621","https://openalex.org/W2070299075","https://openalex.org/W2070571481","https://openalex.org/W2084363278","https://openalex.org/W2087399108","https://openalex.org/W2089598668","https://openalex.org/W2099093654","https://openalex.org/W2099753835","https://openalex.org/W2140153041","https://openalex.org/W2141331848","https://openalex.org/W2142184646","https://openalex.org/W2160774872","https://openalex.org/W2234902027","https://openalex.org/W2607498875","https://openalex.org/W2612290557","https://openalex.org/W2731353277","https://openalex.org/W2787894218","https://openalex.org/W2911964244","https://openalex.org/W2963896572","https://openalex.org/W2966353369","https://openalex.org/W3128025997","https://openalex.org/W3136543987","https://openalex.org/W3203140351","https://openalex.org/W4289772929","https://openalex.org/W4294590177","https://openalex.org/W4362699602","https://openalex.org/W4380224594","https://openalex.org/W4392369243","https://openalex.org/W4406047773","https://openalex.org/W4408333769"],"related_works":[],"abstract_inverted_index":{"Sparse":[0],"linear":[1],"systems":[2],"play":[3],"an":[4],"important":[5],"role":[6],"in":[7,154],"scientific":[8],"computing":[9],"and":[10,25,48,116,124,157,168,184,200],"large-scale":[11],"simulations.":[12],"They":[13],"often":[14,95],"become":[15],"the":[16,29,34,58,85,109,117,122,140],"main":[17],"computational":[18,105],"bottleneck.":[19],"For":[20],"solving":[21],"such":[22],"systems,":[23],"Krylov":[24],"multigrid":[26],"methods":[27],"are":[28,94],"predominant":[30],"iterative":[31,59],"approaches,":[32],"while":[33,63,128],"block":[35,78,92,142],"Cimmino":[36,143],"(BC)":[37],"method":[38],"offers":[39],"a":[40,77,145,164,173,198],"hybrid,":[41],"projection-based":[42],"alternative":[43],"with":[44,97,191],"strong":[45],"parallel":[46,114,205],"efficiency":[47,167],"direct-solver":[49],"robustness.":[50],"Existing":[51],"studies":[52],"have":[53],"predominantly":[54],"focused":[55],"on":[56],"improving":[57,204],"aspects":[60],"of":[61,88,126,148],"BC,":[62,91],"its":[64,130],"direct":[65,86],"solution":[66,87,125,155],"is":[67],"relatively":[68],"neglected.":[69],"This":[70],"study":[71,196],"addresses":[72],"this":[73,137,195],"gap":[74],"by":[75],"proposing":[76],"low-rank":[79],"(BLR)":[80],"compression\u2013based":[81],"approach":[82,138,202],"to":[83,103,139],"accelerate":[84],"BC.":[89,149],"In":[90,133],"solutions":[93],"computed":[96],"higher":[98],"precision":[99],"than":[100],"needed,":[101],"leading":[102],"unnecessary":[104],"effort.":[106],"By":[107,187],"employing":[108],"BLR":[110,161,179,189],"technique,":[111],"we":[112,135,170],"reduce":[113],"time":[115,156],"memory":[118],"consumption":[119],"required":[120],"for":[121,177,203],"factorization":[123],"blocks,":[127],"preserving":[129],"convergence":[131],"properties.":[132],"addition,":[134],"extend":[136],"augmented":[141],"method,":[144],"pseudo-direct":[146],"variant":[147],"Experiments":[150],"confirm":[151],"significant":[152],"reductions":[153],"resource":[158],"use.":[159],"Since":[160],"compression":[162,190],"introduces":[163],"trade-off":[165],"between":[166],"accuracy,":[169],"further":[171],"present":[172],"machine":[174],"learning":[175],"framework":[176],"automatic":[178],"threshold":[180,193],"tuning,":[181,194],"using":[182],"classification":[183],"regression":[185],"models.":[186],"combining":[188],"data-driven":[192],"provides":[197],"new":[199],"successful":[201],"hybrid":[206],"solvers.":[207]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-03-05T00:00:00"}