Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
DOI10.1137/19M1255628OpenAlexW2980372014WikidataQ114074256 ScholiaQ114074256MaRDI QIDQ5203969FDOQ5203969
Authors: Claude-Pierre Jeannerod, Theo A. Mary, Clément Pernet, Daniel S. Roche 
Publication date: 9 December 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1255628
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
Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23) Numerical analysis (65-XX) Computer science (68-XX)
Cites Work
- LAPACK Users' Guide
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Fast algorithms for hierarchically semiseparable matrices
- Powers of tensors and fast matrix multiplication
- Nested Dissection of a Regular Finite Element Mesh
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Numerical recipes. The art of scientific computing.
- Gaussian elimination is not optimal
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- Accuracy and Stability of Numerical Algorithms
- Hierarchical matrices: algorithms and analysis
- On a new class of structured matrices
- Exploiting fast matrix multiplication within the level 3 BLAS
- Fast linear algebra is stable
- Improving multifrontal methods by means of block low-rank representations
- Matrix multiplication, a little faster
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition
- Solving block low-rank linear systems by LU factorization is numerically stable
- Graph expansion analysis for communication costs of fast rectangular matrix multiplication
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- On the complexity of the block low-rank multifrontal factorization
- Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
- Time and space efficient generators for quasiseparable matrices
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation
Cited In (2)
Uses Software
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)
