The application of simultaneous elimination and back-substitution method (SEBSM) in finite element method

Purpose The purpose of this paper is to introduce a new method called simultaneous elimination and back-substitution method (SEBSM) to solve a system of linear equations as a new finite element method (FEM) solver. Design/methodology/approach In this paper, a new technique assembling the global stiffness matrix will be proposed and meanwhile the direct method SEBSM will be applied to solve the equations formed in FEM. Findings The SEBSM solver for FEM with the present assembling technique has distinct advantages in both computational time and memory space occupation over the conventional methods, such as the Gauss elimination and LU decomposition methods. Originality/value The developed solver requires less memory space no matter the coefficient matrix is a typical sparse matrix or not, and it is applicable to both symmetric and unsymmetrical linear systems of equations. The processes of assembling matrix and dealing with constraints are straightforward, so it is convenient for coding. Compared to the previous solvers, the proposed solver has favorable universality and good performances.

[1]  G. Strang.  Introduction to Linear Algebra , 1993 .

[2]  Yu-Jun Liu,et al.  A New Version of the Accelerated Overrelaxation Iterative Method , 2014, J. Appl. Math..

[3]  G. Ronald Hadley,et al.  A complex Jacobi iterative method for the indefinite Helmholtz equation , 2005 .

[5]  Jacek Kitowski,et al.  Towards Green Multi-frontal Solver for Adaptive Finite Element Method , 2015, ICCS.

[6]  Åke Björck,et al.  Numerical Methods , 2021, Markov Renewal and Piecewise Deterministic Processes.

[7]  J. Z. Zhu,et al.  The finite element method , 1977 .

[9]  Keshav Pingali,et al.  Graph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler , 2014, ICCS.

[10]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[11]  Rajat Mittal,et al.  Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation , 2014, J. Comput. Phys..

[12]  Bruce M. Irons,et al.  A frontal solution program for finite element analysis , 1970 .

[13]  Gui-Rong Liu,et al.  A novel reduced-basis method with upper and lower bounds for real-time computation of linear elasticity problems , 2008 .

[14]  D. Owen,et al.  Finite elements in plasticity : theory and practice , 1980 .

[15]  Anna Paszynska,et al.  Hypergrammar Based Parallel Multi-frontal Solver for Grids with Point singularities , 2015, Comput. Sci..

[16]  S. J. Salon,et al.  Introduction to Finite Elements , 1995 .

[17]  M. A. Crisfield,et al.  Finite elements in plasticity—theory and practice, D. R. J. Owen and E. Hinton, Pineridge Press, Swansea , 1981 .

[18]  Tg Davies,et al.  Boundary Element Programming in Mechanics , 2002 .

[19]  P. Castillo,et al.  An acceleration technique for the Gauss-Seidel method applied to symmetric linear systems , 2014 .

[20]  Richard Barrett,et al.  Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[21]  Esmond G. Ng,et al.  On the Minimum FLOPs Problem in the Sparse Cholesky Factorization , 2013, SIAM J. Matrix Anal. Appl..

[22]  Xiaowei Gao,et al.  A SOLVER OF LINEAR SYSTEMS OF EQUATIONS (REBSM) FOR LARGE-SCALE ENGINEERING PROBLEMS , 2012 .

[23]  H. Harbrecht,et al.  On the low-rank approximation by the pivoted Cholesky decomposition , 2012 .