Volume 26 Issue 3
May  2001
Turn off MathJax
Article Contents
LUO Tie-xiang, 2001. DISTRIBUTED MULTIGRID COMPUTATION WITH DOMAIN DECOMPOSITION. Earth Science, 26(3): 323-327.
Citation: LUO Tie-xiang, 2001. DISTRIBUTED MULTIGRID COMPUTATION WITH DOMAIN DECOMPOSITION. Earth Science, 26(3): 323-327.

DISTRIBUTED MULTIGRID COMPUTATION WITH DOMAIN DECOMPOSITION

  • Received Date: 2000-05-10
  • Publish Date: 2001-05-25
  • This paper presents the distributed multigrid computation. The sequential algorithm is expressed in a non recursive form. The parallel algorithm is achieved based on domain decomposition. Mesh topology architectures are organized with multiple transputers. Parallel algorithms are mapped onto processes, increasing markedly, to some extent, the speed and efficiency of parallelization.

     

  • loading
  • [1]
    McCormick S F. Mult-igrid methods[M]. SIAM: Philadelphia, 1987.
    [2]
    Hackbusch W. Multigrid algorithms. Introduction, survey and convergence analysis[A]. In: Spedicato E, ed. Computer algorithms for solving linear algebraic equations[C]. The State of the Art: Springer-Verlag, 1990.133160.
    [3]
    Xu Z Q. Distributing mult-igrid computation on a message passing system[D]. Wuhan: Huazhong University of Science and Technology, 1993.
    [4]
    Xu Z Q, Libert G. Non-recursive multigrid computation on transputers[A]. In: Veronis A M, Paker Y, eds. Transputer research and applications 5[C]. Amsterdam: IOS Press, 1992.302309.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(9)  / Tables(1)

    Article views (3503) PDF downloads(4) Cited by()
    Proportional views

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return