9 papers
Randomized Sketching is Robust to Low-Precision Rounding on GPUs
Aryaman Jeendgar, Clément Flint, Hartwig Anzt
Randomized sketching is a core primitive in randomized numerical linear algebra. On modern hardware architectures, in particular on GPUs, the performance of sparse sketches is limi…
Permutation-Avoiding FFT-Based Convolution
Nicolas Venkovic, Hartwig Anzt
Fast Fourier Transform (FFT) libraries are widely used for evaluating discrete convolutions. Most FFT implementations follow some variant of the Cooley-Tukey framework, in which th…
Global iterative methods for sparse approximate inverses of symmetric positive definite matrices
Nicolas Venkovic, Hartwig Anzt
This work is motivated by symmetric positive definite (SPD) matrices for which the best sparse approximate inverse (SPAI) with the prescribed nonzero pattern of for some mode…
Mixed precision multigrid with smoothing based on incomplete Cholesky factorization
Petr Vacek, Hartwig Anzt, Erin Carson +3
Multigrid methods are popular iterative methods for solving large-scale sparse systems of linear equations. We present a mixed precision formulation of the multigrid V-cycle method…
A BDDC Preconditioner for the Cardiac EMI Model in three Dimensions
Fritz Goebel, Ngoc Mai Monica Huynh, Fatemeh Chegini +4
We analyze a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the solution of three dimensional composite Discontinuous Galerkin discretizations of reaction-…
Investigating Matrix Repartitioning to Address the Over- and Undersubscription Challenge for a GPU-based CFD Solver
Gregor Olenik, Marcel Koch, Hartwig Anzt
Modern high-performance computing (HPC) increasingly relies on GPUs, but integrating GPU acceleration into complex scientific frameworks like OpenFOAM remains a challenge. Existing…