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žené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 163; číslo 1; s. 179 - 191
Hlavní autori: Kaya, Dogan, Wright, Ken
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY Elsevier Inc 05.04.2005
Elsevier
Predmet:
ISSN:0096-3003, 1873-5649
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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