Parallel algorithms for LU decomposition on a shared memory multiprocessor

In this work, we present the numerical results (using C++) obtained from seven different versions of the LU decomposition algorithms. Four of the algorithms use Crout-like reduction and three of the algorithms use Doolittle-like reduction.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 163; číslo 1; s. 179 - 191
Hlavní autoři:	Kaya, Dogan, Wright, Ken
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY Elsevier Inc 05.04.2005 Elsevier
Témata:	Exact sciences and technology Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Parallel algorithms Sciences and techniques of general use Shared memory multiprocessor The LU decomposition method The LU decomposition method Parallel algorithms Shared memory multiprocessor Multiprocessor Parallel algorithm Numerical analysis Applied mathematics Decomposition method Shared memory
ISSN:	0096-3003, 1873-5649
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	In this work, we present the numerical results (using C++) obtained from seven different versions of the LU decomposition algorithms. Four of the algorithms use Crout-like reduction and three of the algorithms use Doolittle-like reduction.
ISSN:	0096-3003 1873-5649
DOI:	10.1016/j.amc.2004.01.027