An algebraic multifrontal preconditioner that exploits the low-rank property.
From MaRDI portal
(Redirected from Publication:5739752)
Recommendations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Improving multifrontal methods by means of block low-rank representations
- An algebraic multilevel preconditioner with low-rank corrections for sparse symmetric matrices
- Multicolor low-rank preconditioner for general sparse linear systems.
- IMF: an incomplete multifrontal \(LU\)-factorization for element-structured sparse linear systems
Cites work
- A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations
- A fast adaptive solver for hierarchically semiseparable representations
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A supernodal approach to incomplete LU factorization with partial pivoting
- An aggregation-based algebraic multigrid method
- An algebraic multigrid method with guaranteed convergence rate
- An overview of SuperLU
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices
- Conditioning analysis of incomplete Cholesky factorizations with orthogonal dropping
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- 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 structured LU factorization for nonsymmetric matrices
- Generalized Nested Dissection
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- 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 Rank-Revealing Factorisations
- On the numerical rank of the off-diagonal blocks of Schur complements of discretized elliptic PDEs
- Pivoting strategies for tough sparse indefinite systems
- Rang revealing QR factorizations
- Superfast Multifrontal Method for Large Structured Linear Systems of 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
- Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
Cited in
(9)- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite-element matrices
- Matrices with hierarchical low-rank structures
- IMF: an incomplete multifrontal \(LU\)-factorization for element-structured sparse linear systems
- A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
- Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- An Incomplete Cholesky Preconditioner Based on Orthogonal Approximations
- Sparse hierarchical solvers with guaranteed convergence
This page was built for publication: An algebraic multifrontal preconditioner that exploits the low-rank property.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739752)
