返回
Parallel solvers for spline collocation equations
DOI:10.1016/0965-9978(96)00019-1.png)
摘要
En 中文
A variety of solvers for the spline collocation equations arising from the discretisation of elliptic partial differential equations (PDEs) are considered. The convergence properties of semi-iterative and Krylov subspace acceleration methods applied to the system of spline collocation equations are studied. The preconditioners tested include incomplete factorisation and SSOR for both the natural and multicolour orderings, domain decomposition based on Schur complement methods with nonoverlapping subdomains, or Schwarz methods with overlapping subdomains, and multigrid methods. The parallelisation of some of the above iterative methods is studied and their advantages and disadvantages discussed. The communication requirements of the methods are discussed when the methods are implemented on distributed memory machines. Results which show that spline collocation methods are very competitive for the solution of PDEs are presented. Copyright (C) 1996 Civil-Comp Limited and Elsevier Science Limited
Keyword:
elliptic partial differential equations
iterative methods
domain decomposition
distributed memory machines
期刊
IF:
5.7
论文数:
3.4K
被引数:
1.2W
机构
暂无机构信息
引用论文
Flowers, phenology and pollination of the endemic New Zealand greenhood orchidPterostylis brumalis新西兰特有绿唇兰Pterostylis brumalis的花朵、物候学和传粉。
Structural and electronic properties for Be-doped Ptn (n = 1–12) clusters obtained by DFT calculationsBe掺杂Ptn (n = 1–12)团簇的结构和电子性质通过DFT计算获得
Morphology Studies on Mechanically Milled Aluminium Reinforced with B4C and CNTs机械球磨铝基体与B4C和CNTs增强复合材料的形貌研究
Silicon
IF0

