A guide for implementing tridiagonal solvers on GPUs
From MaRDI portal
Publication:5261391
DOI10.1007/978-3-319-06548-9_2zbMATH Open1317.65076OpenAlexW189428928MaRDI QIDQ5261391FDOQ5261391
Authors: Li-Wen Chang, Wen-Mei W. Hwu 
Publication date: 3 July 2015
Published in: Numerical Computations with GPUs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06548-9_2
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
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cited In (8)
- \texttt{PittPack}: an open-source Poisson's equation solver for extreme-scale computing with accelerators
- Solving Large Problem Sizes of Index-Digit Algorithms on GPU: FFT and Tridiagonal System Solvers
- Alternating direction implicit time integrations for finite difference acoustic wave propagation: parallelization and convergence
- Tree partitioning reduction: a new parallel partition method for solving tridiagonal systems
- A flexible CUDA LU-based solver for small, batched linear systems
- A fast dense triangular solve in CUDA
- Redesigning triangular dense matrix computations on GPUs
- Manycore algorithms for batch scalar and block tridiagonal solvers
Uses Software
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)
