A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices
From MaRDI portal
Publication:2952959
DOI10.1002/nme.5196zbMath1352.65451OpenAlexW2266501471MaRDI QIDQ2952959
AmirHossein Aminfar, Eric Darve
Publication date: 30 December 2016
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.5196
Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Preconditioners for iterative methods (65F08)
Related Items
Efficient preconditioning of \(hp\)-FEM matrices by hierarchical low-rank approximations, ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices, On the Complexity of the Block Low-Rank Multifrontal Factorization, Matrices with Hierarchical Low-Rank Structures, Bridging the Gap Between Flat and Hierarchical Low-Rank Matrix Formats: The Multilevel Block Low-Rank Format, Parallel accelerated cyclic reduction preconditioner for three-dimensional elliptic PDEs with variable coefficients, Efficient preconditioning of \(h p\)-FEM matrix sequences with slowly-varying coefficients: an application to topology optimization, A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- A fast direct solver for elliptic problems on general meshes in 2D
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A theory of pseudoskeleton approximations
- Construction and arithmetics of \(\mathcal H\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic: General complexity estimates
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A fast block low-rank dense solver with applications to finite-element matrices
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- FETI-DP: a dual-primal unified FETI method?part I: A faster alternative to the two-level FETI method
- FETI-DP, BDDC, and block Cholesky methods
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
- Separators for sphere-packings and nearest neighbor graphs
- ILUT: A dual threshold incomplete LU factorization
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- Randomized Sparse Direct Solvers
- Fast monte-carlo algorithms for finding low-rank approximations
- A Fast Solver for HSS Representations via Sparse Matrices
- Nested Dissection of a Regular Finite Element Mesh
- Methods of conjugate gradients for solving linear systems
