Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30913
Title: A PC based parallel LU decomposition algorithm for sparse matrices
Authors: Fung, YF
Cheung, WL
Singh, MG
Ercan, MF
Keywords: Matrix decomposition
Parallel algorithms
Sparse matrices
Issue Date: 2003
Publisher: IEEE
Source: 2003 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2003 : PACRIM, 28-30 August 2003, v. 2, p. 776-779 How to cite?
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.
URI: http://hdl.handle.net/10397/30913
ISBN: 0-7803-7978-0
DOI: 10.1109/PACRIM.2003.1235896
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

31
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.