On the Complexity of the Block Low-Rank Multifrontal Factorization
From MaRDI portal
Publication:5350445
DOI10.1137/16M1077192zbMath1372.65089OpenAlexW2731353277MaRDI QIDQ5350445
Alfredo Buttari, Theo A. Mary, Patrick R. Amestoy, Jean-Yves L'Excellent
Publication date: 1 September 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1077192
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Structured Matrix Approximations via Tensor Decompositions, Numerical generation of vector potentials from specified magnetic fields, An efficient preconditioned variant of the PSS preconditioner for generalized saddle point problems, HODLR2D: A New Class of Hierarchical Matrices, Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides, Bridging the Gap Between Flat and Hierarchical Low-Rank Matrix Formats: The Multilevel Block Low-Rank Format, A New Preconditioner that Exploits Low-Rank Approximations to Factorization Error, Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems, $HP$-Adaptive Celatus Enriched Discontinuous Galerkin Method for Second-Order Elliptic Source Problems, Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic, Block Low-Rank Matrices with Shared Bases: Potential and Limitations of the BLR$^2$ Format
Uses Software
Cites Work
- Unnamed Item
- A direct solver with \(O(N)\) complexity for integral equations on one-dimensional domains
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Construction and arithmetics of \(\mathcal H\)-matrices
- Introduction to hierarchical matrices with applications.
- Hierarchical matrices based on a weak admissibility criterion
- A fast block low-rank dense solver with applications to finite-element matrices
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- A Symmetry Preserving Algorithm for Matrix Scaling
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
- Fast algorithms for hierarchically semiseparable matrices
- Sweeping preconditioner for the Helmholtz equation: Hierarchical matrix representation
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- 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
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- LAPACK Users' Guide
- A New Implementation of Sparse Gaussian Elimination
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- On the Compression of Low Rank Matrices
- Nested Dissection of a Regular Finite Element Mesh
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
