.png){kind=icon}
Return
GPU-based parallel algorithms for sparse nonlinear systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2011.10.016.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work we describe some parallel algorithms for solving nonlinear systems using CUDA (Compute Unified Device Architecture) over a CPU (Graphics Processing Unit). The proposed algorithms are based on both the Fletcher-Reeves version of the nonlinear conjugate gradient method and a polynomial preconditioner type based on block two-stage methods. Several strategies of parallelization and different storage formats for sparse matrices are discussed. The reported numerical experiments analyze the behavior of these algorithms working in a fine grain parallel environment compared with a thread-based environment. (C) 2011 Elsevier Inc. All rights reserved.
Keywords:
GPGPU
GPU libraries
Multicore architectures
Nonlinear conjugate gradient algorithms
Parallel preconditioners
Bratu problem
Journal
IF:
4
Papers:
3.8K
Citations:
4.8K
Organization
Cited Papers
ShareSaveHydrogen Bond Effect on the Raman Shift of theCarbonyl Stretching Mode of Various Amide Solutions
PREAI
ShareSaveShareSaveThe Influence of New and Old Energy Labels on Consumer Judgements and Decisions about Household Appliances.png)
Energies
OAAI
EnergiesIF0
OAAIShareSaveShareSaveAn analytical investigation on the interactions between a squeezed and a coherent optical signalOptik
OptikIF0
PREAI
ShareSave
ShareSave
View more