Solving block low-rank linear systems by LU factorization is numerically stable
From MaRDI portal
Recommendations
- On the complexity of the block low-rank multifrontal factorization
- Stability of block algorithms with fast level-3 BLAS
- LU factorization with panel rank revealing pivoting and its communication avoiding version
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Improving multifrontal methods by means of block low-rank representations
Cited in
(13)- Stability of the matrix factorization for solving block tridiagonal symmetric indefinite linear systems
- A two-scale solver for linear elasticity problems in the context of parallel message passing
- Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR^2 Format
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- 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
- Mixed precision algorithms in numerical linear algebra
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning
- Mixed precision low-rank approximations and their application to block low-rank LU factorization
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Sparse approximate multifrontal factorization with composite compression methods
- Randomized block low-rank matrix compression by tagging
- Blas-based mixed precision block memory accessor with applications to sparse direct solvers
This page was built for publication: Solving block low-rank linear systems by LU factorization is numerically stable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075138)
