Generalizing random butterfly transforms to arbitrary matrix sizes
From MaRDI portal
Cites work
- LU Factorization Algorithms on Distributed-Memory Multiprocessor Architectures
- A fast and efficient algorithm for low-rank approximation of a matrix
- A fast randomized algorithm for the approximation of matrices
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Accelerating Linear System Solutions Using Randomization Techniques
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- CALU: A communication optimal LU factorization algorithm
- Five-Precision GMRES-Based Iterative Refinement
- Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Numerically safe Gaussian elimination with no pivoting
- On spectral and numerical properties of random butterfly matrices
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Randomized numerical linear algebra: Foundations and algorithms
- Randomized preprocessing versus pivoting
- Riemann's hypothesis as an eigenvalue problem
- Towards dense linear algebra for hybrid GPU accelerated manycore systems
- Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
This page was built for publication: Generalizing random butterfly transforms to arbitrary matrix sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032901)
