Paper
6 May 2022 Research on parallel algorithms for solving tridiagonal sparse linear equations
Jin Ji, KeYing Huang, XiaoJie Suo, Jun Zhao, Wen Yan
Author Affiliations +
Proceedings Volume 12176, International Conference on Algorithms, Microchips and Network Applications; 121760S (2022) https://doi.org/10.1117/12.2636414
Event: International Conference on Algorithms, Microchips, and Network Applications 2022, 2022, Zhuhai, China
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.
© (2022) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jin Ji, KeYing Huang, XiaoJie Suo, Jun Zhao, and Wen Yan "Research on parallel algorithms for solving tridiagonal sparse linear equations", Proc. SPIE 12176, International Conference on Algorithms, Microchips and Network Applications, 121760S (6 May 2022); https://doi.org/10.1117/12.2636414
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Parallel computing

Computing systems

Analytical research

Matrices

Numerical analysis

Numerical simulations

Computer simulations

Back to Top