A New Quasi-Unsymmetric Sparse Linear Systems Solver for Meshless Local Petrov-Galerkin Method (MLPG)
Weiran Yuan; Pu Chen; and Kaishin Liu

Source CMES: Computer Modeling in Engineering & Sciences, Vol. 17, No. 2, pp. 115-134, 2007
Download Full length paper in PDF format. Size = 341,385 bytes
Abstract In this paper we propose a direct solution method for the quasi-unsymmetric sparse matrix (QUSM) arising in the Meshless Local Petrov-Galerkin method (MLPG). QUSM, which is conventionally treated as a general unsymmetric matrix, is unsymmetric in its numerical values, but nearly symmetric in its nonzero distribution of upper and lower triangular portions. MLPG employs trial and test functions in different functional spaces in the local domain weak form of governing equations. Consequently the stiffness matrix of the resultant linear system is a QUSM. The new solver for QUSM conducts a two-level unrolling technique for {LDU} factorization method and can be implemented without great effort by porting a symmetric matrix factorization code. Besides, a blocked out-of-core strategy is also developed to expand the solution scale. The proposed approach convincingly increases the efficiency of MLPG, as we demonstrate.
PDF download PDF