Efficient structured multifrontal factorization for general large sparse matrices
From MaRDI portal
Recommendations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Improving multifrontal methods by means of block low-rank representations
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
Cited in
(52)- Hierarchical orthogonal factorization: sparse least squares problems
- A class of iterative solvers for the Helmholtz equation: factorizations, sweeping preconditioners, source transfer, single layer potentials, polarized traces, and optimized Schwarz methods
- On updating the structure of sparse matrix factors
- An O(N) algorithm for constructing the solution operator to 2D elliptic boundary value problems in the absence of body loads
- A Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity
- A survey of direct methods for sparse linear systems
- Distributed-memory hierarchical interpolative factorization
- A distributed-memory randomized structured multifrontal method for sparse direct solutions
- Superfast divide-and-conquer method and perturbation analysis for structured eigenvalue solutions
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- A robust multilevel approximate inverse preconditioner for symmetric positive definite matrices
- Interconnected hierarchical structures for fast direct elliptic solution
- An MSSS-preconditioned matrix equation approach for the time-harmonic elastic wave equation at multiple frequencies
- Existence of $\mathcal {H}$-matrix approximants to the inverses of BEM matrices: The simple-layer operator
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Efficient preconditioning of \(h p\)-FEM matrix sequences with slowly-varying coefficients: an application to topology optimization
- On the complexity of the block low-rank multifrontal factorization
- A Power Schur Complement Low-Rank Correction Preconditioner for General Sparse Linear Systems
- \(\mathcal {H}\)-matrix approximability of the inverses of FEM matrices
- Performance study of hierarchical semi-separable compression solver for parabolic problems with space-fractional diffusion
- A robust randomized indicator method for accurate symmetric eigenvalue detection
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations
- Hierarchical interpolative factorization for elliptic operators: integral equations
- Low-rank improvements of two-level grid preconditioned matrices
- On the stability of some hierarchical rank structured matrix algorithms
- Bridging the gap between flat and hierarchical low-rank matrix formats: the multilevel block low-rank format
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems
- Fast structured LU factorization for nonsymmetric matrices
- An algebraic multifrontal preconditioner that exploits the low-rank property.
- Effective matrix-free preconditioning for the augmented immersed interface method
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- Improving multifrontal methods by means of block low-rank representations
- A direct solver for elliptic PDEs in three dimensions based on hierarchical merging of Poincaré-Steklov operators
- Intrinsic Complexity and Scaling Laws: From Random Fields to Random Vectors
- A parallel geometric multifrontal solver using hierarchically semiseparable structure
- Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- A fast contour-integral eigensolver for non-Hermitian matrices
- Fast sparse selected inversion
- Fast Factorization Update for General Elliptic Equations Under Multiple Coefficient Updates
- A fast block low-rank dense solver with applications to finite-element matrices
- A fast memory efficient construction algorithm for hierarchically semi-separable representations
- Randomized sparse direct solvers
- scientific article; zbMATH DE number 440639 (Why is no real title available?)
- A technique for updating hierarchical skeletonization-based factorizations of integral operators
- \({\mathscr{H}} \)-matrix approximability of inverses of discretizations of the fractional Laplacian
- Hierarchical orthogonal factorization: sparse square matrices
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Multi-layer hierarchical structures
This page was built for publication: Efficient structured multifrontal factorization for general large sparse matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300120)
