A guide for implementing tridiagonal solvers on GPUs
From MaRDI portal
Recommendations
- Manycore algorithms for batch scalar and block tridiagonal solvers
- An efficient GPU implementation of cyclic reduction solver for high-order compressible viscous flow simulations
- A fast dense triangular solve in CUDA
- Redesigning triangular dense matrix computations on GPUs
- Speedup of tridiagonal system solvers
Cited in
(8)- Redesigning triangular dense matrix computations on GPUs
- Alternating direction implicit time integrations for finite difference acoustic wave propagation: parallelization and convergence
- A fast dense triangular solve in CUDA
- Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers
- Tree partitioning reduction: a new parallel partition method for solving tridiagonal systems
- A flexible CUDA LU-based solver for small, batched linear systems
- Manycore algorithms for batch scalar and block tridiagonal solvers
- \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators
This page was built for publication: A guide for implementing tridiagonal solvers on GPUs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261391)