Butterfly factorization with error guarantees
From MaRDI portal
Cites work
- A fast butterfly algorithm for the computation of Fourier integral operators
- A multiscale butterfly algorithm for multidimensional Fourier integral operators
- An algorithm for the rapid evaluation of special function transforms
- Butterfly factorization
- Butterfly factorization via randomized matrix-vector multiplications
- Efficient Identification of Butterfly Sparse Matrix Factorizations
- Fast algorithms for spherical harmonic expansions. III
- Fast Fourier transforms: A tutorial review and a state of the art
- Fast wave computation via Fourier integral operators
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Hierarchical matrices: algorithms and analysis
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Interpolative butterfly factorization
- Multidimensional butterfly factorization
- On the limited memory BFGS method for large scale optimization
- Randomized algorithms for the low-rank approximation of matrices
- Sparse Fourier Transform via Butterfly Algorithm
- Spurious Valleys, NP-Hardness, and Tractability of Sparse Matrix Factorization with Fixed Support
- Tensor-train decomposition
- The approximation of one matrix by another of lower rank.
- The fast multipole method (FMM) for electromagnetic scattering problems
This page was built for publication: Butterfly factorization with error guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902505)
