Abstract

Linear equations are used in the mathematical models of many engineering problems, including load-flow in power engineering and electrical railway simulation. A common approach for solving the linear equations is by LU decomposition, which is then followed by forward and backward substitution. The LU decomposition operation is a computation intensive algorithm and in this paper, we present a cost-effective SIMD parallel algorithm for the LU decomposition of sparse matrices. The algorithm can be implemented using a common personal computer and does not require other hardware support.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.