{"id":"https://openalex.org/W4386027728","doi":"https://doi.org/10.1515/mcma-2023-2012","title":"Pass-efficient randomized LU algorithms for computing low-rank matrix approximation","display_name":"Pass-efficient randomized LU algorithms for computing low-rank matrix approximation","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W4386027728","doi":"https://doi.org/10.1515/mcma-2023-2012"},"language":null,"primary_location":{"id":"pmh:oai:RePEc:bpj:mcmeap:v:29:y:2023:i:3:p:181-202:n:2","is_oa":false,"landing_page_url":"https://doi.org/10.1515/mcma-2023-2012","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"article","indexed_in":[],"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/A5076350171","display_name":"Bolong Zhang","orcid":"https://orcid.org/0000-0002-2955-8409"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhang Bolong","raw_affiliation_strings":["Department of Computer Science , Florida State University , Tallahassee , FL 32306-4530 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Florida State University , Tallahassee , FL 32306-4530 , USA","institution_ids":["https://openalex.org/I103163165"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071387306","display_name":"Michael Mascagni","orcid":"https://orcid.org/0000-0003-3058-4580"},"institutions":[{"id":"https://openalex.org/I103163165","display_name":"Florida State University","ror":"https://ror.org/05g3dte14","country_code":"US","type":"education","lineage":["https://openalex.org/I103163165"]},{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]},{"id":"https://openalex.org/I4210126846","display_name":"Information Technology Laboratory","ror":"https://ror.org/0440c3437","country_code":"US","type":"government","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065","https://openalex.org/I4210126846"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mascagni Michael","raw_affiliation_strings":["Department of Computer Science, Department of Mathematics, Department of Scientific Computing , Florida State University , Tallahassee , FL 32306-4530 ; and National Institute of Standards & Technology, Information Technology Laboratory, Applied and Computational Mathematics Division, Gaithersburg, MD 20899-8910 , USA","Department of Computer Science, Department of Mathematics, Department of Scientific Computing, Florida State University, Tallahassee, FL 32306-4530"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Department of Mathematics, Department of Scientific Computing , Florida State University , Tallahassee , FL 32306-4530 ; and National Institute of Standards & Technology, Information Technology Laboratory, Applied and Computational Mathematics Division, Gaithersburg, MD 20899-8910 , USA","institution_ids":["https://openalex.org/I1321296531","https://openalex.org/I103163165","https://openalex.org/I4210126846"]},{"raw_affiliation_string":"Department of Computer Science, Department of Mathematics, Department of Scientific Computing, Florida State University, Tallahassee, FL 32306-4530","institution_ids":["https://openalex.org/I103163165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071387306"],"corresponding_institution_ids":["https://openalex.org/I103163165","https://openalex.org/I1321296531","https://openalex.org/I4210126846"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"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/T12303","display_name":"Tensor decomposition and applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.8104976415634155},{"id":"https://openalex.org/keywords/lu-decomposition","display_name":"LU decomposition","score":0.5925455093383789},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.58156418800354},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5364831686019897},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5356416702270508},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.5235766172409058},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5025804042816162},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.474791944026947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46302950382232666},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4494919776916504},{"id":"https://openalex.org/keywords/singular-value","display_name":"Singular value","score":0.4384475350379944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4271661341190338},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37754741311073303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24492484331130981},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.12291881442070007},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12082961201667786},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09669625759124756},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.09496727585792542}],"concepts":[{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.8104976415634155},{"id":"https://openalex.org/C123213974","wikidata":"https://www.wikidata.org/wiki/Q833089","display_name":"LU decomposition","level":4,"score":0.5925455093383789},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.58156418800354},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5364831686019897},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5356416702270508},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.5235766172409058},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5025804042816162},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.474791944026947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46302950382232666},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4494919776916504},{"id":"https://openalex.org/C109282560","wikidata":"https://www.wikidata.org/wiki/Q4166054","display_name":"Singular value","level":3,"score":0.4384475350379944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4271661341190338},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37754741311073303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24492484331130981},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.12291881442070007},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12082961201667786},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09669625759124756},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.09496727585792542},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:RePEc:bpj:mcmeap:v:29:y:2023:i:3:p:181-202:n:2","is_oa":false,"landing_page_url":"https://doi.org/10.1515/mcma-2023-2012","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1963826206","https://openalex.org/W1970576574","https://openalex.org/W1971806979","https://openalex.org/W1974427541","https://openalex.org/W1986326495","https://openalex.org/W1993482030","https://openalex.org/W2003690406","https://openalex.org/W2004026774","https://openalex.org/W2013442644","https://openalex.org/W2019291207","https://openalex.org/W2021604182","https://openalex.org/W2024165284","https://openalex.org/W2042465463","https://openalex.org/W2064667796","https://openalex.org/W2117756735","https://openalex.org/W2119233169","https://openalex.org/W2141696759","https://openalex.org/W2153663612","https://openalex.org/W2394933259","https://openalex.org/W2569261326","https://openalex.org/W2611027513","https://openalex.org/W2805127664","https://openalex.org/W2896144487","https://openalex.org/W2962717353","https://openalex.org/W2962760844","https://openalex.org/W2963108114","https://openalex.org/W2963317066","https://openalex.org/W2963718636","https://openalex.org/W2963773113","https://openalex.org/W3010492783","https://openalex.org/W3100283647","https://openalex.org/W4244670803"],"related_works":["https://openalex.org/W2964108162","https://openalex.org/W2772729003","https://openalex.org/W2752756450","https://openalex.org/W2962894463","https://openalex.org/W2962895005","https://openalex.org/W2952699400","https://openalex.org/W1925032196","https://openalex.org/W2336075021","https://openalex.org/W2951931073","https://openalex.org/W4287867153"],"abstract_inverted_index":{"Low-rank":[0],"matrix":[1,28,60,186],"approximation":[2,29,61,101,187],"is":[3,55,104,142,190,245],"extremely":[4,72],"useful":[5],"in":[6,13,205,224],"the":[7,82,98,107,110,124,146,167,182,239,248],"analysis":[8],"of":[9,109,112,121,123,177,241],"data":[10,19,23,74],"that":[11,138,158,212,214,238],"arises":[12],"scientific":[14],"computing,":[15],"engineering":[16],"applications,":[17],"and":[18,37,67,115],"science.":[20],"However,":[21],"as":[22,32,64],"sizes":[24],"grow,":[25],"traditional":[26],"low-rank":[27,59,100,185],"methods,":[30],"such":[31,63],"singular":[33],"value":[34],"decomposition":[35,41,70,85],"(SVD)":[36],"column":[38],"pivoting":[39],"QR":[40],"(CPQR),":[42],"are":[43],"either":[44],"prohibitively":[45],"expensive":[46],"or":[47],"cannot":[48],"provide":[49],"sufficiently":[50],"accurate":[51],"results.":[52],"A":[53],"solution":[54],"to":[56,220],"use":[57],"randomized":[58,65,68,83,92,148,169],"methods":[62],"SVD,":[66],"LU":[69,84,93,149,170,234],"on":[71,81,106,135,155,195,233],"large":[73],"sets.":[75],"In":[76],"this":[77,206],"paper,":[78],"we":[79,88],"focus":[80],"method.":[86],"Then":[87],"propose":[89,174,228],"a":[90,175,191,229],"novel":[91],"algorithm,":[94],"called":[95,179],"SubspaceLU,":[96,178],"for":[97,117,181],"fixed":[99,183],"problem.":[102,188],"SubspaceLU":[103,141,161],"based":[105,194,232],"sketch":[108],"co-range":[111],"input":[113,125],"matrices":[114],"allows":[116],"an":[118,196],"arbitrary":[119],"number":[120],"passes":[122],"matrix,":[126],"v":[127],"\u2265":[128],"2":[129],"{v\\geq":[130],"2}":[131],".":[132],"Numerical":[133],"experiments":[134,211],"CPU":[136],"show":[137,213,237],"our":[139,159,242],"proposed":[140,160,204],"generally":[143],"faster":[144,223],"than":[145,166],"existing":[147,168,249],"decomposition,":[150],"while":[151],"remaining":[152],"accurate.":[153],"Experiments":[154],"GPU":[156],"shows":[157],"can":[162,216],"gain":[163],"more":[164],"speedup":[165],"decomposition.":[171],"We":[172,208,226],"also":[173],"version":[176],"SubspaceLU_FP,":[180],"precision":[184],"SubspaceLU_FP":[189,215],"post-processing":[192],"step":[193],"efficient":[197],"blocked":[198],"adaptive":[199],"rank":[200],"determination":[201],"Algorithm":[202],"5":[203],"paper.":[207],"present":[209],"numerical":[210],"achieve":[217],"close":[218],"results":[219],"SVD":[221],"but":[222],"speed.":[225],"finally":[227],"single-pass":[230,243,250],"algorithm":[231,244],"factorization.":[235],"Tests":[236],"accuracy":[240],"comparable":[246],"with":[247],"algorithms.":[251]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2025-10-10T00:00:00"}