CALU: A communication optimal LU factorization algorithm
From MaRDI portal
Publication:3225540
Recommendations
- LU factorization with panel rank revealing pivoting and its communication avoiding version
- Communication-optimal parallel and sequential QR and LU factorizations
- Communication-avoiding symmetric-indefinite factorization
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- Minimizing communication in numerical linear algebra
Cited in
(12)- Communication Avoiding ILU0 Preconditioner
- A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
- A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
- Linear algebra software for large-scale accelerated multicore computing
- Numerical algorithms for high-performance computational science
- CALU
- Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
- Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
- Communication lower bounds and optimal algorithms for numerical linear algebra
- LU factorization with panel rank revealing pivoting and its communication avoiding version
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
This page was built for publication: CALU: A communication optimal LU factorization algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225540)
