Semi-automatic sparse preconditioners for high-order finite element methods on non-uniform meshes

详细信息	查看全文 | 推荐本文 |

• 作者：Travis M. Austin^a ; Marian Brezina^b ; Ben Jamroz^a ; Chetan Jhurani^a ; ^{jhurani@txcorp.com} ; Thomas A. Manteuffel^b ; John Ruge^b
• 关键词：High-order ; Algebraic multigrid ; Preconditioners
• 刊名：Journal of Computational Physics
• 出版年：2012
• 期刊代码：136_00219991
• 类别：cp
• 出版时间：20 May, 2012
• 卷：231
• 期：14
• 页码：4694-4708
• 文件大小：1455 K

摘要

High-order finite elements often have a higher accuracy per degree of freedom than the classical low-order finite elements. However, in the context of implicit time-stepping methods, high-order finite elements present challenges to the construction of efficient simulations due to the high cost of inverting the denser finite element matrix. There are many cases where simulations are limited by the memory required to store the matrix and/or the algorithmic components of the linear solver. We are particularly interested in preconditioned Krylov methods for linear systems generated by discretization of elliptic partial differential equations with high-order finite elements. Using a preconditioner like Algebraic Multigrid can be costly in terms of memory due to the need to store matrix information at the various levels. We present a novel method for defining a preconditioner for systems generated by high-order finite elements that is based on a much sparser system than the original high-order finite element system. We investigate the performance for non-uniform meshes on a cube and a cubed sphere mesh, showing that the sparser preconditioner is more efficient and uses significantly less memory. Finally, we explore new methods to construct the sparse preconditioner and examine their effectiveness for non-uniform meshes. We compare results to a direct use of Algebraic Multigrid as a preconditioner and to a two-level additive Schwarz method.