2002Unpublished venueRequires access

Efficient implementation of the multigrid preconditioned conjugate gradient method on distributed memory machines

O. Tatebe, Y. Oyanagi

Open publisher page 10 citations

Abstract

A multigrid preconditioned conjugate gradient (MGCG) method, which uses the multigrid method as a preconditioner for the conjugate gradient method, has a good convergence rate even for problems on which the standard multigrid method does not converge efficiently. This paper considers a parallelization of the MGCG method and proposes an efficient parallel MGCG method on distributed memory machines. For a good convergence rate of the MGCG method, several difficulties in parallelizing the multigrid method are successfully settled. It is also shown that the parallel MGCG method has high performance on the Fujitsu AP1000 multicomputer, and it is more than 10 times faster than the scaled conjugate gradient (SCG) method.>

About this research paper

What this paper is about

A multigrid preconditioned conjugate gradient (MGCG) method, which uses the multigrid method as a preconditioner for the conjugate gradient method, has a good convergence rate even for problems on which the standard multigrid method does not converge efficiently. This paper considers a parallelization of the MGCG method and proposes an efficient parallel MGCG method on distributed memory machines. For a good convergence rate of the MGCG method, several difficulties in parallelizing the multigrid method are successfully settled. It is also shown that the parallel MGCG method has high performance on the Fujitsu AP1000 multicomputer, and it is more than 10 times faster than the scaled conjugate gradient (SCG) method.>

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A multigrid preconditioned conjugate gradient (MGCG) method, which uses the multigrid method as a preconditioner for the conjugate gradient method, has a good convergence rate even for problems on which the standard multigrid method does not converge efficiently. This paper considers a parallelization of the MGCG method and proposes an efficient parallel MGCG method on distributed memory machines. For a good convergence rate of the MGCG method, several difficulties in parallelizing the multigrid method are successfully settled. It is also shown that the parallel MGCG method has high performance on the Fujitsu AP1000 multicomputer, and it is more than 10 times faster than the scaled conjugate gradient (SCG) method.>

Key concepts: Conjugate gradient method, Multigrid method, Preconditioner, Computer science, Conjugate residual method, Convergence (economics), Rate of convergence, Conjugate

Related papers

Back to paper searchBrowse research topicsOriginal source
Efficient implementation of the multigrid preconditioned conjugate gradient method on distributed memory machines — Research Paper | ScholarLens