SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic
From MaRDI portal
Publication:5065492
DOI10.1137/20M1318808zbMath1492.65123arXiv1911.07531MaRDI QIDQ5065492
Ronald Kriemann, Sven Christophersen, Steffen Börm
Publication date: 22 March 2022
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07531
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65F99)
Related Items (1)
Uses Software
Cites Work
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Construction and arithmetics of \(\mathcal H\)-matrices
- Introduction to hierarchical matrices with applications.
- \(\mathcal H\)-LU factorization on many-core systems
- Algorithmic patterns for \(\mathcal {H}\)-matrices on many-core processors
- An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
- Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
- Hierarchical Matrices: Algorithms and Analysis
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- Hierarchical Matrix Operations on GPUs
- Improving Multifrontal Methods by Means of Block Low-Rank Representations
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Parallel black box $$\mathcal {H}$$ -LU preconditioning for elliptic boundary value problems
- Hierarchical matrix arithmetic with accumulated updates
This page was built for publication: SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic
