CALU

swMATH6433MaRDI QIDQ18544FDOQ18544

Author name not available (Why is that?)

Described by source

• CALU: A communication optimal LU factorization algorithm

Cited In (10)

• Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
• Communication-optimal parallel and sequential QR and LU factorizations
• A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
• Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Wilkinson's inertia-revealing factorization and its application to sparse matrices.
• Communication Avoiding ILU0 Preconditioner

This page was built for software: CALU