eScholarship
metadata only
Butterfly Factorization Via Randomized Matrix-Vector Multiplications
This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of $\mathcal{O}(\log n)$ spar
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- SpSYRK: Half the Work in Distributed Sparse Matrix Multiplication#441743
- Dynamic Matrix Recovery#131189
- Matrices perturbed by random noise: The accuracy of low-rank approximation#652125
- Matrices perturbed by random noise: The accuracy of low-rank approximation#650672
- Reconstruction of shredded random matrices#228161
Record · ID 1119895
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive