Research on parallel algorithms for solving tridiagonal sparse linear equations

TL;DR: This paper first analyzes the potential parallel process of solving tridiagonal sparse linear equations by Gaussian elimination method and matrix splitting method, and designs and implements these two parallel algorithms to solve sparselinear equations.

Abstract: There are many practical problems in real life, which are finally attributed to solving large sparse linear equations. In order to solve sparse linear equations in parallel, this paper first analyzes the potential parallel process of solving tridiagonal sparse linear equations by Gaussian elimination method and matrix splitting method, and designs and implements these two parallel algorithms to solve sparse linear equations, Through different process tests and performance analysis, it shows that the Gaussian elimination method has poor time performance, while the matrix splitting method has good efficiency in both space and time.