Sparse matrix solvers on the GPU: conjugate gradients and multigrid

368 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

GPU Computing (2008, background): “[18]) and level set equations for volume segmentation [19].”
Poisson image editing (2003, result): “As demonstrated in [Bolz et al 2003], multi-grid implementation on a GPU will provide a solution for much larger regions.”
GPU-accelerated preconditioned iterative linear solvers (2013, background): “The potential of GPUs for parallel sparse matrix computations was recognized early on when GPU programming required shader languages [7].”
All-frequency shadows using non-linear wavelet lighting approximation (2003, methodology): “Graphics hardware has evolved to support some forms of sparse matrix-vector multiplication [Bolz et al. 2003], but it is not clearly general enough to support our algorithm efficiently because we exploit sparsity in both L and T .”
Linear algebra operators for GPU implementation of numerical algorithms (2003, methodology): “2002], multi-grid simulation techniques [Bolz et al. 2003] and numerical solution techniques to least squares problems [Hillesland et al.”
To appear in the ACM SIGGRAPH conference proceedings Modular Bases for Fluid Dynamics (neutral): “2005], pressure projection [Krüger and Westermann 2003; Bolz et al. 2003; Goodnight et al. 2003], Lattice Boltzmann methods [Li et al.”
Poisson surface reconstruction (2006, background): “Multigrid Poisson solutions have even been adapted for efﬁ-cient GPU computation [BFGS03,GWL ∗ 03].”