Sparse approximate multifrontal factorization with composite compression methods
From MaRDI portal
Cites work
- A bibliography on semiseparable matrices
- A distributed-memory algorithm for computing a heavy-weight perfect matching on bipartite graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A robust incompressible Navier-Stokes solver for high density ratio multiphase flows
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An adaptive, formally second order accurate version of the immersed boundary method
- Butterfly factorization
- Butterfly factorization via randomized matrix-vector multiplications
- Cholesky factorisation of linear systems coming from finite difference approximations of singularly perturbed problems
- Combining sparse approximate factorizations with mixed-precision iterative refinement
- Construction and arithmetics of \(\mathcal H\)-matrices
- Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1 M Unknowns
- Hierarchical matrices based on a weak admissibility criterion
- Improving multifrontal methods by means of block low-rank representations
- Interpolative butterfly factorization
- Interpolative Decomposition Butterfly Factorization
- LAPACK Users' Guide
- Numerical computing with IEEE floating point arithmetic. Incl. one theorem, one rule of thumb, and one hundred and one exercises
- Numerical Linear Algebra for High-Performance Computers
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
- Robust Numerical Methods for Singularly Perturbed Differential Equations
- Robust solution of singularly perturbed problems using multigrid methods
- Solving block low-rank linear systems by LU factorization is numerically stable
- Sparse approximate multifrontal factorization with butterfly compression for high-frequency wave equations
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
Cited in
(4)- Recursive sparse LU decomposition based on nested dissection and low rank approximations
- A linear-complexity tensor butterfly algorithm for compressing high-dimensional oscillatory integral operators
- Preconditioning a hybridizable discontinuous Galerkin method for Navier-Stokes at high Reynolds number
- Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation
This page was built for publication: Sparse approximate multifrontal factorization with composite compression methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601381)
