The Frequency Decomposition Multi-Grid Algorithm
暂无分享,去创建一个
Multi-grid methods are known as very fast solvers of a large class of discretised partial differential equations. However, the multi-grid method cannot be understood as a fixed algorithm. Usually, the components of the multi-grid iteration have to be adapted to the given problem and sometimes the problems are modified into those acceptable for multi-grid methods. In particular, the smoothing iteration is the most delicate part of the multi-grid process.
[1] P. Wesseling. Theoretical and Practical Aspects of a Multigrid Method , 1982 .
[2] Wolfgang Hackbusch,et al. Multi-grid methods and applications , 1985, Springer series in computational mathematics.
[3] G. Wittum. On the Robustness of ILU Smoothing , 1989 .
[4] Paul O. Frederickson,et al. Parallel Superconvergent Multigrid , 1987 .
[5] K. Stüben,et al. Multigrid methods: Fundamental algorithms, model problem analysis and applications , 1982 .