ParMooN - 一种基于映射有限元的现代程序包
ParMooN - a modernized program package based on mapped finite elements
AI总结:
ParMooN基于映射有限元求解椭圆和抛物型偏微分方程,重点改进并行化以适应分布式内存环境,通过数值实验评估并行几何多网格预处理程序的效率。
摘要:
{\sc ParMooN}是一种用于求解椭圆和抛物型偏微分方程的程序包。它继承了其前代{\sc MooNMD}的特征:几何与有限元空间的严格解耦、映射有限元的实现方式如教科书所示,以及具有不同多网格层次上不同有限元空间选项的几何多网格预处理程序。在介绍了一些内部研究代码后,本文聚焦于为分布式内存环境的并行化改进,这是{\sc ParMooN}的主要创新点。在计算服务器上进行的数值研究评估了并行几何多网格预处理程序的效率,与库{\sc PETSc}中的某些并行求解器进行比较。这些研究结果提供了初步指示,以判断并行几何多网格方法的复杂实现是否值得。
英文摘要:
{\sc ParMooN} is a program package for the numerical solution of elliptic and parabolic partial differential equations. It inherits the distinct features of its predecessor {\sc MooNMD} \cite{JM04}: strict decoupling of geometry and finite element spaces, implementation of mapped finite elements as their definition can be found in textbooks, and a geometric multigrid preconditioner with the option to use different finite element spaces on different levels of the multigrid hierarchy. After having presented some thoughts about in-house research codes, this paper focuses on aspects of the parallelization for a distributed memory environment, which is the main novelty of {\sc ParMooN}. Numerical studies, performed on compute servers, assess the efficiency of the parallelized geometric multigrid preconditioner in comparison with some parallel solvers that are available in the library {\sc PETSc}. The results of these studies give a first indication whether the cumbersome implementation of the parallelized geometric multigrid method was worthwhile or not.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。