{"id":"https://openalex.org/W7172286371","doi":"https://doi.org/10.48550/arxiv.2607.29361","title":"A recursive butterfly factorization with optimality guarantees","display_name":"A recursive butterfly factorization with optimality guarantees","publication_year":2026,"publication_date":"2026-07-31","ids":{"openalex":"https://openalex.org/W7172286371","doi":"https://doi.org/10.48550/arxiv.2607.29361"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.29361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.29361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.29361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109965178","display_name":"David Persson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Persson, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043580116","display_name":"Paul G. Beckman","orcid":"https://orcid.org/0000-0003-1650-5276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beckman, Paul G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015158780","display_name":"Tyler Chen","orcid":"https://orcid.org/0000-0002-1187-1026"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Tyler","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073977925","display_name":"Diana Halikias","orcid":"https://orcid.org/0000-0001-7159-7770"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Halikias, Diana","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018420180","display_name":"Christopher Musco","orcid":"https://orcid.org/0000-0002-3118-4848"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Musco, Christopher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.37529999017715454,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.37529999017715454,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.17229999601840973,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.09099999815225601,"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/butterfly","display_name":"Butterfly","score":0.7598000168800354},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6660000085830688},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5404999852180481},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4805000126361847},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47530001401901245},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4675999879837036},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.46720001101493835}],"concepts":[{"id":"https://openalex.org/C2778605236","wikidata":"https://www.wikidata.org/wiki/Q1018085","display_name":"Butterfly","level":2,"score":0.7598000168800354},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6660000085830688},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5404999852180481},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4805000126361847},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47530001401901245},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4675999879837036},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.46720001101493835},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4603999853134155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45080000162124634},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.43709999322891235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4205999970436096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4081000089645386},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.388700008392334},{"id":"https://openalex.org/C137559481","wikidata":"https://www.wikidata.org/wiki/Q1231787","display_name":"Dixon's factorization method","level":5,"score":0.36480000615119934},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3068999946117401},{"id":"https://openalex.org/C103275481","wikidata":"https://www.wikidata.org/wiki/Q6787889","display_name":"Matrix representation","level":3,"score":0.3043000102043152},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2768000066280365},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.29361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.29361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.29361","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.29361","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,78,115],"formalize":[1],"a":[2,7,16,22,48,63,75,81,101,109,121],"recursive":[3,18],"format":[4,12],"for":[5,20,146],"representing":[6],"butterfly":[8,24,49,76,102,126],"matrix.":[9,77],"This":[10],"new":[11],"naturally":[13],"leads":[14],"to":[15,26],"simple":[17],"algorithm":[19,46,119],"computing":[21],"quasi-optimal":[23],"approximation":[25,56,73,103],"an":[27],"arbitrary":[28],"$N":[29],"\\times":[30],"N$":[31],"matrix":[32,50],"$A$.":[33],"When":[34],"the":[35,45,70,85,112,118,124,141],"entries":[36],"of":[37,69,84,111,123],"$A$":[38],"are":[39],"explicitly":[40],"available,":[41],"we":[42],"show":[43,116],"that":[44,68,117,147],"computes":[47],"$B$":[51],"in":[52,130],"$O(N^2)$":[53],"operations":[54],"with":[55,97,104],"error":[57,107],"$\\|A":[58],"-":[59],"B\\|_F$":[60],"at":[61],"most":[62],"$O(\\sqrt{\\log(N)})$":[64],"factor":[65],"away":[66],"from":[67],"best":[71],"possible":[72],"by":[74],"also":[79],"develop":[80],"matrix-free":[82],"variant":[83],"method,":[86],"which":[87],"uses":[88],"$\\widetilde{O}(\\sqrt{N})$":[89],"matrix-vector":[90],"products":[91],"and":[92],"$\\widetilde{O}(N)$":[93],"working":[94],"memory":[95],"and,":[96],"high":[98],"probability,":[99],"returns":[100],"Frobenius":[105],"norm":[106],"within":[108],"$O(N^{1/4})$-factor":[110],"optimal":[113],"error.":[114],"is":[120],"reformulation":[122],"hybrid":[125],"factorization":[127],"approach":[128],"presented":[129],"[Liu":[131],"et.":[132],"al.;":[133],"SISC,":[134],"43":[135],"(2021)].":[136],"Our":[137],"paper":[138],"therefore":[139],"provides":[140],"first":[142],"theoretical":[143],"quasi-optimality":[144],"guarantee":[145],"algorithm.":[148]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2026-08-04T00:00:00"}