Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
From MaRDI portal
Publication:5147979
DOI10.1137/20M1315683zbMath1461.65033arXiv1907.03406MaRDI QIDQ5147979
Bazyli Klockiewicz, Eric Darve
Publication date: 29 January 2021
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.03406
preconditionerlow-rank approximationhierarchical factorizationsparse linear solversmooth eigenvectors
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Preconditioners for iterative methods (65F08)
Related Items
Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems, Hierarchical Orthogonal Factorization: Sparse Square Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices
- Rang revealing QR factorizations
- Approximation of solution operators of elliptic partial differential equations by \({\mathcal H}\)- and \({\mathcal H}^2\)-matrices
- Matrix computations.
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Elimination of rigid body modes from discretized boundary integral equations
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
- A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling
- Hierarchical matrix approximation with blockwise constraints
- Domain decomposition based \({\mathcal H}\)-LU preconditioning
- Distributed-memory hierarchical interpolative factorization
- On the Numerical Rank of the Off-Diagonal Blocks of Schur Complements of Discretized Elliptic PDEs
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LAPACK Users' Guide
- Generalized Nested Dissection
- Highly Parallel Sparse Cholesky Factorization
- Iterative Methods by Space Decomposition and Subspace Correction
- Solution of Sparse Indefinite Systems of Linear Equations
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- A class of first order factorization methods
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- An improved incomplete Cholesky factorization
- ``Compress and Eliminate” Solver for Symmetric Positive Definite Sparse Matrices
- Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
- Efficient inversion of the Galerkin matrix of general second-order elliptic operators with nonsmooth coefficients
- ILUT: A dual threshold incomplete LU factorization
- An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
- Nested Dissection of a Regular Finite Element Mesh
- A Recursive Skeletonization Factorization Based on Strong Admissibility
- The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems
- Fast Hierarchical Solvers For Sparse Matrices Using Extended Sparsification and Low-Rank Approximation
- On the spectral equivalence of hierarchical matrix preconditioners for elliptic problems
- Methods of conjugate gradients for solving linear systems
- A review of algebraic multigrid
- PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
