论文信息 - Some implementations of multigrid linear system solvers

Some implementations of multigrid linear system solvers

In this paper portable and efficient FORTRAN implementations for the solution of linear systems by multigrid are described. They are based on ILUor ILLUrelaxation. Scalar and vector versions are compared. Also a complete formal description of a more general multigrid algorithm is given in ALGOL 68.

P. M. deZeeuw | P. W. Hemker | P. Hemker | P. deZeeuw

[1] J. E. Dendy. Black box multigrid for nonsymmetric problems , 1983 .

[2] Kristian Witsch,et al. Multigrid software for the solution of elliptic problems on rectangular domains: MGOO (release 1) , 1982 .

[3] P. Wesseling. A robust and efficient multigrid method , 1982 .

[4] Piet Hemker,et al. Multigrid methods for problems with a small parameter in the highest derivative , 1984 .

[5] P. M. deZeeuw,et al. A portable vector-code for autonomous multigrid modules , 1983 .

[6] Piet Hemker,et al. Multigrid methods: development of fast solvers , 1983 .

[7] Achi Brandt,et al. Vectorized multigrid poisson solver for the CDC cyber 205 , 1983 .

[8] Piet Hemker,et al. On the comparison of Line-Gauss-Seidel and ILU relaxation in multigrid algorithms , 1982 .

[9] R. Kettler. Analysis and comparison of relaxation schemes in robust multigrid and preconditioned conjugate gradient methods , 1982 .

[10] P. Wesseling. Theoretical and Practical Aspects of a Multigrid Method , 1982 .