Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices

Publication date: 28 April 2021

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.07632

zbMATH Keywords

kernel matrix symmetric positive definite preconditioner $\mathcal{H}^2$ matrix representation HSS matrix representation

Mathematics Subject Classification ID

Preconditioners for iterative methods (65F08) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (3)

Overlapping Domain Decomposition Preconditioner for Integral Equations ⋮ Robust and Effective eSIF Preconditioning for General Dense SPD Matrices ⋮ Sparse Cholesky Factorization by Kullback--Leibler Minimization

Uses Software

STRUMPACK
H2Pack

Cites Work

Unnamed Item
Unnamed Item
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
A sparse matrix arithmetic based on ${\mathfrak H}$-matrices. I: Introduction to ${\mathfrak H}$-matrices
Data-sparse approximation by adaptive ${\mathcal H}^2$-matrices
A sparse ${\mathcal H}$-matrix arithmetic. II: Application to multi-dimensional problems
Recursively preconditioned hierarchical interpolative factorization for elliptic partial differential equations
A case study competition among methods for analyzing large spatial data
An $\mathcal O(N\log N)$ fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
Fast algorithms for hierarchically semiseparable matrices
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
Effectiveness and robustness revisited for a preconditioning technique based on structured incomplete factorization
Factorized Sparse Approximate Inverse Preconditionings I. Theory
Effective and Robust Preconditioning of General SPD Matrices via Structured Incomplete Factorization
Preserving Positive Definiteness in Hierarchically Semiseparable Matrix Approximations
A Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Interpolative Decomposition via Proxy Points for Kernel Matrices
Solving PDEs with radial basis functions
Butterfly Factorization
A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
The Inverse Fast Multipole Method: Using a Fast Approximate Direct Solver as a Preconditioner for Dense Linear Systems
Butterfly Factorization Via Randomized Matrix-Vector Multiplications
A fast algorithm for particle simulations

This page was built for publication: Efficient Construction of an HSS Preconditioner for Symmetric Positive Definite $\mathcal{H}^2$ Matrices