Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
From MaRDI portal
Recommendations
- On the complexity of the block low-rank multifrontal factorization
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices
- Parallel QR Factorization of Block Low-rank Matrices
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Fast computation of low rank matrix approximations
- A fast block low-rank dense solver with applications to finite-element matrices
- Modified block-approximate factorization strategies
- On Sparse Block Factorization Iterative Methods
Cites work
- Accuracy and Stability of Numerical Algorithms
- Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Exploiting fast matrix multiplication within the level 3 BLAS
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation
- Fast algorithms for hierarchically semiseparable matrices
- Fast linear algebra is stable
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Gaussian elimination is not optimal
- Graph expansion analysis for communication costs of fast rectangular matrix multiplication
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Hierarchical matrices: algorithms and analysis
- Improving multifrontal methods by means of block low-rank representations
- LAPACK Users' Guide
- Matrix multiplication, a little faster
- Nested Dissection of a Regular Finite Element Mesh
- Numerical recipes. The art of scientific computing.
- On a new class of structured matrices
- On the complexity of the block low-rank multifrontal factorization
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Powers of tensors and fast matrix multiplication
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Solving block low-rank linear systems by LU factorization is numerically stable
- Time and space efficient generators for quasiseparable matrices
- Triangular Factorization and Inversion by Fast Matrix Multiplication
Cited in
(3)
This page was built for publication: Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203969)
