File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0031123707
- WOS: WOS:A1997WZ90300004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Efficient parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes
Title | Efficient parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes |
---|---|
Authors | |
Keywords | Efficiency of parallel algorithms Hypercubes Linear systems of equations LU decomposition Parallel processing Partial pivoting |
Issue Date | 1997 |
Publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa |
Citation | Computers And Mathematics With Applications, 1997, v. 33 n. 8, p. 39-50 How to Cite? |
Abstract | LU decomposition is intensively used in various scientific and engineering computations. A parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes is presented. Using n processors, the presented algorithm can finish LU decomposition of an n x n matrix in O(n2/3 + O(n√nlog2 n)) steps, including computations as well as communications, and its efficiency is 1 asymptotically when n becomes large. The algorithm employs row-column-as well as block-parallelisms interchangeably so that the n processors are used efficiently in the whole computation process. Using the rich connectivity, all the data alignment requirements can be realized in O(log2 n) steps. The algorithm proposed here not only is suitable for systems with small numbers of processors, but also is suitable for systems with large numbers of processors. |
Persistent Identifier | http://hdl.handle.net/10722/89117 |
ISSN | 2023 Impact Factor: 2.9 2023 SCImago Journal Rankings: 0.949 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Z | en_HK |
dc.contributor.author | Cheung, DW | en_HK |
dc.date.accessioned | 2010-09-06T09:52:36Z | - |
dc.date.available | 2010-09-06T09:52:36Z | - |
dc.date.issued | 1997 | en_HK |
dc.identifier.citation | Computers And Mathematics With Applications, 1997, v. 33 n. 8, p. 39-50 | en_HK |
dc.identifier.issn | 0898-1221 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/89117 | - |
dc.description.abstract | LU decomposition is intensively used in various scientific and engineering computations. A parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes is presented. Using n processors, the presented algorithm can finish LU decomposition of an n x n matrix in O(n2/3 + O(n√nlog2 n)) steps, including computations as well as communications, and its efficiency is 1 asymptotically when n becomes large. The algorithm employs row-column-as well as block-parallelisms interchangeably so that the n processors are used efficiently in the whole computation process. Using the rich connectivity, all the data alignment requirements can be realized in O(log2 n) steps. The algorithm proposed here not only is suitable for systems with small numbers of processors, but also is suitable for systems with large numbers of processors. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Pergamon. The Journal's web site is located at http://www.elsevier.com/locate/camwa | en_HK |
dc.relation.ispartof | Computers and Mathematics with Applications | en_HK |
dc.subject | Efficiency of parallel algorithms | en_HK |
dc.subject | Hypercubes | en_HK |
dc.subject | Linear systems of equations | en_HK |
dc.subject | LU decomposition | en_HK |
dc.subject | Parallel processing | en_HK |
dc.subject | Partial pivoting | en_HK |
dc.title | Efficient parallel algorithm for dense matrix LU decomposition with pivoting on hypercubes | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0898-1221&volume=33 No 8&spage=&epage=&date=1997&atitle=Efficient+Parallel+Algorithm+for+Dense+Matrix+LU+Decomposition+with+Pivoting+on+Hypercubes | en_HK |
dc.identifier.email | Cheung, DW:dcheung@cs.hku.hk | en_HK |
dc.identifier.authority | Cheung, DW=rp00101 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-0031123707 | en_HK |
dc.identifier.hkuros | 26182 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0031123707&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 33 | en_HK |
dc.identifier.issue | 8 | en_HK |
dc.identifier.spage | 39 | en_HK |
dc.identifier.epage | 50 | en_HK |
dc.identifier.isi | WOS:A1997WZ90300004 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Liu, Z=7406671827 | en_HK |
dc.identifier.scopusauthorid | Cheung, DW=34567902600 | en_HK |
dc.identifier.issnl | 0898-1221 | - |