Iterative algorithm for complex linear equations of symmetric positive definite sparse matrices based on GPU

DOI10.13413/J.CNKI.JDXBLXB.2016.02.26MaRDI QIDQ2990574zbMATH OpenFDO

Authors Weiwei Li

Publication date 10 August 2016

zbMATH Keywords

sparse matricesnumerical examplesalgorithmparallel computationconjugate gradient methoditerative methodGPU computingcomplex linear equationincomplete Cholesky decomposition

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10)

Recommendations

• Accelerating preconditioned iterative linear solvers on GPU
• A factored sparse approximate inverse preconditioned conjugate gradient solver on graphics processing units
• Parallel preconditioned conjugate gradient algorithm on GPU
• Minimal residual based iterative methods and its parallel implementation for sparse linear systems
• GPU computing with Kaczmarz's and other iterative algorithms for linear systems

Cited in

(3)

• Minimal residual based iterative methods and its parallel implementation for sparse linear systems
• Research of multicore-based parallel GaBP algorithm with dynamic load-balance
• GPU computing with Kaczmarz's and other iterative algorithms for linear systems

This page was built for publication: Iterative algorithm for complex linear equations of symmetric positive definite sparse matrices based on GPU

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2990574)