Parallel algorithms for LU decomposition on a shared memory multiprocessor

Basit Öğe Kaydı
dc.contributor.authorKaya, D
dc.contributor.authorWright, K
dc.date.accessioned2026-08-12T17:43:25Z
dc.date.issued2005
dc.departmentFırat Üniversitesi
dc.description.abstractIn 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. (C) 2004 Elsevier Inc. All rights reserved.
dc.identifier.doi10.1016/j.amc.2004.01.027
dc.identifier.endpage191
dc.identifier.issn0096-3003
dc.identifier.issn1873-5649
dc.identifier.issue1
dc.identifier.scopus2-s2.0-12444290926
dc.identifier.scopusqualityQ1
dc.identifier.startpage179
dc.identifier.urihttps://doi.org/10.1016/j.amc.2004.01.027
dc.identifier.urihttps://hdl.handle.net/11508/60127
dc.identifier.volume163
dc.identifier.wosWOS:000227044000017
dc.identifier.wosqualityQ1
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherElsevier Science Inc
dc.relation.ispartofApplied Mathematics and Computation
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260511
dc.subjectthe LU decomposition method
dc.subjectparallel algorithms
dc.subjectshared memory multiprocessor
dc.titleParallel algorithms for LU decomposition on a shared memory multiprocessor
dc.typeArticle

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu