Parallel Triangular Solvers on GPU

06/02/2016
by   Zhangxin Chen, et al.
0

In this paper, we investigate GPU based parallel triangular solvers systematically. The parallel triangular solvers are fundamental to incomplete LU factorization family preconditioners and algebraic multigrid solvers. We develop a new matrix format suitable for GPU devices. Parallel lower triangular solvers and upper triangular solvers are developed for this new data structure. With these solvers, ILU preconditioners and domain decomposition preconditioners are developed. Numerical results show that we can speed triangular solvers around seven times faster.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2016

Development of Krylov and AMG linear solvers for large-scale sparse matrices on GPUs

This research introduce our work on developing Krylov subspace and AMG s...
research
08/16/2021

On the performance of GPU accelerated q-LSKUM based meshfree solvers in Fortran, C++, Python, and Julia

This report presents a comprehensive analysis of the performance of GPU ...
research
04/24/2023

Matrix-free GPU-accelerated saddle-point solvers for high-order problems in H(div)

This work describes the development of matrix-free GPU-accelerated solve...
research
10/22/2022

torchode: A Parallel ODE Solver for PyTorch

We introduce an ODE solver for the PyTorch ecosystem that can solve mult...
research
03/09/2021

Exploiting Asynchronous Priority Scheduling in Parallel Eikonal Solvers

Numerical solutions to the Eikonal equation are computed using variants ...
research
07/12/2021

Parallel Element-based Algebraic Multigrid for H(curl) and H(div) Problems Using the ParELAG Library

This paper presents the use of element-based algebraic multigrid (AMGe) ...
research
05/27/2022

A New Semi-Structured Algebraic Multigrid Method

Multigrid methods are well suited to large massively parallel computer a...

Please sign up or login with your details

Forgot password? Click here to reset