Mixed-Precision GPU-Multigrid Solvers with Strong Smoothers

Mixed-Precision GPU-Multigrid Solvers with Strong Smoothers
复制标题

具有强大平滑器的混合精度 GPU 多重网格求解器

DOI:
10.1201/b10376-11
复制
发表时间:
2010
期刊:
Scientific Computing with Multicore and Accelerators
影响因子:
--
通讯作者:
R. Strzodka
R. Strzodka
中科院分区:
--
文献类型:
--
作者:
Dominik Göddeke;R. Strzodka

文献摘要

被引文献

相似文献

·稀疏迭代线性求解器是PDE问题(隐式)格式中最重要的构建模块·在FD、FV和FE离散化中·迄今为止,对Krylov子空间方法、ADI方法和多重网格的GPU进行了大量研究·但是:仅限于简单的预处理器和平滑算子·数值上强大的平滑器表现出固有的顺序数据依赖性(不可能并行化?)·实践中需要的强平滑器:各向异性(网格,算子),来自PDE的局部非线性等急剧增加系统的病态·多重网格是渐进最优的,所有其他迭代方案都受到h依赖性的影响·在我们的上下文中:多重网格=几何多重网格
• Sparse iterative linear solvers are the most important building block in (implicit) schemes for PDE problems • In FD, FV and FE discretisations • Lots of research on GPUs so far for Krylov subspace methods, ADI approaches and multigrid • But: Limited to simple preconditioners and smoothing operators •Numerically strong smoothers exhibit inherently sequential data dependencies (impossible to parallelise?) • Strong smoothers required in practice: Anisotropies (mesh, operator), localised nonlinearities from the PDEs etc. increase ill-conditioning of the systems drastically •Multigrid is asymptotically optimal, all other iterative schemes suffer from h-dependencies • In our context: Multigrid = geometric multigrid