Analysis of Parallel Preconditioned Conjugate Gradient Algorithms
Copyright policy )Analysis of Parallel Preconditioned Conjugate Gradient Algorithms
Summary: The conjugate gradient method is an iterative technique used to solve systems of linear equations. The paper analyzes the performance of parallel preconditioned conjugate gradient (PPCG) algorithms. First, a theoretical model is proposed for the estimation of the complexity of the PPCG method and a scalability analysis is done for three different data decomposition cases. Computational experiments are done on the IBM SP4 computer and some results are presented. It is shown that theoretical predictions agree well with computational results.
- Vilnius Gediminas Technical University Lithuania
Iterative numerical methods for linear systems, Complexity and performance of numerical algorithms, Parallel numerical computation, incomplete factorization, scalability analysis
Iterative numerical methods for linear systems, Complexity and performance of numerical algorithms, Parallel numerical computation, incomplete factorization, scalability analysis
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!