Le Borne, SabineSabineLe BorneOliveira, SuelySuelyOliveiraYang, FangFangYang2021-10-262021-10-262008-04-28Numerical Linear Algebra with Applications 15 (10): 911-924 (2008-12-01)http://hdl.handle.net/11420/10619Meshfree methods are suitable for solving problems on irregular domains, avoiding the use of a mesh. To deal with the boundary conditions, we can use Lagrange multipliers and obtain a sparse, symmetric and indefinite system of saddle-point type. Many methods have been developed to solve the indefinite system. Previously, we presented an algebraic method to construct an LU-based preconditioner for the saddle-point system obtained by meshfree methods, which combines the multilevel clustering method with the ℋ-matrix arithmetic. The corresponding preconditioner has both ℋ-matrix and sparse matrix subblocks. In this paper we refine the above method and propose a way to construct a pure ℋ-matrix preconditioner. We compare the new method with the old method, JOR and smoothed algebraic multigrid methods. The numerical results show that the new preconditioner outperforms the preconditioners based on the other methods. Copyright © 2008 John Wiley & Sons, Ltd.en1099-1506200810911924WileyAlgebraic multigridHierarchical matricesMeshfree methodMultilevel methodsSaddle-point systemsMathematikJournal Article10.1002/nla.599Other