Generating Approximate Inverse Preconditioners for Sparse Matrices Using CUDA and GPGPU
The problem of numerical solution of sparse matrix-based linear systems arises from many scientific applications. Iterative solvers and corresponding preconditioning techniques are usually adopted. Due to the the irregularity in memory access patterns and undeterministic branching behavior of sparse...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2011-08-01
|
| Series: | Journal of Algorithms & Computational Technology |
| Online Access: | https://doi.org/10.1260/1748-3018.5.3.475 |