A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices

Yu Fai Fung; Wai Leung Cheung; Michael G. Singh; Muhammet F. Ercan

A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices

Yu Fai Fung
, Wai Leung Cheung
, Michael G. Singh
, Muhammet F. Ercan

Research output: Unpublished conference presentation (presented paper, abstract, poster) › Conference presentation (not published in journal/proceeding/book) › Academic research › peer-review

3 Citations (Scopus)

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.

Original language	English
Pages	776-779
Number of pages	4
Publication status	Published - Aug 2003
Event	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) - Victoria, B.C., Canada Duration: 28 Aug 2003 → 30 Aug 2003

Conference

Conference	2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)
Country/Territory	Canada
City	Victoria, B.C.
Period	28/08/03 → 30/08/03

Keywords

LU decomposition
Parallel computing
SIMD mechanism
Sparse matrix

ASJC Scopus subject areas

Signal Processing
Computer Networks and Communications

Cite this

@conference{26065f5637bb463f8ac652bd64754122,

title = "A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices",

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.",

keywords = "LU decomposition, Parallel computing, SIMD mechanism, Sparse matrix",

author = "Fung, \{Yu Fai\} and Cheung, \{Wai Leung\} and Singh, \{Michael G.\} and Ercan, \{Muhammet F.\}",

year = "2003",

month = aug,

language = "English",

pages = "776--779",

note = "2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003) ; Conference date: 28-08-2003 Through 30-08-2003",

}

A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices. / Fung, Yu Fai; Cheung, Wai Leung; Singh, Michael G. et al.
2003. 776-779 Paper presented at 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003), Victoria, B.C., Canada.

Research output: Unpublished conference presentation (presented paper, abstract, poster) › Conference presentation (not published in journal/proceeding/book) › Academic research › peer-review

TY - CONF

T1 - A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices

AU - Fung, Yu Fai

AU - Cheung, Wai Leung

AU - Singh, Michael G.

AU - Ercan, Muhammet F.

PY - 2003/8

Y1 - 2003/8

N2 - 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.

AB - 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.

KW - LU decomposition

KW - Parallel computing

KW - SIMD mechanism

KW - Sparse matrix

UR - https://www.scopus.com/pages/publications/0142168870

M3 - Conference presentation (not published in journal/proceeding/book)

AN - SCOPUS:0142168870

SP - 776

EP - 779

T2 - 2003 IEEE Pacific Rim Conference on Communications Computers and Signal Processing (PACRIM 2003)

Y2 - 28 August 2003 through 30 August 2003

ER -

A PC Based Parallel LU Decomposition Algorithm for Sparse Matrices

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this