Recursive sparse LU decomposition based on nested dissection and low rank approximations
From MaRDI portal
Cites work
- H^2-matrix approximation of integral operators by interpolation
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast algorithm for particle simulations
- A fast and robust solver for the scattering from a layered periodic structure containing multi-particle inclusions
- A fast block low-rank dense solver with applications to finite-element matrices
- A fast direct solver for high frequency scattering from a large cavity in two dimensions
- A recursive skeletonization factorization based on strong admissibility
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- Direct Methods for Sparse Linear Systems
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- Fast inverse elastic scattering of multiple particles in three dimensions
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized Nested Dissection
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hierarchical interpolative factorization for elliptic operators: differential equations
- Hierarchical matrices: algorithms and analysis
- scientific article; zbMATH DE number 3827200 (Why is no real title available?)
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- ILUT: A dual threshold incomplete LU factorization
- Nested Dissection of a Regular Finite Element Mesh
- On the Compression of Low Rank Matrices
- Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
- Rapid solution of integral equations of scattering theory in two dimensions
- SlabLU: a two-level sparse direct solver for elliptic PDEs
- Sparse approximate multifrontal factorization with composite compression methods
- The Evolution of the Minimum Degree Ordering Algorithm
- The Use of Linear Graphs in Gauss Elimination
This page was built for publication: Recursive sparse LU decomposition based on nested dissection and low rank approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6923333)