Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
From MaRDI portal
Publication:6487403
Recommendations
- Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
- Accelerating Linear System Solutions Using Randomization Techniques
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Compressed threshold pivoting for sparse symmetric indefinite systems
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 2087097 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- A Supernodal Approach to Sparse Partial Pivoting
- Accelerating Linear System Solutions Using Randomization Techniques
- Accuracy and Stability of Numerical Algorithms
- ScaLAPACK Users' Guide
- SuperLU_DIST
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Towards dense linear algebra for hybrid GPU accelerated manycore systems
Cited in
(4)- Growth Factors of Random Butterfly Matrices and the Stability of Avoiding Pivoting
- An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation
- Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
- Randomized numerical linear algebra: Foundations and algorithms
This page was built for publication: Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487403)
