On the complexity of the block low-rank multifrontal factorization
From MaRDI portal
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Factorization of matrices (15A23) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Recommendations
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Improving multifrontal methods by means of block low-rank representations
- Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
- A fast block low-rank dense solver with applications to finite-element matrices
- Solving block low-rank linear systems by LU factorization is numerically stable
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A New Implementation of Sparse Gaussian Elimination
- A Symmetry Preserving Algorithm for Matrix Scaling
- A direct solver with O(N) complexity for integral equations on one-dimensional domains
- A fast block low-rank dense solver with applications to finite-element matrices
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- Construction and arithmetics of \(\mathcal H\)-matrices
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Efficient structured multifrontal factorization for general large sparse matrices
- Existence of H-matrix approximants to the inverse FE-matrix of elliptic operators with L^-coefficients
- Fast algorithms for hierarchically semiseparable matrices
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Hierarchical matrices based on a weak admissibility criterion
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- Improving multifrontal methods by means of block low-rank representations
- Introduction to hierarchical matrices with applications.
- LAPACK Users' Guide
- Nested Dissection of a Regular Finite Element Mesh
- On the Compression of Low Rank Matrices
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Sweeping preconditioner for the Helmholtz equation: hierarchical matrix representation
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The Role of Elimination Trees in Sparse Factorization
- Towards Stable Mixed Pivoting Strategies for the Sequential and Parallel Solution of Sparse Symmetric Indefinite Systems
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
Cited in
(21)- Mixed precision HODLR matrices
- Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides
- A new impedance accounting for short- and long-range effects in mixed substructured formulations of nonlinear problems
- An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
- Numerical generation of vector potentials from specified magnetic fields
- Truncated QR factorization with pivoting in mixed precision
- Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
- Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR^2 Format
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- HODLR2D: A New Class of Hierarchical Matrices
- scientific article; zbMATH DE number 6533779 (Why is no real title available?)
- Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic
- Solving block low-rank linear systems by LU factorization is numerically stable
- Improving multifrontal methods by means of block low-rank representations
- $HP$-Adaptive Celatus Enriched Discontinuous Galerkin Method for Second-Order Elliptic Source Problems
- A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error
- Structured Matrix Approximations via Tensor Decompositions
- HODLR3D: hierarchical matrices for N-body problems in three dimensions
This page was built for publication: On the complexity of the block low-rank multifrontal factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350445)
