A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Iterative Sparse Triangular Solves for Preconditioning
[chapter]
2015
Lecture Notes in Computer Science
Sparse triangular solvers are typically parallelized using levelscheduling techniques, but parallel efficiency is poor on high-throughput architectures like GPUs. We propose using an iterative approach for solving sparse triangular systems when an approximation is suitable. This approach will not work for all problems, but can be successful for sparse triangular matrices arising from incomplete factorizations, where an approximate solution is acceptable. We demonstrate the performance gains
doi:10.1007/978-3-662-48096-0_50
fatcat:k4p5ysqnhza3djruia4kvsc5j4